Politeness and stable infiniteness: stronger together
From MaRDI portal
Publication:2055852
Recommendations
Cites work
- A mathematical introduction to logic.
- An abstract decision procedure for a theory of inductive data types.
- Combinations of Theories for Decidable Fragments of First-Order Logic
- Combined Satisfiability Modulo Parametric Theories
- Combining nonstably infinite theories
- Computer aided verification. 23rd international conference, CAV 2011, Snowbird, UT, USA, July 14--20, 2011. Proceedings
- Frontiers of Combining Systems
- Logics in Artificial Intelligence
- Many-sorted equivalence of shiny and strongly polite theories
- Polite theories revisited
- Politeness for the theory of algebraic datatypes
- Revisiting the equivalence of shininess and politeness
- Satisfiability modulo theories
- Simplification by Cooperating Decision Procedures
Cited in
(3)
This page was built for publication: Politeness and stable infiniteness: stronger together
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055852)