Quantifier elimination for infinite terms

DOI10.1007/BF01370691zbMath0723.03016OpenAlexW1964068339MaRDI QIDQ1812980

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)

Related Items

\(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation

Cites Work

• Unnamed Item
• Fundamental properties of infinite trees
• Equational problems and disunification
• Algebraic semantics
• A kripke-kleene semantics for logic programs*
• Complete logic programs with domain-closure axiom
• Des belles paires aux beaux uples
• Negation in logic programming
• Reasoning About Recursively Defined Data Structures