THE RESIDUAL BOUNDS OF FINITE ALGEBRAS
From MaRDI portal
Publication:4882916
DOI10.1142/S0218196796000027zbMath0844.08009MaRDI QIDQ4882916
Publication date: 19 August 1996
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
08B26: Subdirect products and subdirect irreducibility
Related Items
The computational complexity of deciding whether a finite algebra generates a minimal variety, A finite basis theorem for residually finite, congruence meet-semidistributive varieties, The Division Relation: Congruence Conditions and Axiomatisability, 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, Finite bases for flat graph algebras, A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots)., The equational complexity of Lyndon's algebra, Flat unars: the primal, the semi-primal and the dualisable, Natural extensions and profinite completions of algebras, On McKenzie's method, Dualizability of automatic algebras., Recursive inseparability for residual bounds of finite algebras, RESIDUAL SMALLNESS AND WEAK CENTRALITY, COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES, SUBDIRECTLY IRREDUCIBLE DIFFERENTIAL MODES, Quasiequational Theories of Flat Algebras, COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS, PROPERTIES OF VARIETIES DETERMINED BY THE DEGREES OF PROPER HYPERSUBSTITUTIONS, EVERY SHIFT AUTOMORPHISM VARIETY HAS AN INFINITE SUBDIRECTLY IRREDUCIBLE MEMBER, EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
