Combining Theories: The Ackerman and Guarded Fragments

DOI10.1007/978-3-642-24364-6_4zbMath1348.03027OpenAlexW110471801MaRDI QIDQ3172881

Pascal Fontaine, Carlos Areces

Publication date: 7 October 2011

Published in: Frontiers of Combining Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24364-6_4

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Combined logics (03B62)

Related Items (2)

Many-sorted equivalence of shiny and strongly polite theories ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates

Cites Work

• Combining nonstably infinite theories
• Modal languages and bounded fragments of predicate logic
• Loosely guarded fragment of first-order logic has the finite model property
• Guarded fixed point logics and the monadic theory of countable trees.
• Unions of non-disjoint theories and combinations of satisfiability procedures
• Combinations of Theories for Decidable Fragments of First-Order Logic
• Combining Theories with Shared Set Operations
• Simplification by Cooperating Decision Procedures
• On the Restraining Power of Guards
• Tolerance logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combining Theories: The Ackerman and Guarded Fragments