Congruence computations in principal arithmetical varieties
- 31 Downloads
This paper is a continuation of the earlier paper by the same authors in which a primary result was that every arithmetical affine complete variety of finite type is a principal arithmetical variety with respect to an appropriately chosen Pixley term. The paper begins by presenting an extension of this result to all finitely generated congruences and, as an example, constructs a closed form solution formula for any finitely presented system of pairwise compatible congruences (the Chinese remainder theorem). It is also shown that in all such varieties the meet of principal congruences is also principal, and finally, if a minimal generating algebra of the variety is regular, it is shown that the variety is also regular and the join of principal congruences is again principal.
KeywordsPrincipal arithmetical varieties Affine complete varieties Congruence computations Chinese remainder theorem Discriminator
Mathematics Subject Classification08A30 08A40 08B05 08B10
- 4.Czelakowski, J.: Protoalgebraic logics, Trends in Logic-Studia Logica Library, 10. Kluwer Academic Publishers, Dordrecht (2001)Google Scholar
- 14.Quackenbush, R., Wolk, B.: Strong representation of congruence lattices, Algebra Univers. 1, 165–166 (1971/72)Google Scholar
- 15.Thurston, H.A.: Derived operations and congruences. Proc. London Math. Soc. (3) 8, 127–134 (1958)Google Scholar