Model completeness for rational trees

DOI10.1007/978-3-031-63498-7_16MaRDI QIDQ7034862zbMATH OpenFDO

Authors Silvio Ghilardi, Lia M. Poidomani

Publication date 31 January 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-63498-7_16

zbMATH Keywords

decision proceduresinfinite treesmodel completeness

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• An improved lower bound for the elementary theories of trees
• Fast congruence closure and extensions
• Fast Decision Procedures Based on Congruence Closure
• From bisimulation to simulation: Coarsest partition problems
• scientific article; zbMATH DE number 2080064 (Why is no real title available?)
• scientific article; zbMATH DE number 1796125 (Why is no real title available?)
• scientific article; zbMATH DE number 3194530 (Why is no real title available?)
• Lazy Abstraction with Interpolants
• Model theory.
• Negation in logic programming
• Quantifier elimination for infinite terms
• Shostak's congruence closure as completion
• Solving numerical constraints
• Theory of finite or infinite trees revisited

This page was built for publication: Model completeness for rational trees

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