Chapter 1

Table 1. Logic Connectives

Name Represented Meaning

Negation ¬p not in p
Conjunction p ∧q p and q
Disjunction p ∨q p or q (or both)
Implication p → q if p then q
Biconditional p ↔ q p if and only if q

Mathematics–SAS (VIT University) MAT1014–DMGT 7 / 66

 Chapter 1

The truth value of a compound proposition depends only on the value of

its components. Writing F for false and T for true, we can summarize the
meaning of the connectives in the following way:

p q ¬p p ∧q p ∨q p → q p ↔ q
T T F T T T T
T F F F T F F
F T T F T T F
F F T F F T T

Mathematics–SAS (VIT University) MAT1014–DMGT 8 / 66

 Chapter 1

Definition 7. (Tautology)
A proposition is said to be a tautology if its truth value is T for any
assignment of truth values to its components.

Example: The proposition p ∨ ¬p is a tautology.

Definition 8. (Contradiction)
A proposition is said to be a contradiction if its truth value is F for any
assignment of truth values to its components.

Example: The proposition p ∧ ¬p is a contradiction.

Definition 9.(Contingency)
A proposition that is neither a tautology nor a contradiction is called a
contingency.

Mathematics–SAS (VIT University) MAT1014–DMGT 9 / 66

 Chapter 1

p ¬p p ∧ ¬p p ∨ ¬p
T F F T
T F F T

Mathematics–SAS (VIT University) MAT1014–DMGT 10 / 66

 Chapter 1

I. Construct the truth table for the following statements:

(i) (p → q) ←→ (¬p ∨ q)

(ii) p ∧ (p ∨ q)

(iii) (p → q) → p

(iv) ¬ (p ∧ q) ←→ (¬ p ∨ ¬ q)

(v) (p ∨ ¬q) → q

Mathematics–SAS (VIT University) MAT1014–DMGT 11 / 66

 Chapter 1

Solution:

(i) Let S = (p → q) ←→ (¬p ∨ q)

p q ¬p p → q ¬p ∨ q S
T T F T T T
T F F F F T
F T T T T T
F F T T T T

Mathematics–SAS (VIT University) MAT1014–DMGT 12 / 66

 Chapter 1

(ii) Let S = p ∧ (p ∨ q)

p q p ∨q S
T T T T
T F T T
F T T F
F F F F

Mathematics–SAS (VIT University) MAT1014–DMGT 13 / 66

 Chapter 1

(iii) Let S = (p → q) → p

p q p → q S
T T T T
T F F T
F T T F
F F T F

Mathematics–SAS (VIT University) MAT1014–DMGT 14 / 66

 Chapter 1

(iv) Let S = ¬ (p ∧ q) ←→ ¬ p ∨ ¬ q

p q p ∧q ¬ (p ∧ q) ¬p ¬q ¬p ∨ ¬q S
T T T F F F F T
T F F T F T T T
F T F T T F T T
F F F T T T T T

Mathematics–SAS (VIT University) MAT1014–DMGT 15 / 66

 Chapter 1

(v) Let S = (p ∨ ¬q) → q

p q ¬q p ∨ ¬q S
T T F T T
T F T T F
F T F F T
F F T T F

Mathematics–SAS (VIT University) MAT1014–DMGT 16 / 66