Logics with the universal modality and admissible consecutions

  title={Logics with the universal modality and admissible consecutions},
  author={Vladimir V. Rybakov},
  journal={Journal of Applied Non-Classical Logics},
  pages={383 - 396}
  • V. Rybakov
  • Published 1 January 2007
  • Mathematics, Computer Science
  • Journal of Applied Non-Classical Logics
In this paper1 we study admissible consecutions (inference rules) in multi-modal logics with the universal modality. We consider extensions of multi-modal logic S4n augmented with the universal modality. Admissible consecutions form the largest class of rules, under which a logic (as a set of theorems) is closed. We propose an approach based on the context effective finite model property. Theorem 7, the main result of the paper, gives sufficient conditions for decidability of admissible… 
Rules admissible in transitive temporal logic TS4, sufficient condition
Best Unifiers in Transitive Modal Logics
  • V. Rybakov
  • Computer Science, Philosophy
    Stud Logica
  • 2011
This paper offers a brief analysis of the unification problem in modal transitive logics related to the logic S4: S4 itself, K4, Grz and Gödel-Löb provability logic GL. As a result, new, but not the
A Tableau Method for Checking Rule Admissibility in S4
Linear Non-Transitive Temporal Logic, Knowledge Operations, Algorithms for Admissibility
Algorithms are found solving problems of satisfiability, decidability and admissibility of inference rules, conceptions of knowledge and agent's knowledge in non-transitive temporal linear logic LTL(Past,m).
Chance Discovery and Unification in Linear Modal Logic
It is proved that any formula unifiable in S4.3 has a most general unifier, and an algorithm is given which, for any unifiable formula, constructs a most-general unifier.
Unification in linear temporal logic LTL
Inference Rules in Nelson’s Logics, Admissibility and Weak Admissibility
This paper founds algorithms for recognizing weak admissibility andAdmissibility itself – for restricted cases, to show the problems arising in the course of study.
Writing out Unifiers in Linear Temporal Logic
  • V. Rybakov
  • Computer Science, Mathematics
    J. Log. Comput.
  • 2012
It is shown any unifiable in LTL formula has a most general unifier (thus, LTL enjoys unitary unification), though it is also shown that there are unifiableIn LTL formulas which are not projective.


Products of Modal Logics, Part 1
The paper studies many-dimensional modal logics corresponding to products of Kripke frames. It proves results on axiomatisability, the finite model property and decidability for product logics, by
A (nother) characterization of intuitionistic propositional logic
Using the Universal Modality: Gains and Questions
The universal modality is advertised as a natural and helpful tool, providing a better medium for the mission of modality; and second, to illustrate the typical problems arising when enricha ments of modal languages are investigated.
Hereditarily Structurally Complete Modals Logics
  • V. Rybakov
  • Philosophy, Mathematics
    J. Symb. Log.
  • 1995
There are exactly twenty maximal structurally incomplete modal logics above K4 and they are all tabular: a modal logic λ is hereditarily structurally complete iffλ is not included in any logic from the list of twenty special tabular logics.
On Finite Model Property for Admissible Rules
It is shown that all modal logics A of width ≤ 2 extending S4 which are not sub-logics of three special tabular logics (which is equipotent to all these λ extend a certain subframe logic defined over S4 by omission of four special frames) have fmp w.r.t. r.
A Basis in Semi‐Reduced Form for the Admissible Rules of the Intuitionistic Logic IPC
We study the problem of finding a basis for all rules admissible in the intuitionistic propositional logic IPC. The main result is Theorem 3.1 which gives a basis consisting of all rules in
Unification in Intuitionistic Logic
We show that the variety of Heyting algebras has finitary unification type. We also show that the subvariety obtained by adding it De Morgan law is the biggest variety of Heyting algebras having
Multi-dimensional modal logic
This book defines the subject matter of this book: multi-dimensional modal logic (MDML), and briefly considers what one understands by the notion of “modal logic”.
Multi-Dimensional Modal Logic as a Framework for Spatio-Temporal Reasoning
A two-dimensional logic capable of describing topological relationships that change over time, called PSTL (Propositional Spatio-Temporal Logic), is constructed and it is shown that it contains decidable fragments into which various temporal extensions of the spatial logic RCC-8 can be embedded.
Modal logic
This paper shows how the tree or tableau method provides a simple and easily comprehensible decision procedure for systems such as K, T, S4 and S5 and how the formal techniques of modal logic can be used to analyse several informal problems involving modal concepts, including cases combining modality with quantification.