10 Matching Annotations
 Jul 2020

en.wikipedia.org en.wikipedia.org

In logic, functions or relations A and B are considered dual if A(¬x) = ¬B(x), where ¬ is logical negation. The basic duality of this type is the duality of the ∃ and ∀ quantifiers in classical logic. These are dual because ∃x.¬P(x) and ¬∀x.P(x) are equivalent for all predicates P in classical logic

the ∧ and ∨ operators are dual in this sense, because (¬x ∧ ¬y) and ¬(x ∨ y) are equivalent. This means that for every theorem of classical logic there is an equivalent dual theorem. De Morgan's laws are examples

 May 2020

en.wikipedia.org en.wikipedia.org

Related concepts in other fields are: In natural language, the coordinating conjunction "and". In programming languages, the shortcircuit and control structure. In set theory, intersection. In predicate logic, universal quantification.
Strictly speaking, are these examples of dualities (https://en.wikipedia.org/wiki/Duality_(mathematics))? Or can I only, at strongest, say they are analogous (a looser coonection)?


en.wikipedia.org en.wikipedia.org
Tags
Annotators
URL


en.wikipedia.org en.wikipedia.org

Mathematically speaking, necessity and sufficiency are dual to one another. For any statements S and N, the assertion that "N is necessary for S" is equivalent to the assertion that "S is sufficient for N".


en.wikipedia.org en.wikipedia.org
Tags
Annotators
URL


en.wikipedia.org en.wikipedia.org

This is an abstract form of De Morgan's laws, or of duality applied to lattices.


en.wikipedia.org en.wikipedia.org

A plane graph is said to be selfdual if it is isomorphic to its dual graph.



en.wikipedia.org en.wikipedia.org

In mathematical contexts, duality has numerous meanings[1] although it is "a very pervasive and important concept in (modern) mathematics"[2] and "an important general theme that has manifestations in almost every area of mathematics".[3]
