Pages that link to "Item:Q1855229"

The following pages link to The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic (Q1855229):

Displaying 38 items.

• Reasoning about common knowledge with infinitely many agents (Q598197) (← links)
• Boolean logics with relations (Q604451) (← links)
• Logic and social cognition. The facts matter, and so do computational models (Q843769) (← links)
• An NP-complete fragment of fibring logic (Q905999) (← links)
• Generalized modal satisfiability (Q988571) (← links)
• Reasoning about knowledge of unawareness (Q1036579) (← links)
• A polynomial space construction of tree-like models for logics with local chains of modal connectives (Q1399966) (← links)
• On the complexity of input/output logic (Q1688711) (← links)
• Parameterized modal satisfiability (Q1759682) (← links)
• The complexity of propositional linear temporal logics in simple cases (Q1854521) (← links)
• Satisfiability problem for modal logic with global counting operators coded in binary is \textsc{NExpTime}-complete (Q1941691) (← links)
• Deciding the word problem in pure double Boolean algebras (Q1948275) (← links)
• The complexity of identifying characteristic formulae (Q1987735) (← links)
• Epistemic closure and epistemic logic. I: Relevant alternatives and subjunctivism (Q2018588) (← 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)
• The expressibility of fragments of hybrid graph logic on finite digraphs (Q2446549) (← links)
• The semijoin algebra and the guarded fragment (Q2567344) (← links)
• Computational complexity of the word problem in modal and Heyting algebras with a small number of generators (Q2678341) (← links)
• Two-Variable Separation Logic and Its Inner Circle (Q2957697) (← links)
• Boolean Logics with Relations (Q3498402) (← links)
• Complexity of intuitionistic propositional logic and its fragments (Q3643316) (← links)
• Adding clauses to poor man's logic (without increasing the complexity) (Q3647233) (← links)
• SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation (Q4443408) (← links)
• Quirky Quantifiers: Optimal Models and Complexity of Computation Tree Logic (Q4639929) (← links)
• A simple tableau system for the logic of elsewhere (Q4645235) (← links)
• Complexity of logics for multi-agent systems with restricted modal context (Q4925177) (← links)
• TRANSITIVE PRIMAL INFON LOGIC (Q4928774) (← links)
• Undecidability of QLTL and QCTL with two variables and one monadic predicate letter (Q5059700) (← links)
• A note on the complexity of S4.2 (Q5156186) (← links)
• A new method for testing decision procedures in modal logics (Q5234709) (← links)
• Parametrised Complexity of Satisfiability in Temporal Logic (Q5278205) (← links)
• Modal Logics with Hard Diamond-Free Fragments (Q5283414) (← links)
• Characterizing the NP-PSPACE Gap in the Satisfiability Problem for Modal Logic (Q5427258) (← links)
• Minimal refinements of specifications in modal and temporal logics (Q5899160) (← links)
• Minimal refinements of specifications in modal and temporal logics (Q5920375) (← links)
• Improved decision procedures for the modal logics K, T and S4 (Q6560176) (← links)