Conjunction is a binary connective written symbolically as $p \land q$ whose behaviour is as follows:
- $p \land q$
is defined as:
- $p$ is true and $q$ is true.
This is called the conjunction of $p$ and $q$.
The statements $p$ and $q$ are known as:
- the conjuncts
- the members of the conjunction.
$p \land q$ is voiced:
- $p$ and $q$.
This category has the following 31 subcategories, out of 31 total.
- ► Absorption Laws (Logic) (10 P)
- ► De Morgan's Laws (Logic) (35 P)
- ► Factor Principles (23 P)
- ► Modus Ponendo Tollens (14 P)
Pages in category "Conjunction"
The following 60 pages are in this category, out of 60 total.
- Commutative Law
- Conditional iff Biconditional of Antecedent with Conjunction
- Conjunction Absorbs Disjunction
- Conjunction and Implication
- Conjunction Distributes over Disjunction
- Conjunction Equivalent to Negation of Implication of Negative
- Conjunction has no Inverse
- Conjunction iff Biconditional of Biconditional with Disjunction
- Conjunction implies Disjunction
- Conjunction implies Disjunction of Conjunctions with Complements
- Conjunction in terms of NAND
- Conjunction is Associative
- Conjunction is Commutative
- Conjunction is Left Distributive over Disjunction
- Conjunction of Disjunction with Negation is Conjunction with Negation
- Conjunction of Disjunctions Consequence
- Conjunction of Disjunctions with Complements implies Disjunction
- Conjunction with Contradiction
- Conjunction with Law of Excluded Middle
- Conjunction with Negative Equivalent to Negation of Implication
- Conjunction with Tautology
- Constructive Dilemma