THE RESIDUAL BOUNDS OF FINITE ALGEBRAS

DOI10.1142/S0218196796000027MaRDI QIDQ4882916zbMATH OpenFDO

Authors Ralph McKenzie

Publication date 19 August 1996

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

residual boundsubdirectly irreducible algebrafinitely generated varietyRS-conjecture

Mathematics Subject Classification ID

Subdirect products and subdirect irreducibility (08B26)

Recommendations

• Residual smallness relativized to congruence types. I
• Cardinality bounds for subdirectly irreducible algebras
• RESIDUAL SMALLNESS AND WEAK CENTRALITY

Cited in

(30)

• A residually finite associative algebra with an undecidable word problem
• THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
• A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots).
• Quasiequational Theories of Flat Algebras
• Natural extensions and profinite completions of algebras
• PROPERTIES OF VARIETIES DETERMINED BY THE DEGREES OF PROPER HYPERSUBSTITUTIONS
• Cardinality bounds for subdirectly irreducible algebras
• SUBDIRECTLY IRREDUCIBLE DIFFERENTIAL MODES
• COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS
• On McKenzie's method
• Every shift automorphism variety has an infinite subdirectly irreducible member
• Finite bases for flat graph algebras
• A finite basis theorem for residually finite, congruence meet-semidistributive varieties
• Residual smallness relativized to congruence types. I
• Recursive inseparability for residual bounds of finite algebras
• RESIDUAL SMALLNESS AND WEAK CENTRALITY
• Residually finite dimensional algebras and polynomial almost identities
• COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
• DETERMINING WHETHER ${\mathsf V}({\bf A})$ HAS A MODEL COMPANION IS UNDECIDABLE
• Flat unars: the primal, the semi-primal and the dualisable
• The undecidability of the definability of principal subcongruences
• Flat algebras and the translation of universal Horn logic to equational logic
• Dualizability of automatic algebras.
• Residual bounds for compact totally disconnected algebras
• EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
• Universal algebraic methods for non-classical logics
• The computational complexity of deciding whether a finite algebra generates a minimal variety
• scientific article; zbMATH DE number 4057634 (Why is no real title available?)
• The equational complexity of Lyndon's algebra
• The Division Relation: Congruence Conditions and Axiomatisability

This page was built for publication: THE RESIDUAL BOUNDS OF FINITE ALGEBRAS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882916)