Pages that link to "Item:Q4910732"

The following pages link to On the complexity of elementary modal logics (Q4910732):

Displaying 23 items.

• A dichotomy for some elementarily generated modal logics (Q497429) (← links)
• 3-SAT = SAT for a class of normal modal logics (Q673009) (← links)
• Generalized modal satisfiability (Q988571) (← links)
• The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics (Q1329742) (← links)
• The price of universality (Q1815426) (← links)
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic (Q1855229) (← links)
• Computing with cylindric modal logics and arrow logics, lower bounds (Q1863830) (← links)
• Elementary definability and completeness in general and positive modal logic (Q1868490) (← links)
• The complexity of identifying characteristic formulae (Q1987735) (← links)
• On the complexity of graded modal logics with converse (Q2296751) (← links)
• Complexity of modal logics with Presburger constraints (Q2638188) (← links)
• On the relative complexity of labelled modal tableaux (Q2843911) (← links)
• On the size of shortest modal descriptions (Q2904050) (← links)
• Decidable Elementary Modal Logics (Q2986825) (← links)
• Weak Kripke Structures and LTL (Q3090846) (← links)
• Adding clauses to poor man's logic (without increasing the complexity) (Q3647233) (← links)
• (Q4364506) (← links)
• Satisfiability versus Finite Satisfiability in Elementary Modal Logics (Q4611207) (← links)
• The Succinctness of First-order Logic over Modal Logic via a Formula Size Game (Q4636046) (← links)
• KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS (Q5222523) (← links)
• On the Decidability of Elementary Modal Logics (Q5277903) (← links)
• Computer Science Logic (Q5292653) (← links)
• The Complexity of Decomposing Modal and First-Order Theories (Q5892176) (← links)