Positive algebras with countable congruence lattices (Q2366357)

A. I. Mal'tsev was one of the first to investigate algorithmic properties of positive algebras with countable congruence lattices; in particular, he proved constructiveness of positive algebras with finite congruence lattices and constructiveness of finitely generated positive algebras with nonzero congruences of only finite index. W. Baur established constructiveness for associative and commutative rings with identities and Noetherian lattices of ideals. In Algebra Logika 30, No. 3, 293-305 (1991; Zbl 0774.03029), the author constructed examples of nonconstructive positive groupoids with nonzero finite index congruences; descriptions of such algebras were given. All the lattices for all the algebras mentioned above are obviously countable. In this paper we study the most general properties of positive algebras with countable lattices of congruences. For such algebras, in particular we infer an algebraic criterion of effective infinity, prove local finiteness of noneffectively infinite algebras, and construct an example of an algebra that is finitely defined in a finitely based variety and has Noetherian congruence lattice and an undecidable word problem. We also prove that for any natural \(n\), there exists a positive algebra with exactly \(n\) nonrecursively enumerable congruences.