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)

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

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)