Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting
From MaRDI portal
Publication:2957765
DOI10.1145/2757285zbMath1354.03022arXiv1407.1386OpenAlexW3123793150MaRDI QIDQ2957765
Christopher Hampson, Agi Kurucz
Publication date: 30 January 2017
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.1386
Modal logic (including the logic of norms) (03B45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Related Items
The decision problem of modal product logics with a diagonal, and faulty counter machines ⋮ On the termination and structural termination problems for counter machines with incrementing errors ⋮ First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concerning the semantic consequence relation in first-order temporal logic
- Incompleteness of first-order temporal logic with until
- A decidable temporal logic of parallelism
- Temporal logic. 1st International Conference, ICTL '94, Bonn, Germany, July 11-14, 1994. Proceedings
- Multi-dimensional modal logic
- Many-dimensional modal logics: theory and applications
- Decidable fragments of first-order temporal logics
- Axiomatizing the monodic fragment of first-order temporal logic
- Equality and monodic first-order temporal logic
- Monodic packed fragment with equality is decidable
- On the feasibility of checking temporal integrity constraints
- Non-primitive recursive decidability of products of modal logics with expanding domains
- Complexity of monodic guarded fragments over linear and real time
- Non-finitely axiomatisable two-dimensional modal logics
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics
- One-variable first-order linear temporal logics with counting
- Monodic Fragments of First-Order Temporal Logics: 2000–2001 A.D.
- Lossy Counter Machines Decidability Cheat Sheet
- Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
- Logics containing K4. Part II
- Decidability and incompleteness results for first-order temporal logics of linear time
- A really temporal logic
- On the Decision Problem for Two-Variable First-Order Logic
- Products of modal logics, part 1
- On Non-local Propositional and Weak Monodic Quantified CTL*
- On the Products of Linear Modal Logics
- Undecidability of compass logic
- Complexity Results for First-Order Two-Variable Logic with Counting
- Monodic temporal resolution
- Automated Deduction – CADE-20
- Modal logics with linear alternative relations
- Products of ‘transitive” modal logics
- Two-dimensional modal logic
