×

Tarski’s finite basis problem is undecidable. (English) Zbl 0844.08011

The author exhibits a construction which produces, for every Turing machine \({\mathcal T}\), an algebra \({\mathbf F} ({\mathcal T})\) (finite and of finite type) such that the Turing machine halts iff the algebra has a finite basis for its equations.

MSC:

08B99 Varieties
03B25 Decidability of theories and sets of sentences
PDFBibTeX XMLCite
Full Text: DOI