论文信息 - Recursive undecidability of the binding property for finitely presented equational classes

Recursive undecidability of the binding property for finitely presented equational classes

It is shown that there exists no algorithm which, given a finite presentation of an equational classC, decides whether the category of algebras inC is binding.

Gert Sabidussi | G. Sabidussi | S. Foldes | Stephane Foldes

[1] Joachim Lambek,et al. How comprehensive is the category of semigroups , 1969 .

[2] Emil L. Post. Recursive Unsolvability of a problem of Thue , 1947, Journal of Symbolic Logic.

[3] George Grätzer,et al. ON THE ENDOMORPHISM SEMIGROUP (AND CATEGORY) OF BOUNDED LATTICES , 1970 .

[4] George F. McNulty. Undecidable Properties of Finite Sets of Equations , 1976, J. Symb. Log..