Ježek, Jaroslav Subdirectly irreducible semilattices with an automorphism. (English) Zbl 0770.08004 Semigroup Forum 43, No. 2, 178-186 (1991). Let SA be the variety of all algebras with a semilattice operation \(\land\) and two unary operations \(f\) and \(f^{-1}\) such that \(f\) is an automorphism and \(f^{-1}\) is the inverse automorphism of the underlying semilattice. As an example take the algebra \({\mathcal P}(Z)\) defined on the set of all subsets of the set of integers \(Z\), where \(A\land B=A\cap B\); \(f(A)=\{a+1| a\in A\}\), and \(f^{-1}(A)=\{a-1| a\in A\}\).This paper proves that every subdirectly irreducible algebra in SA can be embedded into the algebra \({\mathcal P}(Z)\) (hence all are countable). The main result of the paper describes the subdirectly irreducible algebras as members of some very specific intervals in the subalgebra lattice of \({\mathcal P}(Z)\). This deep result is too technical to be described here in detail. Reviewer: G.A.Grätzer (Winnipeg) Cited in 4 Documents MSC: 08B26 Subdirect products and subdirect irreducibility 06A12 Semilattices Keywords:subdirect irreducibility; algebras with a semilattice operation and two unary operations; variety; automorphism; subalgebra lattice PDF BibTeX XML Cite \textit{J. Ježek}, Semigroup Forum 43, No. 2, 178--186 (1991; Zbl 0770.08004) Full Text: DOI EuDML References: [1] Ježek, J.,Simple semilattices with two commuting automorphisms, Algebra Universalis15 (1982), 162–175. · Zbl 0512.06006 [2] Ježek, J.,Subdirectly irreducible and simple Boolean algebras with endomorphisms, Proceedings, Charleston 1984, Universal Algebra and Lattice Theory, 150–162. Lacture Notes in Math. 1149, Springer-Verlag, 150–162. [3] Taylor, W.,Residually small varieties, Algebra Universalis2 (1972), 33–53. · Zbl 0263.08005 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.