Processing math: 100%

De Morgan algebras

Abbreviation: DeMA

Definition

A \emph{De Morgan algebra} is a structure A=A,,0,,1,¬ such that

A,,0,,1 is a bounded distributive lattice

¬ is a De Morgan involution: ¬(xy)=¬x¬y, ¬¬x=x

Remark: It follows that ¬(xy)=¬x¬y,  ¬1=0 and ¬0=1 (e.g. ¬1=¬10=¬1¬¬0=¬(1¬0)=¬¬0=0). Thus ¬ is a dual automorphism.

Morphisms

Let A and B be De Morgan algebras. A morphism from A to B is a function h:AB that is a homomorphism:

h(xy)=h(x)h(y), h(¬x)=¬h(x)

Examples

Example 1: Let {0<a,b<1} be the 4-element lattice with a,b incomparable, and define by 0=1,a=a,b=b.

Basic results

The algebra in Example 1 generates the variety of De Morgan algebras, see e.g. http://www.math.uic.edu/~kauffman/DeMorgan.pdf

Properties

Finite members

f(1)=1f(2)=1f(3)=1f(4)=3f(5)=1f(6)=4f(7)=2f(8)=9f(9)=5f(10)=14

Subclasses

Superclasses

References


QR Code
QR Code de_morgan_algebras (generated for current page)