LOGICAL CONNECTIVES

Truth Tables & Statements

Negation

- A statement which is the exact opposite of the original statement. This is written as ∼ P (read as
“not P”)

P ∼P

T F

F T

Conjunction

- Compound statement that has two propositions combined by AND operator. This is written as P
∧ Q (read as “conjunction of P and Q”) which is True when both P and Q are True, otherwise,
false.

P Q P∧Q

T T T

T F F

F T F

F F F
Disjunction

- Compound statement that has two propositions combined by OR operator. This is written as P ∨
Q (read as “disjunction of P and Q”) which is True when one or more are True, otherwise, False.

P Q P∨Q

T T T

T F T

F T T

F F F

Conditional

- Compound statement that has two propositions combined by implication operator. This is
written as P → Q (read as “if P then Q” or “P implies Q”, “P only if Q”, ‘P is sufficient for Q”, “Q is
necessary for P”, “Q follows from Q”, “Q if P”) which can only be false when P (hypothesis) is
True and Q (conclusion) is False, otherwise, the statement is True.

P Q P→Q

T T T

T F F

F T T

F F T
Biconditional

- Compound statement that has two propositions combined by double implication operator. This
is written as P ↔ Q (read as “P if only if Q”) which is True when P (antecedent) and Q
(consequent) are both True or both False, otherwise, the statement is False.

P Q P↔Q

T T T

T F F

F T F

F F T

Source:

https://www.chilimath.com/lessons/introduction-to-number-theory/truth-tables-of-five-common-
logical-connectives/