Difference between revisions of "De Morgan's laws"
(Created page with "{{WikiEntry|key=De Morgan's laws|qCode=173300}} is a pair of transformation rules that are both valid rules of inference.") |
|||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{WikiEntry|key=De Morgan's laws|qCode=173300}} is a pair of transformation rules that are both valid rules of inference. | {{WikiEntry|key=De Morgan's laws|qCode=173300}} is a pair of transformation rules that are both valid rules of inference. It is a kind of [[commutator]] in [[quantum mechanics]] or [[linear algebra]]. | ||
<noinclude> | |||
=How does commutator relate to De Morgan's law in boolean algebra?= | |||
{{:How does commutator relate to De Morgan's law in boolean algebra?}} | |||
{{PagePostfix | |||
|category_csd=Galois theory,Quintic Equations,Symmetry,Commutator,De Morgan's laws,Observable | |||
}} | |||
</noinclude> | |||
Latest revision as of 02:12, 2 February 2023
De Morgan's laws(Q173300) is a pair of transformation rules that are both valid rules of inference. It is a kind of commutator in quantum mechanics or linear algebra.
How does commutator relate to De Morgan's law in boolean algebra?
In boolean algebra, De Morgan's law states that the negation of a conjunction (AND) of two propositions is equal to the disjunction (OR) of their negations, and vice versa. The two De Morgan's laws can be written as:
~(A & B) = ~A v ~B
~(A v B) = ~A & ~B
The term "commutator" is often used to describe operations that commute, meaning that their order does not affect the result. In boolean algebra, the De Morgan's laws show that negation and conjunction (or disjunction) commute, in the sense that negating the result of a conjunction (or disjunction) is equivalent to first negating the individual terms and then computing the conjunction (or disjunction).
In this sense, the De Morgan's laws are related to the idea of commutativity, as they show that negation and conjunction (or disjunction) can be performed in either order and still produce the same result. The De Morgan's laws are important laws of boolean algebra and are widely used in computer science, logic, and mathematics.
— ChatGPT
References
Related Pages