__NOTOC__
In
mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics ...
, a De Morgan algebra (named after
Augustus De Morgan, a British mathematician and logician) is a structure ''A'' = (A, ∨, ∧, 0, 1, ¬) such that:
* (''A'', ∨, ∧, 0, 1) is a
bounded
Boundedness or bounded may refer to:
Economics
* Bounded rationality, the idea that human rationality in decision-making is bounded by the available information, the cognitive limitations, and the time available to make the decision
* Bounded e ...
distributive lattice, and
* ¬ is a De Morgan involution: ¬(''x'' ∧ ''y'') = ¬''x'' ∨ ¬''y'' and ¬¬''x'' = ''x''. (i.e. an
involution that additionally satisfies
De Morgan's laws)
In a De Morgan algebra, the laws
* ¬''x'' ∨ ''x'' = 1 (
law of the excluded middle), and
* ¬''x'' ∧ ''x'' = 0 (
law of noncontradiction)
do not always hold. In the presence of the De Morgan laws, either law implies the other, and an algebra which satisfies them becomes a
Boolean algebra.
Remark: It follows that ¬(x ∨ y) = ¬x ∧ ¬y, ¬1 = 0 and ¬0 = 1 (e.g. ¬1 = ¬1 ∨ 0 = ¬1 ∨ ¬¬0 = ¬(1 ∧ ¬0) = ¬¬0 = 0). Thus ¬ is a dual
automorphism
In mathematics, an automorphism is an isomorphism from a mathematical object to itself. It is, in some sense, a symmetry of the object, and a way of mapping the object to itself while preserving all of its structure. The set of all automorphisms ...
of (''A'', ∨, ∧, 0, 1).
If the lattice is defined in terms of the order instead, i.e. (A, ≤) is a bounded partial order with a least upper bound and greatest lower bound for every pair of elements, and the meet and join operations so defined satisfy the distributive law, then the complementation can also be defined as an involutive anti-automorphism, that is, a structure ''A'' = (A, ≤, ¬) such that:
* (A, ≤) is a
bounded
Boundedness or bounded may refer to:
Economics
* Bounded rationality, the idea that human rationality in decision-making is bounded by the available information, the cognitive limitations, and the time available to make the decision
* Bounded e ...
distributive lattice, and
* ¬¬''x'' = ''x'', and
* ''x'' ≤ ''y'' → ¬''y'' ≤ ¬''x''.
De Morgan algebras were introduced by
Grigore Moisil around 1935,
although without the restriction of having a 0 and a 1.
They were then variously called quasi-boolean algebras in the
Polish school, e.g. by
Rasiowa and also distributive ''i''-lattices by
J. A. Kalman.
(''i''-lattice being an abbreviation for lattice with involution.) They have been further studied in the Argentinian algebraic logic school of
Antonio Monteiro.
De Morgan algebras are important for the study of the mathematical aspects of
fuzzy logic
Fuzzy logic is a form of many-valued logic in which the truth value of variables may be any real number between 0 and 1. It is employed to handle the concept of partial truth, where the truth value may range between completely true and completely ...
. The standard fuzzy algebra ''F'' = (
, 1
The comma is a punctuation mark that appears in several variants in different languages. It has the same shape as an apostrophe or single closing quotation mark () in many typefaces, but it differs from them in being placed on the baseline (t ...
max(''x'', ''y''), min(''x'', ''y''), 0, 1, 1 − ''x'') is an example of a De Morgan algebra where the laws of excluded middle and noncontradiction do not hold.
Another example is
Dunn's 4-valued logic, in which ''false'' < ''neither-true-nor-false'' < ''true'' and ''false'' < ''both-true-and-false'' < ''true'', while ''neither-true-nor-false'' and ''both-true-and-false'' are not comparable.
Kleene algebra
If a De Morgan algebra additionally satisfies ''x'' ∧ ¬''x'' ≤ ''y'' ∨ ¬''y'', it is called a Kleene algebra.
(This notion should not to be confused with the other
Kleene algebra generalizing
regular expressions.) This notion has also been called a normal ''i''-lattice by Kalman.
Examples of Kleene algebras in the sense defined above include:
lattice-ordered groups,
Post algebras and
Łukasiewicz algebra
Łukasiewicz is a Polish surname. It comes from the given name Łukasz (Lucas). It is found across Poland, particularly in central regions. It is related to the surnames Łukaszewicz and Lukashevich.
People
* Antoni Łukasiewicz (born 1983), P ...
s.
Boolean algebras also meet this definition of Kleene algebra. The simplest Kleene algebra that is not Boolean is Kleene's
three-valued logic K
3.
K
3 made its first appearance in
Kleene's ''On notation for
ordinal numbers'' (1938). The algebra was named after Kleene by Brignole and Monteiro.
[ A (possibly abbreviated) version of this paper appeared later in ''Proceedings of the Japan Academy'': ]
Related notions
De Morgan algebras are not the only plausible way to generalize Boolean algebras. Another way is to keep ¬''x'' ∧ ''x'' = 0 (i.e. the law of noncontradiction) but to drop the law of the excluded middle and the law of double negation. This approach (called ''semicomplementation'') is well-defined even for a (meet)
semilattice; if the set of semicomplements has a
greatest element it is usually called
pseudocomplement. If the pseudocomplement satisfies the law of the excluded middle, the resulting algebra is also Boolean. However, if only the weaker law ¬''x'' ∨ ¬¬''x'' = 1 is required, this results in
Stone algebra In mathematics, a Stone algebra, or Stone lattice, is a pseudo-complemented distributive lattice such that ''a''* ∨ ''a''** = 1. They were introduced by and named after Marshall Harvey Stone.
Boolean algebras are Stone algebras, and ...
s.
More generally, both De Morgan and Stone algebras are proper subclasses of
Ockham algebras.
See also
*
orthocomplemented lattice
References
Further reading
*
*
*
*
*
*
*
* {{cite book, first1=Maria Luisa , last1=Dalla Chiara, author1-link= Maria Luisa Dalla Chiara , first2=Roberto , last2=Giuntini, first3=Richard , last3=Greechie, title=Reasoning in Quantum Theory: Sharp and Unsharp Quantum Logics, year=2004, publisher=Springer, isbn=978-1-4020-1978-4
Algebra
Lattice theory
Algebraic logic
Ockham algebras