TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
Ralph McKenzie · International Journal of Algebra and Computation · 1996
We exhibit a construction which produces for every Turing machine [Formula: see text], an algebra [Formula: see text] (finite and of finite type) such that the Turing machine halts iff the algebra has a finite basis for its equations.