Combining theories: the Ackerman and guarded fragments
From MaRDI portal
Publication:3172881
DOI10.1007/978-3-642-24364-6_4zbMATH Open1348.03027OpenAlexW110471801MaRDI QIDQ3172881FDOQ3172881
Authors: Carlos Areces, Pascal Fontaine 
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
Recommendations
Cites Work
- Modal logic
- Modal languages and bounded fragments of predicate logic
- Simplification by Cooperating Decision Procedures
- Handbook of modal logic
- Title not available (Why is that?)
- Combining nonstably infinite theories
- 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
- Title not available (Why is that?)
- On the Restraining Power of Guards
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Loosely guarded fragment of first-order logic has the finite model property
- Tolerance logic
- Guarded fixed point logics and the monadic theory of countable trees.
Cited In (3)
- Many-sorted equivalence of shiny and strongly polite theories
- Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
- To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in $\mathit{SMT}(\mathcal{EUF} \cup \mathcal{T})$
This page was built for publication: Combining theories: the Ackerman and guarded fragments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172881)
