Math 2.0

Order, lattices, ordered algebraic structures Distributive lattices Concept

De Morgan algebra

Summary

A De Morgan algebra is a bounded distributive lattice with a negation ∼\sim that is an involution and satisfies De Morgan's laws. Unlike the complement of a Boolean algebra, this negation need not satisfy a∧∼a=0a \wedge {\sim} a = 0 or a∨∼a=1a \vee {\sim} a = 1. De Morgan algebras give the algebraic semantics of several many-valued and relevance logics. Every Boolean algebra is a De Morgan algebra.

Further reading

  1. Web https://en.wikipedia.org/wiki/De_Morgan_algebra
About this page
Tag5Q53XWV0QN
URIm2://5Q53XWV0QN
Kindconcept
WritingW0 stub
MSC06D30
SpecializesDistributive lattice
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions