Positive algebras with countable congruence lattices

DOI10.1007/BF02259854zbMath0787.08002OpenAlexW2014397156MaRDI QIDQ2366357

N. Kh. Kasymov

Publication date: 29 June 1993

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02259854

zbMATH Keywords

finitely based varietylocal finitenessundecidable word problempositive algebraseffective infinityNoetherian congruence latticenonrecursively enumerable congruences

Mathematics Subject Classification ID

Subalgebras, congruence relations (08A30) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Word problems (aspects of algebraic structures) (08A50)

Related Items (7)

Computably separable models ⋮ Uniformly computably separable algebras with effectively splittable families of negative congruences ⋮ Computability and universal determinability of negatively representable models ⋮ Lower semilattices of separable congruences of numbered algebras ⋮ Topological spaces over algorithmic representations of universal algebras ⋮ Separable algorithmic representations of classical systems and their applications ⋮ Structures of degrees of negative representations of linear orders

Cites Work

• Rekursive Algebren mit Kettenbedingungen
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Positive algebras with countable congruence lattices