Pages that link to "Item:Q2758067"

The following pages link to Decidable fragments of first-order modal logics (Q2758067):

Displaying 18 items.

• PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\) (Q352965) (← links)
• Quantified epistemic logics for reasoning about knowledge in multi-agent systems (Q835839) (← links)
• Decidable fragments of first-order temporal logics (Q1591203) (← links)
• Propositional epistemic logics with quantification over agents of knowledge (Q1743999) (← links)
• On the decidability and complexity of reasoning about only knowing (Q1978243) (← links)
• Complexity of finite-variable fragments of propositional temporal and modal logics of computation (Q2148903) (← links)
• Parameterized verification of leader/follower systems via first-order temporal logic (Q2149965) (← links)
• Undecidability of first-order modal and intuitionistic logics with two variables and one monadic predicate letter (Q2323638) (← links)
• Mechanising first-order temporal resolution (Q2486579) (← links)
• Undecidability of First-Order Intuitionistic and Modal Logics with Two variables (Q3370616) (← links)
• (Q3384090) (← links)
• A Complete Quantified Epistemic Logic for Reasoning about Message Passing Systems (Q3602954) (← links)
• First-Order Linear-Time Epistemic Logic with Group Knowledge: An Axiomatisation of the Monodic Fragment (Q3638280) (← links)
• (Q5090984) (← links)
• (Q5092390) (← links)
• Epistemic logics with quantification over epistemic operators: decidability and expressiveness (Q6054107) (← links)
• Are bundles good deals for first-order modal logic? (Q6116193) (← links)
• Semiproducts, products, and modal predicate logics: some examples (Q6123100) (← links)