Recursive inseparability for residual bounds of finite algebras

DOI10.2307/2695083zbMath0971.03041OpenAlexW2046226440MaRDI QIDQ2710615

Ralph McKenzie

Publication date: 30 October 2001

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2695083

zbMATH Keywords

Turing machineresidual bound of a finite algebraresidually bounded varietyresidually large variety

Mathematics Subject Classification ID

Equational logic, Mal'tsev conditions (08B05) Operations and polynomials in algebraic structures, primal algebras (08A40) Applications of computability and recursion theory (03D80) Finitary algebras (08A62) Turing machines and related notions (03D10)

Related Items (3)

Flat unars: the primal, the semi-primal and the dualisable ⋮ Residual smallness relativized to congruence types. I ⋮ Residually Finite Varieties of Nonassociative Algebras

Cites Work

• On McKenzie's method
• Equational classes generated by finite algebras
• Residually small varieties
• Tarski’s finite basis problem via 𝐀(𝒯)
• THE RESIDUAL BOUNDS OF FINITE ALGEBRAS
• THE RESIDUAL BOUND OF A FINITE ALGEBRA IS NOT COMPUTABLE
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE

This page was built for publication: Recursive inseparability for residual bounds of finite algebras