Logic with equality: Partisan corroboration and shifted pairing

DOI10.1006/inco.1999.2797zbMath1004.03036OpenAlexW2033342015MaRDI QIDQ1854299

Margus Veanes, Yuri Gurevich

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1999.2797

zbMATH Keywords

undecidabilityfinite tree automatacorroboration

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35)

Related Items (1)

On the undecidability of second-order unification

Cites Work

• The undecidability of simultaneous rigid E-unification
• Rigid E-unification: NP-completeness and applications to equational matings
• The undecidability of the second-order unification problem
• Model theory.
• Decidability and complexity of simultaneous rigid E-unification with one variable and related results
• Positive First-Order Logic Is NP-Complete
• Lower Bounds on Herbrand's Theorem
• Monadic simultaneous rigid E-unification and related problems
• Proof-search in intuitionistic logic with equality, or back to simultaneous rigid E-unification
• Efficient ground completion
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Logic with equality: Partisan corroboration and shifted pairing