Decidable and undecidable second-order unification problems

DOI10.1007/BFB0052360MaRDI QIDQ3838759zbMATH OpenFDO

Authors Jordi Levy

Publication date 13 August 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0052360

zbMATH Keywords

decidabilitysecond-order unificationsimultaneous rigid E-unificationundecidabilityvariable occurrence restrictions

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)

Recommendations

• On the undecidability of second-order unification
• Decidable higher-order unification problems
• Decidability of bounded second order unification
• Equational unification, word unification, and 2nd-order equational unification

Cited in

(15)

• Equational unification, word unification, and 2nd-order equational unification
• The subtyping problem for second-order types is undecidable.
• Farmer's theorem revisited
• Logic with equality: Partisan corroboration and shifted pairing
• On the undecidability of second-order unification
• Decidability of bounded second order unification
• Restricted combinatory unification
• Tractable and intractable second-order matching problems
• Regular patterns in second-order unification
• The undecidability of the D_A-unification problem
• Bounded Second-Order Unification Is NP-Complete
• scientific article; zbMATH DE number 1948184 (Why is no real title available?)
• Unification in pseudo-linear sort theories is decidable
• Mechanizing Mathematical Reasoning
• Simplifying the signature in second-order unification

This page was built for publication: Decidable and undecidable second-order unification problems

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