Combining theories: the Ackerman and guarded fragments
From MaRDI portal
Publication:3172881
DOI10.1007/978-3-642-24364-6_4zbMATH Open1348.03027OpenAlexW110471801MaRDI QIDQ3172881FDOQ3172881
Recommendations
Cites Work
- scientific article; zbMATH DE number 3715502 (Why is no real title available?)
- scientific article; zbMATH DE number 1341606 (Why is no real title available?)
- scientific article; zbMATH DE number 1059246 (Why is no real title available?)
- scientific article; zbMATH DE number 1140674 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- Combinations of Theories for Decidable Fragments of First-Order Logic
- Combining nonstably infinite theories
- Combining theories with shared set operations
- Guarded fixed point logics and the monadic theory of countable trees.
- Handbook of modal logic
- Loosely guarded fragment of first-order logic has the finite model property
- Modal languages and bounded fragments of predicate logic
- Modal logic
- On the Restraining Power of Guards
- Simplification by Cooperating Decision Procedures
- Tolerance logic
- Unions of non-disjoint theories and combinations of satisfiability procedures
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)
