Politeness and stable infiniteness: stronger together

DOI10.1007/978-3-030-79876-5_9MaRDI QIDQ2055852zbMATH OpenOpenAlexFDO

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

Publication date 1 December 2021

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• Polite theories revisited
• Politeness and combination methods for theories with bridging functions
• Revisiting the equivalence of shininess and politeness
• A polite non-disjoint combination method: theories with bridging functions revisited
• Polite combination of algebraic datatypes

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)

• Combining stable infiniteness and (strong) politeness
• Combining Finite Combination Properties: Finite Models and Busy Beavers
• Polite combination of algebraic datatypes

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)