propositional logic, the commutativity of conjunction is a valid argument form and truth-functional tautology. It is considered to be a law of classical logic...
3 KB (401 words) - 05:13, 14 January 2025
logical conjunction, such as associativity, commutativity and idempotence. As with other notions formalized in mathematical logic, the logical conjunction and...
18 KB (1,465 words) - 05:16, 22 February 2025
Classical logic (redirect from History of classical logic)
explosion Monotonicity of entailment and idempotency of entailment Commutativity of conjunction De Morgan duality: every logical operator is dual to another...
7 KB (841 words) - 17:51, 1 January 2025
conjunction elimination (also called and elimination, ∧ elimination, or simplification) is a valid immediate inference, argument form and rule of inference...
3 KB (322 words) - 21:19, 27 April 2024
De Morgan's laws (redirect from Negation of conjunction)
expression of conjunctions and disjunctions purely in terms of each other via negation. The rules can be expressed in English as: The negation of "A and B"...
22 KB (3,645 words) - 13:18, 9 May 2025
Conjunction introduction (often abbreviated simply as conjunction and also called and introduction or adjunction) is a valid rule of inference of propositional...
3 KB (302 words) - 10:06, 12 March 2025
Biconditional elimination Biconditional introduction Case analysis Commutativity of conjunction Conjunction introduction Constructive dilemma Contraposition (traditional...
25 KB (2,119 words) - 22:15, 10 April 2025
John von Neumann (category Members of the Royal Netherlands Academy of Arts and Sciences)
the non-commutativity of conjunction ( A ∧ B ) ≠ ( B ∧ A ) {\displaystyle (A\land B)\neq (B\land A)} . It was also demonstrated that the laws of distribution...
208 KB (23,696 words) - 20:41, 12 May 2025
Distributive property (category Properties of binary operations)
near-ring, which removes the commutativity of the additively written group and assumes only one-sided distributivity, one can speak of (two-sided) distributive...
19 KB (2,998 words) - 21:31, 18 March 2025
Natural deduction (category CS1 maint: DOI inactive as of February 2025)
which is short for "conjunction introduction". As an example of the use of inference rules, consider commutativity of conjunction. If A ∧ B, then B ∧...
70 KB (6,972 words) - 00:21, 5 May 2025
Boolean algebra (redirect from Laws of classical logic)
one starts to notice differences such as failure of commutativity, for example, the conjunction of "Jim opened the door" with "Jim walked through the...
75 KB (9,572 words) - 09:14, 22 April 2025
Combs method -- Common knowledge (logic) -- Commutativity of conjunction -- Completeness (logic) -- Composition of Causes -- Compossibility -- Comprehension...
20 KB (1,851 words) - 22:57, 29 March 2025
Boolean ring (section Properties of Boolean rings)
rise to a Boolean algebra, with ring multiplication corresponding to conjunction or meet ∧, and ring addition to exclusive disjunction or symmetric difference...
12 KB (1,419 words) - 01:16, 15 November 2024
Associative property (category Properties of binary operations)
multiplication of real numbers are associative operations". Associativity is not the same as commutativity, which addresses whether the order of two operands...
25 KB (3,387 words) - 04:09, 6 May 2025
Modus ponens (redirect from Law of Detachment)
is one of the standard patterns of inference that can be applied to derive chains of conclusions that lead to the desired goal. The form of a modus ponens...
17 KB (2,385 words) - 04:52, 5 May 2025
Disjunctive normal form (redirect from Sum-of-product)
canonical normal form of a logical formula consisting of a disjunction of conjunctions; it can also be described as an OR of ANDs, a sum of products, or — in...
18 KB (2,191 words) - 17:51, 10 May 2025
Addition (redirect from Addition of natural numbers)
The commutativity and associativity of rational addition are easy consequences of the laws of integer arithmetic. A common construction of the set of real...
80 KB (10,120 words) - 04:20, 12 May 2025
Quantifier (logic) (redirect from Range of quantification)
denote their universal closure, like ∀x ∀y (x+y=y+x) to express commutativity. None of the quantifiers previously discussed apply to a quantification such...
32 KB (4,559 words) - 12:11, 11 May 2025
( a ∨ b ) ∨ c {\displaystyle a\lor (b\lor c)\equiv (a\lor b)\lor c} Commutativity: a ∨ b ≡ b ∨ a {\displaystyle a\lor b\equiv b\lor a} Distributivity:...
16 KB (1,937 words) - 20:20, 25 April 2025
Logical connective (category Pages that use a deprecated format of the math tags)
row, the order of the operations does not matter as long as the sequence of the operands is not changed. Commutativity The operands of the connective...
34 KB (3,164 words) - 12:59, 14 April 2025
Truth table (category Pages that use a deprecated format of the math tags)
and q are true, then the conjunction p ∧ q is true. For all other assignments of logical values to p and to q the conjunction p ∧ q is false. It can also...
43 KB (3,307 words) - 00:46, 15 April 2025
Universal instantiation (redirect from Instantiation of universals)
is a valid rule of inference from a truth about each member of a class of individuals to the truth about a particular individual of that class. It is...
3 KB (391 words) - 10:12, 25 January 2024
Hypothetical syllogism (redirect from Transitivity of implication)
form of hypothetical syllogism, more useful for classical propositional calculus systems with implication and negation (i.e. without the conjunction symbol)...
9 KB (1,318 words) - 22:15, 9 April 2025
Disjunction elimination (category Rules of inference)
cases, case analysis, or or elimination) is the valid argument form and rule of inference that allows one to eliminate a disjunctive statement from a logical...
3 KB (386 words) - 03:49, 4 March 2025
Exclusive or (category Pages that use a deprecated format of the math tags)
{\triangledown } T} , or S △ T {\displaystyle S\mathop {\vartriangle } T} . Commutativity: yes Associativity: yes Distributivity: The exclusive or does not distribute...
31 KB (3,354 words) - 12:57, 14 April 2025
Convolution (redirect from Convolution of functions)
integral result (see commutativity). Graphically, it expresses how the 'shape' of one function is modified by the other. Some features of convolution are similar...
67 KB (8,819 words) - 15:20, 10 May 2025
Double negation (redirect from Law of double negation)
In propositional logic, the double negation of a statement states that "it is not the case that the statement is not true". In classical logic, every statement...
8 KB (1,172 words) - 07:35, 3 July 2024
Disjunctive syllogism (category Rules of inference)
argument form which is a syllogism having a disjunctive statement for one of its premises. An example in English: I will choose soup or I will choose salad...
6 KB (662 words) - 03:28, 3 March 2024
Modus ponendo tollens (category Rules of inference)
is the principle that, if the negation of a conjunction holds and also one of its conjuncts, then the negation of its other conjunct holds." In logic notation...
2 KB (245 words) - 05:13, 14 January 2025
Modus tollens (category Pages displaying short descriptions of redirect targets via Module:Annotated link)
of inference. Modus tollens is a mixed hypothetical syllogism that takes the form of "If P, then Q. Not Q. Therefore, not P." It is an application of...
13 KB (1,847 words) - 09:18, 3 May 2025