Politeness and stable infiniteness: stronger together

DOI10.1007/978-3-030-79876-5_9OpenAlexW3186746044MaRDI QIDQ2055852

Ying Sheng, Clark Barrett, Andrew Reynolds, Christophe Ringeissen, Yoni Zohar, Cesare Tinelli

Publication date: 1 December 2021

Full work available at URL: https://arxiv.org/abs/2104.11738

Mathematics Subject Classification ID

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

Related Items

Combining stable infiniteness and (strong) politeness ⋮ Polite combination of algebraic datatypes

Cites Work

• Unnamed Item
• Unnamed Item
• Computer aided verification. 23rd international conference, CAV 2011, Snowbird, UT, USA, July 14--20, 2011. Proceedings
• Many-sorted equivalence of shiny and strongly polite theories
• Combining nonstably infinite theories
• Politeness for the theory of algebraic datatypes
• Revisiting the Equivalence of Shininess and Politeness
• Satisfiability Modulo Theories
• Combinations of Theories for Decidable Fragments of First-Order Logic
• Simplification by Cooperating Decision Procedures
• Polite Theories Revisited
• Logics in Artificial Intelligence
• Frontiers of Combining Systems
• Combined Satisfiability Modulo Parametric Theories