Global Information Lookup Global Information

De Morgan algebra information


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:

  • (A, ∨, ∧, 0, 1) is a bounded 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 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 distributive lattice, and
  • ¬¬x = x, and
  • xy → ¬y ≤ ¬x.

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(xy), min(xy), 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 four-valued semantics for De Morgan algebra, which has the values T(rue), F(alse), B(oth), and N(either), where

  • F < B < T,
  • F < N < T, and
  • B and N are not comparable.[2]
  1. ^ a b Blyth, T. S.; Varlet, J. C. (1994). Ockham algebras. Oxford University Press. pp. 4–5. ISBN 978-0-19-859938-8.
  2. ^ a b c d e Béziau, Jean-Yves (2012). "A History of Truth-Values". In Gabbay, Dov M.; Pelletier, Francis Jeffry; Woods, John (eds.). Logic: A History of its Central Concepts. North Holland (an imprint of Elsevier). pp. 280–281. ISBN 978-0-08-093170-8.
  3. ^ Cignoli, Roberto (1975). "Injective de Morgan and Kleene Algebras" (PDF). Proceedings of the American Mathematical Society. 47 (2): 269–278. doi:10.1090/S0002-9939-1975-0357259-4. JSTOR 2039730.

and 22 Related for: De Morgan algebra information

Request time (Page generated in 0.8313 seconds.)

De Morgan algebra

Last Update:

In mathematics, a De Morgan algebra (named after Augustus De Morgan, a British mathematician and logician) is a structure A = (A, ∨, ∧, 0, 1, ¬) such...

Word Count : 1118

Augustus De Morgan

Last Update:

Augustus De Morgan (1806–1871) was a British mathematician and logician best known for formulating De Morgan's laws. De Morgan is also known for coining...

Word Count : 7125

List of Boolean algebra topics

Last Update:

Boolean algebra Interior algebra Two-element Boolean algebra Derivative algebra (abstract algebra) Free Boolean algebra Monadic Boolean algebra De Morgan algebra...

Word Count : 271

Boolean algebra

Last Update:

mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables...

Word Count : 9405

Relation algebra

Last Update:

relation. Relation algebra emerged in the 19th-century work of Augustus De Morgan and Charles Peirce, which culminated in the algebraic logic of Ernst Schröder...

Word Count : 2546

Fuzzy set operations

Last Update:

function. Fuzzy logic Fuzzy set T-norm Type-2 fuzzy sets and systems De Morgan algebra Klir, George J.; Bo Yuan (1995). Fuzzy Sets and Fuzzy Logic: Theory...

Word Count : 928

List of order theory topics

Last Update:

Heyting algebra Relatively complemented lattice Complete Heyting algebra Pointless topology MV-algebra Ockham algebras: Stone algebra De Morgan algebra Kleene...

Word Count : 396

Ockham algebra

Last Update:

Ockham algebras form a variety. Examples of Ockham algebras include Boolean algebras, De Morgan algebras, Kleene algebras, and Stone algebras. Berman...

Word Count : 165

Heyting algebra

Last Update:

In mathematics, a Heyting algebra (also known as pseudo-Boolean algebra) is a bounded lattice (with join and meet operations written ∨ and ∧ and with...

Word Count : 6241

Stone algebra

Last Update:

space is a Stone algebra. The lattice of positive divisors of a given positive integer is a Stone lattice. De Morgan algebra Heyting algebra Balbes, Raymond...

Word Count : 173

Algebraic logic

Last Update:

Augustus De Morgan (1847), Formal Logic, London: Taylor & Walton, link from Hathi Trust Alexander Macfarlane (1879), Principles of the Algebra of Logic...

Word Count : 2222

Sophia Elizabeth De Morgan

Last Update:

Mary De Morgan A play parodying De Morgan's Elements of Algebra (1835), which was a precursor of the abstract algebra approach, survives in manuscript...

Word Count : 1319

Universal algebra

Last Update:

Universal algebra (sometimes called general algebra) is the field of mathematics that studies algebraic structures themselves, not examples ("models")...

Word Count : 2953

Geometric algebra

Last Update:

algebra (also known as a Clifford algebra) is an extension of elementary algebra to work with geometrical objects such as vectors. Geometric algebra is...

Word Count : 13897

Grigore Moisil

Last Update:

Boolean logic De Morgan algebra Jan Łukasiewicz Łukasiewicz logic Ternary logic Lattices Multi-valued logic: Łukasiewicz–Moisil algebras Quantum logic:...

Word Count : 1372

Canonical normal form

Last Update:

In Boolean algebra, any Boolean function can be expressed in the canonical disjunctive normal form (CDNF) or minterm canonical form, and its dual, the...

Word Count : 3547

Residuated Boolean algebra

Last Update:

with wM in place of Mw. The De Morgan duals ▷ and ◁ of residuation arise as follows. Among residuated lattices, Boolean algebras are special by virtue of...

Word Count : 1155

Algebra of sets

Last Update:

In mathematics, the algebra of sets, not to be confused with the mathematical structure of an algebra of sets, defines the properties and laws of sets...

Word Count : 1865

Complete Boolean algebra

Last Update:

set.[citation needed] For a complete boolean algebra infinite de-Morgan's laws hold. A Boolean algebra is complete if and only if its Stone space of...

Word Count : 1347

Classical logic

Last Update:

entailment and idempotency of entailment Commutativity of conjunction De Morgan duality: every logical operator is dual to another While not entailed...

Word Count : 841

Pseudovector

Last Update:

and bivectors in 3-D". Geometric Algebra for Computer Science: An Object-Oriented Approach to Geometry (2nd ed.). Morgan Kaufmann. p. 82. ISBN 978-0-12-374942-0...

Word Count : 4080

Logic gate

Last Update:

Hardware Description Languages (HDL) such as Verilog or VHDL. By use of De Morgan's laws, an AND function is identical to an OR function with negated inputs...

Word Count : 3459

PDF Search Engine © AllGlobal.net