Quantifier elimination for infinite terms

DOI10.1007/BF01370691MaRDI QIDQ1812980zbMATH OpenOpenAlexFDO

Authors G. Morangiu, Sauro Tulipani

Publication date 25 June 1992

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01370691

zbMATH Keywords

decision procedurecomplete extensionseffective quantifier elimination proceduretheory of infinite terms

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10)

Recommendations

• 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

Cites work

• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• 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
• Negation in logic programming
• Reasoning About Recursively Defined Data Structures

Cited in

(5)

• \(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation
• Finite notations for infinite terms
• scientific article; zbMATH DE number 3265727 (Why is no real title available?)
• Theorem Proving in Higher Order Logics
• Disquotation and infinite conjunctions

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)