THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
From MaRDI portal
Publication:4882917
DOI10.1142/S0218196796000039zbMath0844.08010MaRDI 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 finite; subdirectly irreducible algebra; Turing machine; residual bound; computable class of finite algebras
03B25: Decidability of theories and sets of sentences
08B05: Equational logic, Mal'tsev conditions
08B26: Subdirect products and subdirect irreducibility
Related Items
The computational complexity of deciding whether a finite algebra generates a minimal variety, PROFINITENESS IN FINITELY GENERATED VARIETIES IS UNDECIDABLE, THE TYPE SET OF A VARIETY IS NOT COMPUTABLE, SOLUTION TO A PROBLEM OF KUBLANOVSKY AND SAPIR, A finite basis theorem for residually finite, congruence meet-semidistributive varieties, Flat algebras and the translation of universal Horn logic to equational logic, THE UNDECIDABILITY OF THE DEFINABILITY OF PRINCIPAL SUBCONGRUENCES, DETERMINING WHETHER ${\mathsf V}({\bf A})$ HAS A MODEL COMPANION IS UNDECIDABLE, Residual smallness relativized to congruence types. I, A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots)., Flat unars: the primal, the semi-primal and the dualisable, A finite set of functions with an EXPTIME-complete composition problem, Finite basis problems and results for quasivarieties, On McKenzie's method, Deciding active structural completeness, Finite degree clones are undecidable, The variety generated by \(\mathbb {A}(\mathcal {T})\) -- two counterexamples, Recursive inseparability for residual bounds of finite algebras, Residually Finite Varieties of Nonassociative Algebras, Quasiequational Theories of Flat Algebras, COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS, PROPERTIES OF VARIETIES DETERMINED BY THE DEGREES OF PROPER HYPERSUBSTITUTIONS, PRINCIPAL AND SYNTACTIC CONGRUENCES IN CONGRUENCE-DISTRIBUTIVE AND CONGRUENCE-PERMUTABLE VARIETIES, EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
