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)
Related Items (24)
SUBDIRECTLY IRREDUCIBLE DIFFERENTIAL MODES ⋮ The Division Relation: Congruence Conditions and Axiomatisability ⋮ 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 ⋮ Universal algebraic methods for non-classical logics ⋮ PROPERTIES OF VARIETIES DETERMINED BY THE DEGREES OF PROPER HYPERSUBSTITUTIONS ⋮ Dualizability of automatic algebras. ⋮ Recursive inseparability for residual bounds of finite algebras ⋮ Natural extensions and profinite completions of 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 ⋮ A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots). ⋮ EVERY SHIFT AUTOMORPHISM VARIETY HAS AN INFINITE SUBDIRECTLY IRREDUCIBLE MEMBER ⋮ The equational complexity of Lyndon's algebra ⋮ RESIDUAL SMALLNESS AND WEAK CENTRALITY ⋮ COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES ⋮ Residual smallness relativized to congruence types. I ⋮ EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM ⋮ Finite bases for flat graph algebras ⋮ A finite basis theorem for residually finite, congruence meet-semidistributive varieties ⋮ Quasiequational Theories of Flat Algebras ⋮ THE UNDECIDABILITY OF THE DEFINABILITY OF PRINCIPAL SUBCONGRUENCES
This page was built for publication: THE RESIDUAL BOUNDS OF FINITE ALGEBRAS
