The following pages link to Computer Science Logic (Q5292653):
Displaying 14 items.
- An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic (Q475340) (← links)
- The tabularity problem over the minimal logic (Q515492) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- A note on the computational complexity of the pure classical implication calculus (Q1263982) (← links)
- A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
- Complexity of some problems in positive and related calculi (Q1401362) (← links)
- Decidability of quantified propositional intuitionistic logic and S4 on trees of height and arity \(\leq \omega\) (Q1826435) (← links)
- Unification in pretabular extensions of S4 (Q2239389) (← links)
- Definability and interpolation in non-classical logics (Q2498367) (← links)
- LC and Its Pretabular Relatives (Q3305421) (← links)
- The Complexity of Enriched Mu-Calculi (Q3535618) (← links)
- The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions (Q3584967) (← links)
- Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic (Q3623218) (← links)
- A note on the complexity of S4.2 (Q5156186) (← links)
