Monodic packed fragment with equality is decidable

DOI10.1023/A:1021356410579MaRDI QIDQ1863828zbMATH OpenFDO

Authors Ian Hodkinson

Publication date 12 March 2003

Published in Studia Logica (Search for Journal in Brave)

zbMATH Keywords

monadic second-order logicuntilclique-guarded fragmentpredicate temporal logicquasimodelsince

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)

Recommendations

• Automated Deduction – CADE-20
• Decidable fragments of first-order temporal logics
• Complexity of monodic guarded fragments over linear and real time
• Axiomatizing the monodic fragment of first-order temporal logic
• Equality and monodic first-order temporal logic

Cited in

(15)

• A new modal framework for epistemic logic
• Automated Deduction – CADE-20
• Decidable fragments of first-order temporal logics
• Decidable cases of first-order temporal logic with functions
• Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting
• Beyond knowing that: a new generation of epistemic logics
• Axiomatizing the monodic fragment of first-order temporal logic
• First-Order Linear-Time Epistemic Logic with Group Knowledge: An Axiomatisation of the Monodic Fragment
• Monodic temporal logic with quantified propositional variables
• Mechanising first-order temporal resolution
• First-order temporal verification in practice
• Quantified epistemic logics for reasoning about knowledge in multi-agent systems
• Equality and monodic first-order temporal logic
• Complexity of monodic guarded fragments over linear and real time
• Decidability of the monadic shallow linear first-order fragment with straight dismatching constraints

This page was built for publication: Monodic packed fragment with equality is decidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1863828)