Quantifier elimination for infinite terms
We consider the theory \({\mathcal T}_{IT}\) of infinite terms. The axioms for the theory \({\mathcal T}_{IT}\) are analogous to the Mal'cev's axioms for the theory \({\mathcal T}_{FT}\) of finite terms whose models are the locally free algebras. Recently M. J. Maher has proved that the theory \({\mathcal T}_{IT}\) in a finite non-singular signature plus the Domain Closure Axiom is complete. In this paper, a description of all the complete extensions of \({\mathcal T}_{IT}\) is given and hence an effective decision procedure for \({\mathcal T}_{IT}\) is obtained. The approach considers formulas built up with syntactic terms containing pointers. Using such a technique, the analysis of the theory \({\mathcal T}_{IT}\) can be carried out in analogy with Mal'cev's analysis of \({\mathcal T}_{FT}\). The results follow from an effective quantifier elimination procedure for formulas with pointers.
- Elimination of infinitesimal quantifiers
- scientific article; zbMATH DE number 3265727
- Elimination of quantifiers in algebraic structures
- Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets
- Infinite terms and infinite rewritings
- scientific article; zbMATH DE number 3563068
- Relational Methods in Computer Science
- scientific article; zbMATH DE number 3918343
- scientific article; zbMATH DE number 3943783
- A kripke-kleene semantics for logic programs*
- Algebraic semantics
- Complete logic programs with domain-closure axiom
- Des belles paires aux beaux uples
- Equational problems and disunification
- Fundamental properties of infinite trees
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- Negation in logic programming
- Reasoning About Recursively Defined Data Structures
- Finite notations for infinite terms
- \(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation
- Disquotation and infinite conjunctions
- Theorem Proving in Higher Order Logics
- scientific article; zbMATH DE number 3265727 (Why is no real title available?)
- Model completeness for rational trees
This page was built for publication: Quantifier elimination for infinite terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812980)