Simultaneous rigid E-unification is undecidable

DOI10.1007/3-540-61377-3_38MaRDI QIDQ6560168zbMATH OpenFDO

Authors Anatoli I. Degtyarev, Andrei Voronkov

Publication date 21 June 2024

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• The undecidability of simultaneous rigid E-unification
• scientific article; zbMATH DE number 1088208
• Special cases and substitutes for rigid \(E\)-unification
• scientific article; zbMATH DE number 1189065
• scientific article; zbMATH DE number 1110839

Cites work

• scientific article; zbMATH DE number 440473 (Why is no real title available?)
• scientific article; zbMATH DE number 3532939 (Why is no real title available?)
• scientific article; zbMATH DE number 1324435 (Why is no real title available?)
• scientific article; zbMATH DE number 1761415 (Why is no real title available?)
• scientific article; zbMATH DE number 3275581 (Why is no real title available?)
• scientific article; zbMATH DE number 3299689 (Why is no real title available?)
• scientific article; zbMATH DE number 3299735 (Why is no real title available?)
• scientific article; zbMATH DE number 3336816 (Why is no real title available?)
• scientific article; zbMATH DE number 3365215 (Why is no real title available?)
• A completion-based method for mixed universal and rigid \(E\)-unification
• An algorithm for reasoning about equality
• Linear logic
• Mechanical Theorem-Proving by Model Elimination
• On Matrices with Connections
• Positive First-Order Logic Is NP-Complete
• Rigid E-unification: NP-completeness and applications to equational matings
• The foundations of mathematics. A study in the philosophy of science
• The undecidability of simultaneous rigid E-unification
• The undecidability of the second-order unification problem
• Theorem Proving via General Matings
• Theorem proving using equational matings and rigid E -unification

This page was built for publication: Simultaneous rigid E-unification is undecidable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560168)