Quantifier elimination for infinite terms

DOI10.1007/BF01370691zbMATH Open0723.03016OpenAlexW1964068339MaRDI QIDQ1812980FDOQ1812980

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

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

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)

Cites Work

• Title not available (Why is that?)
• Fundamental properties of infinite trees
• A kripke-kleene semantics for logic programs*
• Negation in logic programming
• Equational problems and disunification
• Reasoning About Recursively Defined Data Structures
• Algebraic semantics
• Des belles paires aux beaux uples
• Complete logic programs with domain-closure axiom

Cited In (5)

• \(\Sigma_ 1^ 1\)-completeness of a fragment of the theory of trees with subtree relation
• Title not available (Why is that?)
• Finite notations for infinite terms
• 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)