THE UNDECIDABILITY OF THE DEFINABILITY OF PRINCIPAL SUBCONGRUENCES

DOI10.1017/jsl.2014.51zbMath1377.03032arXiv1301.5588OpenAlexW2169575028MaRDI QIDQ5501763

No author found.

Publication date: 14 August 2015

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.5588

zbMATH Keywords

finite basisundecidablefinite residual bounddefinable principal subcongruences

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Applications of universal algebra in computer science (08A70) Subalgebras, congruence relations (08A30) Operations and polynomials in algebraic structures, primal algebras (08A40) Turing machines and related notions (03D10)

Related Items (3)

The variety generated by \(\mathbb {A}(\mathcal {T})\) -- two counterexamples ⋮ PROFINITENESS IN FINITELY GENERATED VARIETIES IS UNDECIDABLE ⋮ Finite degree clones are undecidable

Cites Work

• Uniform congruence schemes
• Finite equational bases for finite algebras in a congruence-distributive equational class
• Para primal varieties: A study of finite axiomatizability and definable principal congruences in locally finite varieties
• Definable principal subcongruences.
• Tarski’s finite basis problem via 𝐀(𝒯)
• THE RESIDUAL BOUNDS OF FINITE ALGEBRAS
• THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE

This page was built for publication: THE UNDECIDABILITY OF THE DEFINABILITY OF PRINCIPAL SUBCONGRUENCES