Quantifier elimination for infinite terms
From MaRDI portal
Publication:1812980
DOI10.1007/BF01370691zbMath0723.03016OpenAlexW1964068339MaRDI QIDQ1812980
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
decision procedurecomplete extensionseffective quantifier elimination proceduretheory of infinite terms
Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10)
Related Items
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