THE RESIDUAL BOUNDS OF FINITE ALGEBRAS

DOI10.1142/S0218196796000027zbMATH Open0844.08009MaRDI QIDQ4882916FDOQ4882916

Authors: Ralph McKenzie 

Publication date: 19 August 1996

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

Recommendations

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

zbMATH Keywords

residual boundsubdirectly irreducible algebrafinitely generated varietyRS-conjecture

Mathematics Subject Classification ID

Subdirect products and subdirect irreducibility (08B26)

Cited In (30)

• 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.
• Title not available (Why is that?)
• COMPUTATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM FOR VARIETIES
• DETERMINING WHETHER ${\mathsf V}({\bf A})$ HAS A MODEL COMPANION IS UNDECIDABLE
• EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM
• 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
• The computational complexity of deciding whether a finite algebra generates a minimal variety
• A juggler's dozen of easy\(^\dag\) problems (\(^\dag\) Well, easily formulated \dots).
• COMPUTATIONALLY AND ALGEBRAICALLY COMPLEX FINITE ALGEBRA MEMBERSHIP PROBLEMS
• Flat algebras and the translation of universal Horn logic to equational logic
• Flat unars: the primal, the semi-primal and the dualisable
• 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
• The undecidability of the definability of principal subcongruences

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)