Algorithmic properties of QK4.3 and QS4.3 (original) (raw)
Related papers
A simplest undecidable modal logic
2011
Undecidability of modal and intermediate first-order logics with two individual variables
The Journal of Symbolic Logic, 1993
Advances in Modal Logic, 2020
Finite non-deterministic semantics for some modal systems
Marcelo Esteban Coniglio, Newton Marques Peron
Decidable and undecidable logics with a binary modality
Journal of Logic, Language and Information, 1995
A note on some explicit modal logics
2006
Post complete and 0-axiomatizable modal logics
Annals of Pure and Applied Logic, 1990
Algorithmic properties of first-order modal logics of finite Kripke frames in restricted languages
Journal of Logic and Computation, 2020
Proving unprovability in some normal modal logics
1991
On the complexity of fragments of modal logics
AiML-2004: Advances in Modal Logic, 2004
On the Complexity of Elementary Modal Logics
Computing Research Repository, 2008
Modal Languages and Bounded Fragments of Predicate Logic
Hajnal Andréka, Andreka Hajnal, István Németi, Johan van Benthem
Journal of Philosophical Logic, 1998
Products of ‘transitive’modal logics. Part I:‘negative’results
2004
Undefinability of propositional quantifiers in the modal system S4
Studia Logica, 1995
On the Complexity of Graded Modal Logics with Converse
Lecture Notes in Computer Science, 2019
Recursive complexity of the Carnap first order modal logic C
MLQ, 2006
Undecidable problems for modal definability: Table 1
Journal of Logic and Computation, 2016
Decidability of order-based modal logics
Journal of Computer and System Sciences, 2017
On PSPACE-decidability in Transitive Modal Logic
Aiml, 2004
On Some Completeness Theorems in Modal Logic
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1966
On Theses without Iterated Modalities of Modal Logics Between C1 and S5. Part 2
Bulletin of the Section of Logic, 2017
Studia Logica, 2018
On the Provability Logic of Bounded Arithmetic
Rineke Verbrugge, Alessandro Berarducci
Annals of Pure and Applied Logic, 1993
Completing the Picture: Complexity of Graded Modal Logics with Converse
Theory and Practice of Logic Programming
On the complexity of arithmetical interpretations of modal formulae
Archive for Mathematical Logic, 1993
Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1971
Modal Logic With Non-deterministic Semantics: Part I - Propositional Case
2018
Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA
Logical Methods in Computer Science, 2006
On the Products of Linear Modal Logics
Journal of Logic and Computation, 2001
Proving unprovability in some normal modal logics. Bull Sect Logic
Bulletin of the Section of Logic
Undecidability of the unification and admissibility problems for modal and description logics
ACM Transactions on Computational Logic, 2008
Effective completeness theorems for modal logic
Annals of Pure and Applied Logic, 2004