Pages that link to "Item:Q3584967"

The following pages link to The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions (Q3584967):

Displaying 12 items.

• An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic (Q475340) (← links)
• A note on model checking the modal \(\nu\)-calculus (Q1176250) (← links)
• The model checking fingerprints of CTL operators (Q2317834) (← links)
• Complexity of model checking for cardinality-based belief revision operators (Q2401889) (← links)
• Universal guards, relativization of quantifiers, and failure models in model checking modulo theories (Q2786907) (← links)
• Intuitionistic implication makes model checking hard (Q2887060) (← links)
• The model checking problem for propositional intuitionistic logic with one variable is AC 1 -complete (Q3113702) (← links)
• The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey (Q3586006) (← links)
• (Q4799291) (← links)
• Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption (Q5111452) (← links)
• A note on the complexity of S4.2 (Q5156186) (← links)
• Mathematical Foundations of Computer Science 2005 (Q5492896) (← links)