Search results
Results from the WOW.Com Content Network
Distributivity is a property of some logical connectives of truth-functional propositional logic. The following logical equivalences demonstrate that distributivity is a property of particular connectives. The following are truth-functional tautologies.
In the mathematical area of order theory, there are various notions of the common concept of distributivity, applied to the formation of suprema and infima.Most of these apply to partially ordered sets that are at least lattices, but the concept can in fact reasonably be generalized to semilattices as well.
The principle of distributivity is valid in classical logic, but both valid and invalid in quantum logic. The article "Is Logic Empirical?" discusses the case that quantum logic is the correct, empirical logic, on the grounds that the principle of distributivity is inconsistent with a reasonable interpretation of quantum phenomena. [1]
Finally distributivity entails several other pleasant properties. For example, an element of a distributive lattice is meet-prime if and only if it is meet-irreducible, though the latter is in general a weaker property. By duality, the same is true for join-prime and join-irreducible elements. [7]
In the mathematical area of order theory, a completely distributive lattice is a complete lattice in which arbitrary joins distribute over arbitrary meets.. Formally, a complete lattice L is said to be completely distributive if, for any doubly indexed family {x j,k | j in J, k in K j} of L, we have
Distributivity, a property of binary operations that generalises the distributive law from elementary algebra; Distribution (number theory) Distribution problems, a common type of problems in combinatorics where the goal is to enumerate the number of possible distributions of m objects to n recipients, subject to various conditions; see ...
From a related word or phrase: This is a redirect from a word or phrase to a page title that is related in some way.This redirect might be a good search term, or it could be a candidate for a Wiktionary link.
To investigate the left distributivity of set subtraction over unions or intersections, consider how the sets involved in (both of) De Morgan's laws are all related: () = = () always holds (the equalities on the left and right are De Morgan's laws) but equality is not guaranteed in general (that is, the containment might be strict).