The variety DMM of De Morgan monoids has just four minimal subvarieties. The join-irreducible covers of these atoms in the subvariety lattice of DMM are investigated. One of the two atoms consisting of idempotent algebras has no such cover; the other has just one. The remaining two atoms lack nontrivial idempotent members. They are generated, respectively, by 4-element De Morgan monoids C4 and D4, where C4 is the only nontrivial 0-generated algebra onto which finitely subdirectly irreducible De Morgan monoids may be mapped by noninjective homomorphisms. The homomorphic preimages of C4 within DMM (together with the trivial De Morgan monoids) constitute a proper quasivariety, which is shown to have a largest subvariety U. The covers of the variety (C4) within U are revealed here. There are just ten of them (all finitely generated). In exactly six of these ten varieties, all nontrivial members have C4 as a retract. In the varietal join of those six classes, every subquasivariety is a variety—in fact, every finite subdirectly irreducible algebra is projective. Beyond U, all covers of (C4) [or of (D4)] within DMM are discriminator varieties. Of these, we identify infinitely many that are finitely generated, and some that are not. We also prove that there are just 68 minimal quasivarieties of De Morgan monoids.

This article investigates Charles Peirce’s development of logical calculi for classical propositional logic in 1880–1896. Peirce’s 1880 work on the algebra of logic resulted in a successful calculus for Boolean algebra. This calculus, denoted by PC, is here presented as a sequent calculus and not as a natural deduction system. It is shown that Peirce’s aim was to present PC as a sequent calculus. The law of distributivity, which Peirce states in 1880, is proved using Peirce’s Rule, which is a residuation, in PC. The transitional systems of the algebra of the copula that Peirce develops since 1880 paved the way to the 1896 graphical system of the alpha graphs. It is shown how the rules of the alpha system reinterpret Boolean algebras, answering Peirce’s statement that logical graphs supply a new system of fundamental assumptions to logical algebra. A proof-theoretic analysis is given for the connection between PC and the alpha system.

We show that any regular pseudocomplemented Kleene algebra defined on an algebraic lattice is isomorphic to a rough set Kleene algebra determined by a tolerance induced by an irredundant covering.

The optimality of dualities on a quasivariety , generated by a finite algebra , has been introduced by Davey and Priestley in the 1990s. Since every optimal duality is determined by a transversal of a certain family of subsets of Ω, where Ω is a given set of relations yielding a duality on , an understanding of the structures of these subsets—known as globally minimal failsets—was required. A complete description of globally minimal failsets which do not contain partial endomorphisms has recently been given by the author and H. A. Priestley. Here we are concerned with globally minimal failsets containing endomorphisms. We aim to explain what seems to be a pattern in the way endomorphisms belong to these failsets. This paper also gives a complete description of globally minimal failsets whose minimal elements are automorphisms, when is a subdirectly irreducible lattice-structured algebra.

Consider the quasi-variety generated by a finite algebra and assume that yields a natural duality on based on which is optimal modulo endomorphisms. We shoe that, provided satisfies certain minimality conditions, we can transfer this duality to a natural duality on based on , which is also optimal modulo endormorphisms, for any finite algebra in that has a subalgebra isomorphic to .