On the undecidability of the type set of a variety
Japheth Wood · 1998
Several problems involving the local structure of finite algebras are shown to be unsolvable by interpreting the halting problem of Turing machines. Specifically, these problems are to decide, given a finite algebra A, whether ${\cal V}$(A), the variety generated by A, contains 2 and 4 in its type set.