2 citations · 9 across the 7 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
math.RA2013★ 2 cited
The Variety Generated by A(T) -- Two Counterexamples
Matthew Moore
We show that V(A(T)) does not have definable principal subcongruences or bounded Maltsev depth. When the Turing machine T halts, V(A(T)) is an example of a finitely generated semil…
math.LO2013★ 2 cited
The Undecidability of the Definability of Principal Subcongruences
Matthew Moore
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 t…