Combining Finite Combination Properties: Finite Models and Busy Beavers

DOI10.1007/978-3-031-43369-6_9MaRDI QIDQ6496627zbMATH OpenFDO

Authors Guilherme V. Toledo, Yoni Zohar, Clark Barrett

Publication date 3 May 2024

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-43369-6_9

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• scientific article; zbMATH DE number 1357400
• Busy beavers gone wild
• Combining non-stably infinite theories
• scientific article; zbMATH DE number 4152351

Cites work

• scientific article; zbMATH DE number 8896 (Why is no real title available?)
• Frontiers of Combining Systems
• Logics in Artificial Intelligence
• Many-sorted equivalence of shiny and strongly polite theories
• On non-computable functions
• Polite combination of algebraic datatypes
• Polite theories revisited
• Politeness and stable infiniteness: stronger together
• Simplification by Cooperating Decision Procedures

Cited in

(5)

• Combining combination properties: minimal models
• Number theory combination: natural density and SMT
• Shininess, strong politeness, and unicorns
• Combining combination properties. I: Nelson-Oppen and politeness
• Being polite is not enough (and other limits of theory combination)

This page was built for publication: Combining Finite Combination Properties: Finite Models and Busy Beavers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496627)