The following pages link to (Q5465436):
Displayed 18 items.
- On provability logics with linearly ordered modalities (Q456968) (← links)
- On the complexity of the closed fragment of Japaridze's provability logic (Q482919) (← links)
- Boolean logics with relations (Q604451) (← links)
- An NP-complete fragment of fibring logic (Q905999) (← links)
- Parameterized modal satisfiability (Q1759682) (← links)
- The complexity of identifying characteristic formulae (Q1987735) (← links)
- Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
- Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter (Q2323638) (← links)
- In all but finitely many possible worlds: model-theoretic investigations on `\textit{overwhelming majority}' default conditionals (Q2398203) (← links)
- A survey on temporal logics for specifying and verifying real-time systems (Q2418645) (← links)
- Computational complexity of the word problem in modal and Heyting algebras with a small number of generators (Q2678341) (← links)
- The Closed Fragment of IL is PSPACE Hard (Q2825406) (← links)
- Boolean Logics with Relations (Q3498402) (← links)
- Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
- COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS (Q5241231) (← links)
- Modal Logics with Hard Diamond-Free Fragments (Q5283414) (← links)
- Completing the Picture: Complexity of Graded Modal Logics with Converse (Q6063859) (← links)
- Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино? (Q6075540) (← links)