Date of Award
Doctor of Philosophy (PhD)
For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is undecidable. Using this, we present another proof that A. Tarski's finite basis problem is undecidable.
Moore, Matthew Dale, "The Undecidability of the Definability of Principal Subcongruences" (2013). Entrepreneurship & Small Business Management Graduate Theses & Dissertations. 2.