THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
From MaRDI portal
Publication:4882917
DOI10.1142/S0218196796000039zbMath0844.08010OpenAlexW2031000173MaRDI QIDQ4882917
Publication date: 19 August 1996
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196796000039
residually finitesubdirectly irreducible algebraTuring machineresidual boundcomputable class of finite algebras
Decidability of theories and sets of sentences (03B25) Equational logic, Mal'tsev conditions (08B05) Subdirect products and subdirect irreducibility (08B26)
Related Items (24)
THE TYPE SET OF A VARIETY IS NOT COMPUTABLE ⋮ SOLUTION TO A PROBLEM OF KUBLANOVSKY AND SAPIR ⋮ The variety generated by \(\mathbb {A}(\mathcal {T})\) -- two counterexamples ⋮ On McKenzie's method ⋮ Flat unars: the primal, the semi-primal and the dualisable ⋮ The computational complexity of deciding whether a finite algebra generates a minimal variety ⋮ COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS ⋮ PROPERTIES OF VARIETIES DETERMINED BY THE DEGREES OF PROPER HYPERSUBSTITUTIONS ⋮ Recursive inseparability for residual bounds of finite algebras ⋮ DETERMINING WHETHER ${\mathsf V}({\bf A})$ HAS A MODEL COMPANION IS UNDECIDABLE ⋮ Flat algebras and the translation of universal Horn logic to equational logic ⋮ PRINCIPAL AND SYNTACTIC CONGRUENCES IN CONGRUENCE-DISTRIBUTIVE AND CONGRUENCE-PERMUTABLE VARIETIES ⋮ A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots). ⋮ PROFINITENESS IN FINITELY GENERATED VARIETIES IS UNDECIDABLE ⋮ A finite set of functions with an EXPTIME-complete composition problem ⋮ Finite basis problems and results for quasivarieties ⋮ Residual smallness relativized to congruence types. I ⋮ EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM ⋮ Residually Finite Varieties of Nonassociative Algebras ⋮ A finite basis theorem for residually finite, congruence meet-semidistributive varieties ⋮ Quasiequational Theories of Flat Algebras ⋮ Deciding active structural completeness ⋮ THE UNDECIDABILITY OF THE DEFINABILITY OF PRINCIPAL SUBCONGRUENCES ⋮ Finite degree clones are undecidable
This page was built for publication: THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
