The undecidability of the third order dyadic unification problem

DOI10.1016/S0019-9958(78)90172-9MaRDI QIDQ4168907zbMATH OpenOpenAlexFDO

Authors Lewis D. Baxter

Publication date 1978

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(78)90172-9

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Recursively (computably) enumerable sets and degrees (03D25) Undecidability and degrees of sets of sentences (03D35) Applications of computability and recursion theory (03D80) Higher degree equations; Fermat's equation (11D41) Connections of number theory and logic (11U99)

Cited in

(1)

• Complete sets of unifiers and matchers in equational theories

This page was built for publication: The undecidability of the third order dyadic unification problem

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