scientific article; zbMATH DE number 176152

MaRDI QIDQ4035254zbMATH OpenFDO

Authors Hans Leiß, Fritz Henglein

Publication date 18 May 1993

zbMATH Keywords

decidable semi-unification problemsmonadic languages

Mathematics Subject Classification ID

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

Recommendations

• The undecidability of the semi-unification problem
• scientific article; zbMATH DE number 88941
• Semi-unification
• scientific article; zbMATH DE number 4092757
• Upper bounds on height of terms in a solution of a semiunification problem

Cited in

(15)

• The word problem for Smullyan's lark combinator is decidable
• The undecidability of the semi-unification problem
• Extending the type checker of Standard ML by polymorphic recursion
• From decidability to undecidability by considering regular sets of instances
• On the (un)decidability of a near-unanimity term
• Upper bounds on height of terms in a solution of a semiunification problem
• scientific article; zbMATH DE number 1696827 (Why is no real title available?)
• A strict border for the decidability of E-unification for recursive functions
• scientific article; zbMATH DE number 4180772 (Why is no real title available?)
• scientific article; zbMATH DE number 88941 (Why is no real title available?)
• scientific article; zbMATH DE number 1332642 (Why is no real title available?)
• scientific article; zbMATH DE number 1948184 (Why is no real title available?)
• Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version)
• scientific article; zbMATH DE number 7724207 (Why is no real title available?)
• Undecidability of semi-unification on a napkin

This page was built for publication:

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