THE TYPE SET OF A VARIETY IS NOT COMPUTABLE

DOI10.1142/S0218196701000504zbMath1024.08006OpenAlexW2005032685MaRDI QIDQ4786272

Ralph McKenzie, Japheth Wood

Publication date: 15 December 2002

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196701000504

zbMATH Keywords

tame congruence theoryTuring machineundecidable problemtype set of a variety

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Varieties (08B99)

Related Items (2)

Residual smallness relativized to congruence types. I ⋮ Finite degree clones are undecidable

Cites Work

• The set of types of a finitely generated variety
• An approach to tame congruence theory via subtraces
• On McKenzie's method
• FINDING TYPE SETS IS NP-HARD
• An Easy Way to Minimal Algebras
• Tarski’s finite basis problem via 𝐀(𝒯)
• THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE

This page was built for publication: THE TYPE SET OF A VARIETY IS NOT COMPUTABLE