| 词条 | De Morgan algebra |
| 释义 |
In mathematics, a De Morgan algebra (named after Augustus De Morgan, a British mathematician and logician) is a structure A = (A, ∨, ∧, 0, 1, ¬) such that:
In a De Morgan algebra, the laws
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. 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:
De Morgan algebras were introduced by Grigore Moisil[1][2] around 1935.[2] although without the restriction of having a 0 and a 1.[3] 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.[2] (i-lattice being an abbreviation for lattice with involution.) They have been further studied in the Argentinian algebraic logic school of Antonio Monteiro.[1][2] De Morgan algebras are important for the study of the mathematical aspects of fuzzy logic. The standard fuzzy algebra F = ([0, 1], 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.[2] Kleene algebraIf a De Morgan algebra additionally satisfies x ∧ ¬x ≤ y ∨ ¬y, it is called a Kleene algebra.[1][3] (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 algebras.[3] Boolean algebras also meet this definition of Kleene algebra. The simplest Kleene algebra that is not Boolean is Kleene's three-valued logic K3.[4] K3 made its first appearance in Kleene's On notation for ordinal numbers (1938).[5] The algebra was named after Kleene by Brignole and Monteiro.[6] Related notionsDe Morgan algebra is not the only plausible way to generalize the Boolean algebra. 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 thus defined 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 algebras.[1] More generally, both De Morgan and Stone algebras are proper subclasses of Ockham algebras. See also
References1. ^1 2 3 {{cite book| ref = harv| first1=T. S.|last1=Blyth|first2=J. C.|last2=Varlet|title=Ockham algebras|year=1994|publisher=Oxford University Press|isbn=978-0-19-859938-8|pages=4–5}} 2. ^1 2 3 4 {{cite book | ref = harv | editor1-first=Dov M. | editor1-last=Gabbay | editor2-first=Francis Jeffry | editor2-last=Pelletier | editor3-first=John | editor3-last=Woods|title=Logic: A History of its Central Concepts| year=2012|publisher=North Holland (an imprint of Elsevier)|isbn=978-0-08-093170-8 | first1= Jean-Yves | last1 = Béziau| chapter=A History of Truth-Values|pages=280–281}} 3. ^1 2 {{cite journal|url=http://www.ams.org/journals/proc/1975-047-02/S0002-9939-1975-0357259-4/S0002-9939-1975-0357259-4.pdf |title=Injective de Morgan and Kleene Algebras|first=Roberto |last=Cignoli |journal=Proceedings of the American Mathematical Society|volume=47|number= 2|year=1975 |pages=269–278|ref=harv|doi=10.1090/S0002-9939-1975-0357259-4|jstor=2039730}} 4. ^{{cite book|first1=Kalle |last1=Kaarli|first2=Alden F. |last2=Pixley|title=Polynomial Completeness in Algebraic Systems|url=https://books.google.com/books?id=YVHDN_EiA0YC&pg=PA297|date=21 July 2000|publisher=CRC Press|isbn=978-1-58488-203-9|pages=297–}} 5. ^{{cite journal |first=S. C. |last=Kleene |authorlink=Stephen Cole Kleene |title=On Notation for Ordinal Numbers |journal=The Journal of Symbolic Logic |volume=3 |number=4 |year=1938 |pages=150–155 |doi=10.2307/2267778 |jstor=2267778}} 6. ^{{cite journal |last1=Brignole |first1=D. |last2=Monteiro |first2=A. |authorlink2=Antonio Monteiro (mathematician) |title=Caracterisation des algèbres de Nelson par des egalités |journal=Notas de Logica Matematica |publisher=Instituto de Matematica Universidad del sur Bahia Blanca |volume=20 |year=1964}} A (possibly abbreviated) version of this paper appeared later in Proceedings of the Japan Academy: {{cite journal |title=Caracterisation des algèbres de Nelson par des egalités, I|doi=10.3792/pja/1195521624|postscript=,}} {{cite journal |title=Caracterisation des algèbres de Nelson par des egalités, II|doi=10.3792/pja/1195521625}} Further reading
4 : Algebra|Lattice theory|Algebraic logic|Ockham algebras |
| 随便看 |
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。