Varieties of De Morgan Monoids I : Minimality and Irreducible - - PowerPoint PPT Presentation

varieties of de morgan monoids i minimality and
SMART_READER_LITE
LIVE PREVIEW

Varieties of De Morgan Monoids I : Minimality and Irreducible - - PowerPoint PPT Presentation

Varieties of De Morgan Monoids I : Minimality and Irreducible Algebras T. Moraschini, 1 J.G. Raftery 2 J.J. Wannenburg 2 and 1 Czech Academy of Sciences, Prague 2 University of Pretoria, South Africa LATD 2017. Prague, Czech Republic T.


slide-1
SLIDE 1

Varieties of De Morgan Monoids I : Minimality and Irreducible Algebras

  • T. Moraschini,1

J.G. Raftery2 and J.J. Wannenburg2

1Czech Academy of Sciences, Prague 2University of Pretoria, South Africa

LATD 2017. Prague, Czech Republic

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-2
SLIDE 2

A De Morgan monoid A = A; ·, ∧, ∨, ¬, t comprises

◮ a distributive lattice A; ∧, ∨; ◮ a commutative monoid A; ·, t satisfying x x · x; ◮ an ‘involution’ ¬: A −

→ A satisfying ¬¬x = x and x · y z = ⇒ x · ¬z ¬y (so ¬: A; ∧, ∨ ∼ = A; ∨, ∧). Defining x → y = ¬(x · ¬y) and f = ¬t, we obtain the Law of Residuation: x · y z ⇐ ⇒ x y → z ; and ¬x = x → f. DM = {all De Morgan monoids} is a variety. It is congruence distributive, extensible and permutable.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-3
SLIDE 3

A De Morgan monoid A = A; ·, ∧, ∨, ¬, t comprises

◮ a distributive lattice A; ∧, ∨; ◮ a commutative monoid A; ·, t satisfying x x · x; ◮ an ‘involution’ ¬: A −

→ A satisfying ¬¬x = x and x · y z = ⇒ x · ¬z ¬y (so ¬: A; ∧, ∨ ∼ = A; ∨, ∧). Defining x → y = ¬(x · ¬y) and f = ¬t, we obtain the Law of Residuation: x · y z ⇐ ⇒ x y → z ; and ¬x = x → f. DM = {all De Morgan monoids} is a variety. It is congruence distributive, extensible and permutable.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-4
SLIDE 4

A De Morgan monoid A = A; ·, ∧, ∨, ¬, t comprises

◮ a distributive lattice A; ∧, ∨; ◮ a commutative monoid A; ·, t satisfying x x · x; ◮ an ‘involution’ ¬: A −

→ A satisfying ¬¬x = x and x · y z = ⇒ x · ¬z ¬y (so ¬: A; ∧, ∨ ∼ = A; ∨, ∧). Defining x → y = ¬(x · ¬y) and f = ¬t, we obtain the Law of Residuation: x · y z ⇐ ⇒ x y → z ; and ¬x = x → f. DM = {all De Morgan monoids} is a variety. It is congruence distributive, extensible and permutable.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-5
SLIDE 5

A De Morgan monoid A = A; ·, ∧, ∨, ¬, t comprises

◮ a distributive lattice A; ∧, ∨; ◮ a commutative monoid A; ·, t satisfying x x · x; ◮ an ‘involution’ ¬: A −

→ A satisfying ¬¬x = x and x · y z = ⇒ x · ¬z ¬y (so ¬: A; ∧, ∨ ∼ = A; ∨, ∧). Defining x → y = ¬(x · ¬y) and f = ¬t, we obtain the Law of Residuation: x · y z ⇐ ⇒ x y → z ; and ¬x = x → f. DM = {all De Morgan monoids} is a variety. It is congruence distributive, extensible and permutable.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-6
SLIDE 6

A De Morgan monoid A = A; ·, ∧, ∨, ¬, t comprises

◮ a distributive lattice A; ∧, ∨; ◮ a commutative monoid A; ·, t satisfying x x · x; ◮ an ‘involution’ ¬: A −

→ A satisfying ¬¬x = x and x · y z = ⇒ x · ¬z ¬y (so ¬: A; ∧, ∨ ∼ = A; ∨, ∧). Defining x → y = ¬(x · ¬y) and f = ¬t, we obtain the Law of Residuation: x · y z ⇐ ⇒ x y → z ; and ¬x = x → f. DM = {all De Morgan monoids} is a variety. It is congruence distributive, extensible and permutable.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-7
SLIDE 7

A De Morgan monoid A = A; ·, ∧, ∨, ¬, t comprises

◮ a distributive lattice A; ∧, ∨; ◮ a commutative monoid A; ·, t satisfying x x · x; ◮ an ‘involution’ ¬: A −

→ A satisfying ¬¬x = x and x · y z = ⇒ x · ¬z ¬y (so ¬: A; ∧, ∨ ∼ = A; ∨, ∧). Defining x → y = ¬(x · ¬y) and f = ¬t, we obtain the Law of Residuation: x · y z ⇐ ⇒ x y → z ; and ¬x = x → f. DM = {all De Morgan monoids} is a variety. It is congruence distributive, extensible and permutable.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-8
SLIDE 8

A De Morgan monoid A = A; ·, ∧, ∨, ¬, t comprises

◮ a distributive lattice A; ∧, ∨; ◮ a commutative monoid A; ·, t satisfying x x · x; ◮ an ‘involution’ ¬: A −

→ A satisfying ¬¬x = x and x · y z = ⇒ x · ¬z ¬y (so ¬: A; ∧, ∨ ∼ = A; ∨, ∧). Defining x → y = ¬(x · ¬y) and f = ¬t, we obtain the Law of Residuation: x · y z ⇐ ⇒ x y → z ; and ¬x = x → f. DM = {all De Morgan monoids} is a variety. It is congruence distributive, extensible and permutable.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-9
SLIDE 9

The relevance logic Rt can be characterized as follows: ⊢Rt α (‘α is a theorem of Rt’) iff DM | = t α. More generally, in the deducibility relation of the usual formal system for Rt, we have γ1, . . . , γn ⊢Rt α iff DM | = (t γ1 & . . . & t γn) = ⇒ t α. There is a lattice anti-isomorphism from the extensions of Rt to the subquasivarieties of DM, taking axiomatic extensions onto subvarieties. We study the latter as a route to the former. Why?

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-10
SLIDE 10

The relevance logic Rt can be characterized as follows: ⊢Rt α (‘α is a theorem of Rt’) iff DM | = t α. More generally, in the deducibility relation of the usual formal system for Rt, we have γ1, . . . , γn ⊢Rt α iff DM | = (t γ1 & . . . & t γn) = ⇒ t α. There is a lattice anti-isomorphism from the extensions of Rt to the subquasivarieties of DM, taking axiomatic extensions onto subvarieties. We study the latter as a route to the former. Why?

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-11
SLIDE 11

The relevance logic Rt can be characterized as follows: ⊢Rt α (‘α is a theorem of Rt’) iff DM | = t α. More generally, in the deducibility relation of the usual formal system for Rt, we have γ1, . . . , γn ⊢Rt α iff DM | = (t γ1 & . . . & t γn) = ⇒ t α. There is a lattice anti-isomorphism from the extensions of Rt to the subquasivarieties of DM, taking axiomatic extensions onto subvarieties. We study the latter as a route to the former. Why?

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-12
SLIDE 12

The relevance logic Rt can be characterized as follows: ⊢Rt α (‘α is a theorem of Rt’) iff DM | = t α. More generally, in the deducibility relation of the usual formal system for Rt, we have γ1, . . . , γn ⊢Rt α iff DM | = (t γ1 & . . . & t γn) = ⇒ t α. There is a lattice anti-isomorphism from the extensions of Rt to the subquasivarieties of DM, taking axiomatic extensions onto subvarieties. We study the latter as a route to the former. Why?

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-13
SLIDE 13

The relevance logic Rt can be characterized as follows: ⊢Rt α (‘α is a theorem of Rt’) iff DM | = t α. More generally, in the deducibility relation of the usual formal system for Rt, we have γ1, . . . , γn ⊢Rt α iff DM | = (t γ1 & . . . & t γn) = ⇒ t α. There is a lattice anti-isomorphism from the extensions of Rt to the subquasivarieties of DM, taking axiomatic extensions onto subvarieties. We study the latter as a route to the former. Why?

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-14
SLIDE 14

Relevance logic began in protest at ‘paradoxes’ of material implication, e.g., the weakening axiom p → (q → p). It has multiple interpretations, however, and now fits under the ideology-free umbrella of substructural logics. Relative to these, Rt combines ∧, ∨ distributivity with the contraction axiom (p → (p → q)) → (p → q). Urquhart (1984): Rt is undecidable. Algebraic effects? Less explored—philosophical equivocation

  • ver the status of t : distinguished or not?

(In the absence of weakening, t is not equationally definable. The t–free reducts of De Morgan monoids don’t form a variety, as they are not closed under subalgebras. For the anti-isomorphism above, t must be distinguished.)

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-15
SLIDE 15

Relevance logic began in protest at ‘paradoxes’ of material implication, e.g., the weakening axiom p → (q → p). It has multiple interpretations, however, and now fits under the ideology-free umbrella of substructural logics. Relative to these, Rt combines ∧, ∨ distributivity with the contraction axiom (p → (p → q)) → (p → q). Urquhart (1984): Rt is undecidable. Algebraic effects? Less explored—philosophical equivocation

  • ver the status of t : distinguished or not?

(In the absence of weakening, t is not equationally definable. The t–free reducts of De Morgan monoids don’t form a variety, as they are not closed under subalgebras. For the anti-isomorphism above, t must be distinguished.)

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-16
SLIDE 16

Relevance logic began in protest at ‘paradoxes’ of material implication, e.g., the weakening axiom p → (q → p). It has multiple interpretations, however, and now fits under the ideology-free umbrella of substructural logics. Relative to these, Rt combines ∧, ∨ distributivity with the contraction axiom (p → (p → q)) → (p → q). Urquhart (1984): Rt is undecidable. Algebraic effects? Less explored—philosophical equivocation

  • ver the status of t : distinguished or not?

(In the absence of weakening, t is not equationally definable. The t–free reducts of De Morgan monoids don’t form a variety, as they are not closed under subalgebras. For the anti-isomorphism above, t must be distinguished.)

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-17
SLIDE 17

Relevance logic began in protest at ‘paradoxes’ of material implication, e.g., the weakening axiom p → (q → p). It has multiple interpretations, however, and now fits under the ideology-free umbrella of substructural logics. Relative to these, Rt combines ∧, ∨ distributivity with the contraction axiom (p → (p → q)) → (p → q). Urquhart (1984): Rt is undecidable. Algebraic effects? Less explored—philosophical equivocation

  • ver the status of t : distinguished or not?

(In the absence of weakening, t is not equationally definable. The t–free reducts of De Morgan monoids don’t form a variety, as they are not closed under subalgebras. For the anti-isomorphism above, t must be distinguished.)

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-18
SLIDE 18

Relevance logic began in protest at ‘paradoxes’ of material implication, e.g., the weakening axiom p → (q → p). It has multiple interpretations, however, and now fits under the ideology-free umbrella of substructural logics. Relative to these, Rt combines ∧, ∨ distributivity with the contraction axiom (p → (p → q)) → (p → q). Urquhart (1984): Rt is undecidable. Algebraic effects? Less explored—philosophical equivocation

  • ver the status of t : distinguished or not?

(In the absence of weakening, t is not equationally definable. The t–free reducts of De Morgan monoids don’t form a variety, as they are not closed under subalgebras. For the anti-isomorphism above, t must be distinguished.)

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-19
SLIDE 19

Relevance logic began in protest at ‘paradoxes’ of material implication, e.g., the weakening axiom p → (q → p). It has multiple interpretations, however, and now fits under the ideology-free umbrella of substructural logics. Relative to these, Rt combines ∧, ∨ distributivity with the contraction axiom (p → (p → q)) → (p → q). Urquhart (1984): Rt is undecidable. Algebraic effects? Less explored—philosophical equivocation

  • ver the status of t : distinguished or not?

(In the absence of weakening, t is not equationally definable. The t–free reducts of De Morgan monoids don’t form a variety, as they are not closed under subalgebras. For the anti-isomorphism above, t must be distinguished.)

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-20
SLIDE 20

Relevance logic began in protest at ‘paradoxes’ of material implication, e.g., the weakening axiom p → (q → p). It has multiple interpretations, however, and now fits under the ideology-free umbrella of substructural logics. Relative to these, Rt combines ∧, ∨ distributivity with the contraction axiom (p → (p → q)) → (p → q). Urquhart (1984): Rt is undecidable. Algebraic effects? Less explored—philosophical equivocation

  • ver the status of t : distinguished or not?

(In the absence of weakening, t is not equationally definable. The t–free reducts of De Morgan monoids don’t form a variety, as they are not closed under subalgebras. For the anti-isomorphism above, t must be distinguished.)

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-21
SLIDE 21

Relevance logic began in protest at ‘paradoxes’ of material implication, e.g., the weakening axiom p → (q → p). It has multiple interpretations, however, and now fits under the ideology-free umbrella of substructural logics. Relative to these, Rt combines ∧, ∨ distributivity with the contraction axiom (p → (p → q)) → (p → q). Urquhart (1984): Rt is undecidable. Algebraic effects? Less explored—philosophical equivocation

  • ver the status of t : distinguished or not?

(In the absence of weakening, t is not equationally definable. The t–free reducts of De Morgan monoids don’t form a variety, as they are not closed under subalgebras. For the anti-isomorphism above, t must be distinguished.)

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-22
SLIDE 22

Contraction amounts to the square-increasing law x x2

  • f DM. Its effects include:

◮ Excluded middle: t x ∨ ¬x ; ◮ Unique involution (¬): if two algebras have the same

·, →, ∧, ∨, t reduct, they are equal (Slaney, 2016).

◮ Algebras are simple iff t has just one strict lower bound. ◮ Finitely generated algebras are bounded.

(If ⊥ x ⊤ for all x, then ⊥ · x = ⊥.) On the other hand, ∧, ∨ distributivity gives:

◮ Algebras are finitely subdirectly irreducible (FSI) iff t is

join-prime: t x ∨ y = ⇒ t x or t y.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-23
SLIDE 23

Contraction amounts to the square-increasing law x x2

  • f DM. Its effects include:

◮ Excluded middle: t x ∨ ¬x ; ◮ Unique involution (¬): if two algebras have the same

·, →, ∧, ∨, t reduct, they are equal (Slaney, 2016).

◮ Algebras are simple iff t has just one strict lower bound. ◮ Finitely generated algebras are bounded.

(If ⊥ x ⊤ for all x, then ⊥ · x = ⊥.) On the other hand, ∧, ∨ distributivity gives:

◮ Algebras are finitely subdirectly irreducible (FSI) iff t is

join-prime: t x ∨ y = ⇒ t x or t y.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-24
SLIDE 24

Contraction amounts to the square-increasing law x x2

  • f DM. Its effects include:

◮ Excluded middle: t x ∨ ¬x ; ◮ Unique involution (¬): if two algebras have the same

·, →, ∧, ∨, t reduct, they are equal (Slaney, 2016).

◮ Algebras are simple iff t has just one strict lower bound. ◮ Finitely generated algebras are bounded.

(If ⊥ x ⊤ for all x, then ⊥ · x = ⊥.) On the other hand, ∧, ∨ distributivity gives:

◮ Algebras are finitely subdirectly irreducible (FSI) iff t is

join-prime: t x ∨ y = ⇒ t x or t y.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-25
SLIDE 25

Contraction amounts to the square-increasing law x x2

  • f DM. Its effects include:

◮ Excluded middle: t x ∨ ¬x ; ◮ Unique involution (¬): if two algebras have the same

·, →, ∧, ∨, t reduct, they are equal (Slaney, 2016).

◮ Algebras are simple iff t has just one strict lower bound. ◮ Finitely generated algebras are bounded.

(If ⊥ x ⊤ for all x, then ⊥ · x = ⊥.) On the other hand, ∧, ∨ distributivity gives:

◮ Algebras are finitely subdirectly irreducible (FSI) iff t is

join-prime: t x ∨ y = ⇒ t x or t y.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-26
SLIDE 26

Contraction amounts to the square-increasing law x x2

  • f DM. Its effects include:

◮ Excluded middle: t x ∨ ¬x ; ◮ Unique involution (¬): if two algebras have the same

·, →, ∧, ∨, t reduct, they are equal (Slaney, 2016).

◮ Algebras are simple iff t has just one strict lower bound. ◮ Finitely generated algebras are bounded.

(If ⊥ x ⊤ for all x, then ⊥ · x = ⊥.) On the other hand, ∧, ∨ distributivity gives:

◮ Algebras are finitely subdirectly irreducible (FSI) iff t is

join-prime: t x ∨ y = ⇒ t x or t y.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-27
SLIDE 27

Contraction amounts to the square-increasing law x x2

  • f DM. Its effects include:

◮ Excluded middle: t x ∨ ¬x ; ◮ Unique involution (¬): if two algebras have the same

·, →, ∧, ∨, t reduct, they are equal (Slaney, 2016).

◮ Algebras are simple iff t has just one strict lower bound. ◮ Finitely generated algebras are bounded.

(If ⊥ x ⊤ for all x, then ⊥ · x = ⊥.) On the other hand, ∧, ∨ distributivity gives:

◮ Algebras are finitely subdirectly irreducible (FSI) iff t is

join-prime: t x ∨ y = ⇒ t x or t y.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-28
SLIDE 28

Contraction amounts to the square-increasing law x x2

  • f DM. Its effects include:

◮ Excluded middle: t x ∨ ¬x ; ◮ Unique involution (¬): if two algebras have the same

·, →, ∧, ∨, t reduct, they are equal (Slaney, 2016).

◮ Algebras are simple iff t has just one strict lower bound. ◮ Finitely generated algebras are bounded.

(If ⊥ x ⊤ for all x, then ⊥ · x = ⊥.) On the other hand, ∧, ∨ distributivity gives:

◮ Algebras are finitely subdirectly irreducible (FSI) iff t is

join-prime: t x ∨ y = ⇒ t x or t y.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-29
SLIDE 29

Contraction amounts to the square-increasing law x x2

  • f DM. Its effects include:

◮ Excluded middle: t x ∨ ¬x ; ◮ Unique involution (¬): if two algebras have the same

·, →, ∧, ∨, t reduct, they are equal (Slaney, 2016).

◮ Algebras are simple iff t has just one strict lower bound. ◮ Finitely generated algebras are bounded.

(If ⊥ x ⊤ for all x, then ⊥ · x = ⊥.) On the other hand, ∧, ∨ distributivity gives:

◮ Algebras are finitely subdirectly irreducible (FSI) iff t is

join-prime: t x ∨ y = ⇒ t x or t y.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-30
SLIDE 30

Special features of De Morgan monoids:

◮ FSI bounded algebras are ‘rigorously compact’:

if ⊥ x ⊤ for all x, then ⊤ · x = ⊤, unless x = ⊥.

◮ f 3 = f 2. ◮ If a De Morgan monoid is 0–generated (i.e., it has no

proper subalgebra), then it is finite (Slaney, 1980s). Just seven such algebras are subdirectly irreducible (SI).

◮ If A ∈ DM is FSI, then A = [t) ∪ (f].

Here, we may have t f. But if f < t, then t covers f.

  • Fact. In a De Morgan monoid, the demand f t is equivalent

to idempotence of the whole algebra: x2 = x (for all x). So, non-idempotent algebras lack idempotent subalgebras.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-31
SLIDE 31

Special features of De Morgan monoids:

◮ FSI bounded algebras are ‘rigorously compact’:

if ⊥ x ⊤ for all x, then ⊤ · x = ⊤, unless x = ⊥.

◮ f 3 = f 2. ◮ If a De Morgan monoid is 0–generated (i.e., it has no

proper subalgebra), then it is finite (Slaney, 1980s). Just seven such algebras are subdirectly irreducible (SI).

◮ If A ∈ DM is FSI, then A = [t) ∪ (f].

Here, we may have t f. But if f < t, then t covers f.

  • Fact. In a De Morgan monoid, the demand f t is equivalent

to idempotence of the whole algebra: x2 = x (for all x). So, non-idempotent algebras lack idempotent subalgebras.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-32
SLIDE 32

Special features of De Morgan monoids:

◮ FSI bounded algebras are ‘rigorously compact’:

if ⊥ x ⊤ for all x, then ⊤ · x = ⊤, unless x = ⊥.

◮ f 3 = f 2. ◮ If a De Morgan monoid is 0–generated (i.e., it has no

proper subalgebra), then it is finite (Slaney, 1980s). Just seven such algebras are subdirectly irreducible (SI).

◮ If A ∈ DM is FSI, then A = [t) ∪ (f].

Here, we may have t f. But if f < t, then t covers f.

  • Fact. In a De Morgan monoid, the demand f t is equivalent

to idempotence of the whole algebra: x2 = x (for all x). So, non-idempotent algebras lack idempotent subalgebras.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-33
SLIDE 33

Special features of De Morgan monoids:

◮ FSI bounded algebras are ‘rigorously compact’:

if ⊥ x ⊤ for all x, then ⊤ · x = ⊤, unless x = ⊥.

◮ f 3 = f 2. ◮ If a De Morgan monoid is 0–generated (i.e., it has no

proper subalgebra), then it is finite (Slaney, 1980s). Just seven such algebras are subdirectly irreducible (SI).

◮ If A ∈ DM is FSI, then A = [t) ∪ (f].

Here, we may have t f. But if f < t, then t covers f.

  • Fact. In a De Morgan monoid, the demand f t is equivalent

to idempotence of the whole algebra: x2 = x (for all x). So, non-idempotent algebras lack idempotent subalgebras.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-34
SLIDE 34

Special features of De Morgan monoids:

◮ FSI bounded algebras are ‘rigorously compact’:

if ⊥ x ⊤ for all x, then ⊤ · x = ⊤, unless x = ⊥.

◮ f 3 = f 2. ◮ If a De Morgan monoid is 0–generated (i.e., it has no

proper subalgebra), then it is finite (Slaney, 1980s). Just seven such algebras are subdirectly irreducible (SI).

◮ If A ∈ DM is FSI, then A = [t) ∪ (f].

Here, we may have t f. But if f < t, then t covers f.

  • Fact. In a De Morgan monoid, the demand f t is equivalent

to idempotence of the whole algebra: x2 = x (for all x). So, non-idempotent algebras lack idempotent subalgebras.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-35
SLIDE 35

Special features of De Morgan monoids:

◮ FSI bounded algebras are ‘rigorously compact’:

if ⊥ x ⊤ for all x, then ⊤ · x = ⊤, unless x = ⊥.

◮ f 3 = f 2. ◮ If a De Morgan monoid is 0–generated (i.e., it has no

proper subalgebra), then it is finite (Slaney, 1980s). Just seven such algebras are subdirectly irreducible (SI).

◮ If A ∈ DM is FSI, then A = [t) ∪ (f].

Here, we may have t f. But if f < t, then t covers f.

  • Fact. In a De Morgan monoid, the demand f t is equivalent

to idempotence of the whole algebra: x2 = x (for all x). So, non-idempotent algebras lack idempotent subalgebras.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-36
SLIDE 36

Special features of De Morgan monoids:

◮ FSI bounded algebras are ‘rigorously compact’:

if ⊥ x ⊤ for all x, then ⊤ · x = ⊤, unless x = ⊥.

◮ f 3 = f 2. ◮ If a De Morgan monoid is 0–generated (i.e., it has no

proper subalgebra), then it is finite (Slaney, 1980s). Just seven such algebras are subdirectly irreducible (SI).

◮ If A ∈ DM is FSI, then A = [t) ∪ (f].

Here, we may have t f. But if f < t, then t covers f.

  • Fact. In a De Morgan monoid, the demand f t is equivalent

to idempotence of the whole algebra: x2 = x (for all x). So, non-idempotent algebras lack idempotent subalgebras.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-37
SLIDE 37

Special features of De Morgan monoids:

◮ FSI bounded algebras are ‘rigorously compact’:

if ⊥ x ⊤ for all x, then ⊤ · x = ⊤, unless x = ⊥.

◮ f 3 = f 2. ◮ If a De Morgan monoid is 0–generated (i.e., it has no

proper subalgebra), then it is finite (Slaney, 1980s). Just seven such algebras are subdirectly irreducible (SI).

◮ If A ∈ DM is FSI, then A = [t) ∪ (f].

Here, we may have t f. But if f < t, then t covers f.

  • Fact. In a De Morgan monoid, the demand f t is equivalent

to idempotence of the whole algebra: x2 = x (for all x). So, non-idempotent algebras lack idempotent subalgebras.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-38
SLIDE 38

Special features of De Morgan monoids:

◮ FSI bounded algebras are ‘rigorously compact’:

if ⊥ x ⊤ for all x, then ⊤ · x = ⊤, unless x = ⊥.

◮ f 3 = f 2. ◮ If a De Morgan monoid is 0–generated (i.e., it has no

proper subalgebra), then it is finite (Slaney, 1980s). Just seven such algebras are subdirectly irreducible (SI).

◮ If A ∈ DM is FSI, then A = [t) ∪ (f].

Here, we may have t f. But if f < t, then t covers f.

  • Fact. In a De Morgan monoid, the demand f t is equivalent

to idempotence of the whole algebra: x2 = x (for all x). So, non-idempotent algebras lack idempotent subalgebras.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-39
SLIDE 39

Special features of De Morgan monoids:

◮ FSI bounded algebras are ‘rigorously compact’:

if ⊥ x ⊤ for all x, then ⊤ · x = ⊤, unless x = ⊥.

◮ f 3 = f 2. ◮ If a De Morgan monoid is 0–generated (i.e., it has no

proper subalgebra), then it is finite (Slaney, 1980s). Just seven such algebras are subdirectly irreducible (SI).

◮ If A ∈ DM is FSI, then A = [t) ∪ (f].

Here, we may have t f. But if f < t, then t covers f.

  • Fact. In a De Morgan monoid, the demand f t is equivalent

to idempotence of the whole algebra: x2 = x (for all x). So, non-idempotent algebras lack idempotent subalgebras.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-40
SLIDE 40

The idempotent De Morgan monoids (a.k.a. Sugihara monoids) form a locally finite variety SM = V(S∗), where S∗ is the natural chain of nonzero integers (with − as ¬) and x · y = whichever of x, y has greater absolute value,

  • r x ∧ y, if |x| = |y|,

Here, t is 1, so f is −1. S∗ has a homomorphic image S in which just 1 and −1 are identified. Up to isomorphism, S could be defined like S∗ on the set of all

  • integers. Then S |

= f = t (= 0). Algebras with f = t are called odd.

s s s s s s 3 2 1 −1 −2 −3 = 3 · − 2 = t = f = 1 · − 2 = 3 · − 3 S∗

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-41
SLIDE 41

The idempotent De Morgan monoids (a.k.a. Sugihara monoids) form a locally finite variety SM = V(S∗), where S∗ is the natural chain of nonzero integers (with − as ¬) and x · y = whichever of x, y has greater absolute value,

  • r x ∧ y, if |x| = |y|,

Here, t is 1, so f is −1. S∗ has a homomorphic image S in which just 1 and −1 are identified. Up to isomorphism, S could be defined like S∗ on the set of all

  • integers. Then S |

= f = t (= 0). Algebras with f = t are called odd.

s s s s s s 3 2 1 −1 −2 −3 = 3 · − 2 = t = f = 1 · − 2 = 3 · − 3 S∗

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-42
SLIDE 42

The idempotent De Morgan monoids (a.k.a. Sugihara monoids) form a locally finite variety SM = V(S∗), where S∗ is the natural chain of nonzero integers (with − as ¬) and x · y = whichever of x, y has greater absolute value,

  • r x ∧ y, if |x| = |y|,

Here, t is 1, so f is −1. S∗ has a homomorphic image S in which just 1 and −1 are identified. Up to isomorphism, S could be defined like S∗ on the set of all

  • integers. Then S |

= f = t (= 0). Algebras with f = t are called odd.

s s s s s s 3 2 1 −1 −2 −3 = 3 · − 2 = t = f = 1 · − 2 = 3 · − 3 S∗

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-43
SLIDE 43

The idempotent De Morgan monoids (a.k.a. Sugihara monoids) form a locally finite variety SM = V(S∗), where S∗ is the natural chain of nonzero integers (with − as ¬) and x · y = whichever of x, y has greater absolute value,

  • r x ∧ y, if |x| = |y|,

Here, t is 1, so f is −1. S∗ has a homomorphic image S in which just 1 and −1 are identified. Up to isomorphism, S could be defined like S∗ on the set of all

  • integers. Then S |

= f = t (= 0). Algebras with f = t are called odd.

s s s s s s 3 2 1 −1 −2 −3 = 3 · − 2 = t = f = 1 · − 2 = 3 · − 3 S∗

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-44
SLIDE 44

The idempotent De Morgan monoids (a.k.a. Sugihara monoids) form a locally finite variety SM = V(S∗), where S∗ is the natural chain of nonzero integers (with − as ¬) and x · y = whichever of x, y has greater absolute value,

  • r x ∧ y, if |x| = |y|,

Here, t is 1, so f is −1. S∗ has a homomorphic image S in which just 1 and −1 are identified. Up to isomorphism, S could be defined like S∗ on the set of all

  • integers. Then S |

= f = t (= 0). Algebras with f = t are called odd.

s s s s s s 3 2 1 −1 −2 −3 = 3 · − 2 = t = f = 1 · − 2 = 3 · − 3 S∗

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-45
SLIDE 45

The idempotent De Morgan monoids (a.k.a. Sugihara monoids) form a locally finite variety SM = V(S∗), where S∗ is the natural chain of nonzero integers (with − as ¬) and x · y = whichever of x, y has greater absolute value,

  • r x ∧ y, if |x| = |y|,

Here, t is 1, so f is −1. S∗ has a homomorphic image S in which just 1 and −1 are identified. Up to isomorphism, S could be defined like S∗ on the set of all

  • integers. Then S |

= f = t (= 0). Algebras with f = t are called odd.

s s s s s s 3 2 1 −1 −2 −3 = 3 · − 2 = t = f = 1 · − 2 = 3 · − 3 S∗

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-46
SLIDE 46

The idempotent De Morgan monoids (a.k.a. Sugihara monoids) form a locally finite variety SM = V(S∗), where S∗ is the natural chain of nonzero integers (with − as ¬) and x · y = whichever of x, y has greater absolute value,

  • r x ∧ y, if |x| = |y|,

Here, t is 1, so f is −1. S∗ has a homomorphic image S in which just 1 and −1 are identified. Up to isomorphism, S could be defined like S∗ on the set of all

  • integers. Then S |

= f = t (= 0). Algebras with f = t are called odd.

s s s s s s 3 2 1 −1 −2 −3 = 3 · − 2 = t = f = 1 · − 2 = 3 · − 3 S∗

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-47
SLIDE 47

The n–element (unique) convex subalgebra of S∗ or S is denoted by Sn. These are exactly the finitely generated SI Sugihara monoids (Dunn, 1970s), so SM is semilinear (i.e., Sugihara monoids are subdirect products of chains). E.g., S2 is the Boolean algebra −1 < 1; S3 is −1 < 0 < 1; S4 is −2 < −1 < 1 < 2; S5 is −2 < −1 < 0 < 1 < 2, etc. Beyond Sugihara monoids, the structure of De Morgan monoids is not fully understood. Here we contribute a new structure theorem.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-48
SLIDE 48

The n–element (unique) convex subalgebra of S∗ or S is denoted by Sn. These are exactly the finitely generated SI Sugihara monoids (Dunn, 1970s), so SM is semilinear (i.e., Sugihara monoids are subdirect products of chains). E.g., S2 is the Boolean algebra −1 < 1; S3 is −1 < 0 < 1; S4 is −2 < −1 < 1 < 2; S5 is −2 < −1 < 0 < 1 < 2, etc. Beyond Sugihara monoids, the structure of De Morgan monoids is not fully understood. Here we contribute a new structure theorem.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-49
SLIDE 49

The n–element (unique) convex subalgebra of S∗ or S is denoted by Sn. These are exactly the finitely generated SI Sugihara monoids (Dunn, 1970s), so SM is semilinear (i.e., Sugihara monoids are subdirect products of chains). E.g., S2 is the Boolean algebra −1 < 1; S3 is −1 < 0 < 1; S4 is −2 < −1 < 1 < 2; S5 is −2 < −1 < 0 < 1 < 2, etc. Beyond Sugihara monoids, the structure of De Morgan monoids is not fully understood. Here we contribute a new structure theorem.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-50
SLIDE 50

The n–element (unique) convex subalgebra of S∗ or S is denoted by Sn. These are exactly the finitely generated SI Sugihara monoids (Dunn, 1970s), so SM is semilinear (i.e., Sugihara monoids are subdirect products of chains). E.g., S2 is the Boolean algebra −1 < 1; S3 is −1 < 0 < 1; S4 is −2 < −1 < 1 < 2; S5 is −2 < −1 < 0 < 1 < 2, etc. Beyond Sugihara monoids, the structure of De Morgan monoids is not fully understood. Here we contribute a new structure theorem.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-51
SLIDE 51

The n–element (unique) convex subalgebra of S∗ or S is denoted by Sn. These are exactly the finitely generated SI Sugihara monoids (Dunn, 1970s), so SM is semilinear (i.e., Sugihara monoids are subdirect products of chains). E.g., S2 is the Boolean algebra −1 < 1; S3 is −1 < 0 < 1; S4 is −2 < −1 < 1 < 2; S5 is −2 < −1 < 0 < 1 < 2, etc. Beyond Sugihara monoids, the structure of De Morgan monoids is not fully understood. Here we contribute a new structure theorem.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-52
SLIDE 52

The n–element (unique) convex subalgebra of S∗ or S is denoted by Sn. These are exactly the finitely generated SI Sugihara monoids (Dunn, 1970s), so SM is semilinear (i.e., Sugihara monoids are subdirect products of chains). E.g., S2 is the Boolean algebra −1 < 1; S3 is −1 < 0 < 1; S4 is −2 < −1 < 1 < 2; S5 is −2 < −1 < 0 < 1 < 2, etc. Beyond Sugihara monoids, the structure of De Morgan monoids is not fully understood. Here we contribute a new structure theorem.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-53
SLIDE 53
  • Theorem. Let A be a FSI De Morgan monoid. Then, either

(i) A is a Sugihara monoid, or (ii) A is the union of an interval subalgebra [¬(f 2), f 2] := {x ∈ A : ¬(f 2) < x < f 2} and two chains of idempotent elements, (¬(f 2)] and [f 2). In (ii), the upper bounds of f 2 are exactly the idempotent upper bounds of f, and the algebra A/Θ(¬(f 2), t) is an odd Sugihara monoid.

f 2 fr r ✣✢ ✤✜

idempotents above f

[f) f 2 ¬(f 2) r r ✫✪ ✬✩

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-54
SLIDE 54
  • Theorem. Let A be a FSI De Morgan monoid. Then, either

(i) A is a Sugihara monoid, or (ii) A is the union of an interval subalgebra [¬(f 2), f 2] := {x ∈ A : ¬(f 2) < x < f 2} and two chains of idempotent elements, (¬(f 2)] and [f 2). In (ii), the upper bounds of f 2 are exactly the idempotent upper bounds of f, and the algebra A/Θ(¬(f 2), t) is an odd Sugihara monoid.

f 2 fr r ✣✢ ✤✜

idempotents above f

[f) f 2 ¬(f 2) r r ✫✪ ✬✩

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-55
SLIDE 55
  • Theorem. Let A be a FSI De Morgan monoid. Then, either

(i) A is a Sugihara monoid, or (ii) A is the union of an interval subalgebra [¬(f 2), f 2] := {x ∈ A : ¬(f 2) < x < f 2} and two chains of idempotent elements, (¬(f 2)] and [f 2). In (ii), the upper bounds of f 2 are exactly the idempotent upper bounds of f, and the algebra A/Θ(¬(f 2), t) is an odd Sugihara monoid.

f 2 fr r ✣✢ ✤✜

idempotents above f

[f) f 2 ¬(f 2) r r ✫✪ ✬✩

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-56
SLIDE 56
  • Theorem. Let A be a FSI De Morgan monoid. Then, either

(i) A is a Sugihara monoid, or (ii) A is the union of an interval subalgebra [¬(f 2), f 2] := {x ∈ A : ¬(f 2) < x < f 2} and two chains of idempotent elements, (¬(f 2)] and [f 2). In (ii), the upper bounds of f 2 are exactly the idempotent upper bounds of f, and the algebra A/Θ(¬(f 2), t) is an odd Sugihara monoid.

f 2 fr r ✣✢ ✤✜

idempotents above f

[f) f 2 ¬(f 2) r r ✫✪ ✬✩

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-57
SLIDE 57
  • Theorem. Let A be a FSI De Morgan monoid. Then, either

(i) A is a Sugihara monoid, or (ii) A is the union of an interval subalgebra [¬(f 2), f 2] := {x ∈ A : ¬(f 2) < x < f 2} and two chains of idempotent elements, (¬(f 2)] and [f 2). In (ii), the upper bounds of f 2 are exactly the idempotent upper bounds of f, and the algebra A/Θ(¬(f 2), t) is an odd Sugihara monoid.

f 2 fr r ✣✢ ✤✜

idempotents above f

[f) f 2 ¬(f 2) r r ✫✪ ✬✩

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-58
SLIDE 58
  • Theorem. Let A be a FSI De Morgan monoid. Then, either

(i) A is a Sugihara monoid, or (ii) A is the union of an interval subalgebra [¬(f 2), f 2] := {x ∈ A : ¬(f 2) < x < f 2} and two chains of idempotent elements, (¬(f 2)] and [f 2). In (ii), the upper bounds of f 2 are exactly the idempotent upper bounds of f, and the algebra A/Θ(¬(f 2), t) is an odd Sugihara monoid.

f 2 fr r ✣✢ ✤✜

idempotents above f

[f) f 2 ¬(f 2) r r ✫✪ ✬✩

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-59
SLIDE 59

The simple 0–generated De Morgan monoids are just 2 (= S2), C4 and D4 below (Slaney, 1980s). (The odd Sugihara monoid S3 is not 0–generated.)

s st f 2: s s s1 0 = t = f −1 S3 : s s s s f 2 f t ¬(f 2) C4 : s

  • s

❅ ❅ s

  • s

❅ ❅ f 2 t f ¬(f 2) D4 :

  • Theorem. The minimal varieties of De Morgan monoids

are just V(2), V(S3), V(C4) and V(D4).

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-60
SLIDE 60

The simple 0–generated De Morgan monoids are just 2 (= S2), C4 and D4 below (Slaney, 1980s). (The odd Sugihara monoid S3 is not 0–generated.)

s st f 2: s s s1 0 = t = f −1 S3 : s s s s f 2 f t ¬(f 2) C4 : s

  • s

❅ ❅ s

  • s

❅ ❅ f 2 t f ¬(f 2) D4 :

  • Theorem. The minimal varieties of De Morgan monoids

are just V(2), V(S3), V(C4) and V(D4).

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-61
SLIDE 61

The simple 0–generated De Morgan monoids are just 2 (= S2), C4 and D4 below (Slaney, 1980s). (The odd Sugihara monoid S3 is not 0–generated.)

s st f 2: s s s1 0 = t = f −1 S3 : s s s s f 2 f t ¬(f 2) C4 : s

  • s

❅ ❅ s

  • s

❅ ❅ f 2 t f ¬(f 2) D4 :

  • Theorem. The minimal varieties of De Morgan monoids

are just V(2), V(S3), V(C4) and V(D4).

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-62
SLIDE 62

s ❏ ❏ ❏ s ❜❜❜❜ s ✡ ✡ ✡ s ✧ ✧ ✧ ✧ s s

{trivials}

V(C4) V(S3) V(D4) V(2)

DM Subvarieties of DM

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-63
SLIDE 63

On general grounds, V(2), V(S3), V(C4) and V(D4) are also minimal as quasivarieties, but they are not the only

  • nes.
  • Theorem. There are just 68 minimal quasivarieties of De

Morgan monoids. The proof uses Slaney’s (1985) description of the 3088–element free 0–generated De Morgan monoid.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-64
SLIDE 64

On general grounds, V(2), V(S3), V(C4) and V(D4) are also minimal as quasivarieties, but they are not the only

  • nes.
  • Theorem. There are just 68 minimal quasivarieties of De

Morgan monoids. The proof uses Slaney’s (1985) description of the 3088–element free 0–generated De Morgan monoid.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-65
SLIDE 65

On general grounds, V(2), V(S3), V(C4) and V(D4) are also minimal as quasivarieties, but they are not the only

  • nes.
  • Theorem. There are just 68 minimal quasivarieties of De

Morgan monoids. The proof uses Slaney’s (1985) description of the 3088–element free 0–generated De Morgan monoid.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-66
SLIDE 66

A relevant algebra is a subalgebra B of the t–free reduct A− = A; ·, ∧, ∨, ¬ of a De Morgan monoid A. These form a variety RA, algebraizing the relevance logic R (which lacks the constant symbol t) 2− embeds into every nontrivial finitely generated relevant algebra, so Boolean algebras constitute the smallest nontrivial sub(quasi)variety of RA.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-67
SLIDE 67

A relevant algebra is a subalgebra B of the t–free reduct A− = A; ·, ∧, ∨, ¬ of a De Morgan monoid A. These form a variety RA, algebraizing the relevance logic R (which lacks the constant symbol t) 2− embeds into every nontrivial finitely generated relevant algebra, so Boolean algebras constitute the smallest nontrivial sub(quasi)variety of RA.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-68
SLIDE 68

A relevant algebra is a subalgebra B of the t–free reduct A− = A; ·, ∧, ∨, ¬ of a De Morgan monoid A. These form a variety RA, algebraizing the relevance logic R (which lacks the constant symbol t) 2− embeds into every nontrivial finitely generated relevant algebra, so Boolean algebras constitute the smallest nontrivial sub(quasi)variety of RA.

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-69
SLIDE 69

The bottom of the subvariety lattice of RA was described by ´ Swirydowicz (1995), and is as shown below. His result follows more easily via the consideration of De Morgan monoids above.

s s s ❅ ❅ s

  • s

s {trivials} V(2−) V(C4−) V(S3−) V(D4−) RA

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-70
SLIDE 70

The bottom of the subvariety lattice of RA was described by ´ Swirydowicz (1995), and is as shown below. His result follows more easily via the consideration of De Morgan monoids above.

s s s ❅ ❅ s

  • s

s {trivials} V(2−) V(C4−) V(S3−) V(D4−) RA

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I

slide-71
SLIDE 71

The bottom of the subvariety lattice of RA was described by ´ Swirydowicz (1995), and is as shown below. His result follows more easily via the consideration of De Morgan monoids above.

s s s ❅ ❅ s

  • s

s {trivials} V(2−) V(C4−) V(S3−) V(D4−) RA

  • T. Moraschini, J.G. Raftery and J.J. Wannenburg

Varieties of De Morgan Monoids I