Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates

DOI10.1007/978-3-031-38499-8_31MaRDI QIDQ6492767zbMATH OpenFDO

Authors B. Boigelot, Pascal Fontaine, Baptiste Vergain

Publication date 26 April 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-38499-8_31

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• A mathematical introduction to logic.
• A note on definability in fragments of arithmetic with free unary predicates
• Automata and temporal logic over arbitrary linear time
• Automata on linear orderings
• scientific article; zbMATH DE number 3767656 (Why is no real title available?)
• scientific article; zbMATH DE number 42574 (Why is no real title available?)
• scientific article; zbMATH DE number 3212886 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• Monadic theory of order and topology in ZFC
• Presburger arithmetic with unary predicates is Π₁¹ complete
• Temporal logics over linear time domains are in PSPACE
• The complexity of temporal logic over the reals
• The decision problem for linear temporal logic
• The monadic theory of order

This page was built for publication: Decidability of Difference Logic over the Reals with Uninterpreted Unary Predicates

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