Understanding Logical Relationships through Truth

Tables

1 Introduction
Truth tables are a powerful tool for understanding logical relationships by visually represent-
ing the outcomes of logical operations. Each row in a truth table corresponds to a specific
combination of truth values for the variables involved, while the columns show the result of
applying logical operators such as AND, OR, NOT, and implications to those variables. By
analyzing the table, one can determine the truth value of complex logical expressions and
identify patterns in how different logical statements interact. This method is particularly
useful in fields like mathematics, computer science, and philosophy, where precise logical
reasoning is essential for problem-solving and argumentation.

Example 1:
Statements:
ˆ P : ”The traffic light is green.”

ˆ Q: ”It is safe to walk.”

We will analyze logical operations using these statements.

Negation (NOT, ¬P )
The negation operator reverses the truth value of a statement.
ˆ ¬P means ”The traffic light is NOT green.”

P (Traffic Light is Green) ¬P (Traffic Light is NOT Green)

T F
F T

Interpretation:
ˆ If the light is green, then ”not green” is false.

ˆ If the light is not green, then ”not green” is true.

1
Quantitative Reasoning II Dr. Adeel Anjum 2

Conjunction (AND, P ∧ Q)
The AND operator is true only when both P and Q are true.
ˆ P ∧ Q means ”The light is green AND it is safe to walk.”

P (Traffic Light is Green) Q (Safe to Walk) P ∧ Q (Green Light AND Safe to Walk)
T T T
T F F
F T F
F F F

Interpretation:
ˆ You can only walk if both the traffic light is green AND it is safe.

Disjunction (OR, P ∨ Q)
The OR operator is true if at least one condition is true.
ˆ P ∨ Q means ”The light is green OR it is safe to walk.”

P (Traffic Light is Green) Q (Safe to Walk) P ∨ Q (Green Light OR Safe to Walk)

T T T
T F T
F T T
F F F

Interpretation:
ˆ You can walk if the light is green or if it is safe.

ˆ You shouldn’t walk only if both are false.

Implication (IF-THEN, P → Q)
Implication means that if P is true, then Q must also be true.
ˆ P → Q means ”If the traffic light is green, then it must be safe to walk.”

P (Traffic Light is Green) Q (Safe to Walk) P → Q (If Green, Then Safe)

T T T
T F F
F T T
F F T

Interpretation:
ˆ The only case where the rule fails is when the light is green, but it is NOT safe.
Quantitative Reasoning II Dr. Adeel Anjum 3

Biconditional (IF AND ONLY IF, P ↔ Q)

This operator is true when both statements have the same truth value.

ˆ P ↔ Q means ”The traffic light is green IF AND ONLY IF it is safe to walk.”

P (Traffic Light is Green) Q (Safe to Walk) P ↔ Q (Green Light IF AND ONLY IF Safe)
T T T
T F F
F T F
F F T

Interpretation:

ˆ The rule holds only if both statements are either true or false.

ˆ If one is true and the other is false, the rule is broken.

2 Conclusion
This truth table example helps understand basic logical operators:

ˆ AND (∧) requires both statements to be true.

ˆ OR (∨) requires at least one statement to be true.

ˆ NOT (¬) negates the statement.

ˆ Implication (→) means that one statement leads to the other.

ˆ Biconditional (↔) means both must have the same truth value.

Understanding these operators helps in logic, computing, and decision-making in real life.
Quantitative Reasoning II Dr. Adeel Anjum 4

Example 2
Statements:
ˆ P : ”It is raining.”

ˆ Q: ”I carry an umbrella.”

Negation (NOT, ¬P )
The negation operator reverses the truth value of a statement.

ˆ ¬P means ”It is NOT raining.”

P (It is raining) ¬P (It is NOT raining)

T F
F T

Conjunction (AND, P ∧ Q)
The AND operator is true only when both P and Q are true.

ˆ P ∧ Q means ”It is raining AND I carry an umbrella.”

P (It is raining) Q (I carry an umbrella) P ∧ Q (Raining AND Umbrella)

T T T
T F F
F T F
F F F

Disjunction (OR, P ∨ Q)
The OR operator is true if at least one condition is true.

ˆ P ∨ Q means ”It is raining OR I carry an umbrella.”

P (It is raining) Q (I carry an umbrella) P ∨ Q (Raining OR Umbrella)

T T T
T F T
F T T
F F F
Quantitative Reasoning II Dr. Adeel Anjum 5

Implication (IF-THEN, P → Q)
Implication means that if P is true, then Q must also be true.

ˆ P → Q means ”If it is raining, then I carry an umbrella.”

P (It is raining) Q (I carry an umbrella) P → Q (If Raining, Then Umbrella)

T T T
T F F
F T T
F F T

Biconditional (IF AND ONLY IF, P ↔ Q)

This operator is true when both statements have the same truth value.

ˆ P ↔ Q means ”It is raining IF AND ONLY IF I carry an umbrella.”

P (It is raining) Q (I carry an umbrella) P ↔ Q (Raining IF AND ONLY IF Umbrella)

T T T
T F F
F T F
F F T

Example 3: Student Exam Scenario

Statements:
ˆ P : ”I study hard.”

ˆ Q: ”I pass the exam.”

Negation (NOT, ¬P )
P (Study hard) ¬P (Do not study hard)
T F
F T

Interpretation:

ˆ If I study hard (T), then ”do not study hard” is false (F).

ˆ If I do not study hard (F), then ”do not study hard” is true (T).
Quantitative Reasoning II Dr. Adeel Anjum 6

Conjunction (AND, P ∧ Q)
P (Study hard) Q (Pass exam) P ∧ Q (Study AND Pass)
T T T
T F F
F T F
F F F
Interpretation:
ˆ The conjunction is true only when both conditions are met: I study hard and I pass
the exam.

Disjunction (OR, P ∨ Q)
P (Study hard) Q (Pass exam) P ∨ Q (Study OR Pass)
T T T
T F T
F T T
F F F
Interpretation:
ˆ The disjunction is true if at least one of the conditions is true. It is false only when
both are false.

Implication (IF-THEN, P → Q)
P (Study hard) Q (Pass exam) P → Q (If Study, then Pass)
T T T
T F F
F T T
F F T
Interpretation:
ˆ The implication fails (F) only when I study hard (T) but do not pass the exam (F).
In all other cases, it holds true.

Biconditional (IF AND ONLY IF, P ↔ Q)

P (Study hard) Q (Pass exam) P ↔ Q (Study IFF Pass)
T T T
T F F
F T F
F F T
Interpretation:
ˆ The biconditional is true when both statements share the same truth value (both true
or both false) and false otherwise.
Quantitative Reasoning II Dr. Adeel Anjum 7

Example 4: Online Order Scenario

Statements:
ˆ P : ”I place an order.”

ˆ Q: ”I receive a confirmation email.”

Negation (NOT, ¬P )
P (Place order) ¬P (Do not place order)
T F
F T

Interpretation:

ˆ If I place an order (T), then ”do not place order” is false (F).

ˆ If I do not place an order (F), then ”do not place order” is true (T).

Conjunction (AND, P ∧ Q)
P (Place order) Q (Receive email) P ∧ Q (Order AND Email)
T T T
T F F
F T F
F F F

Interpretation:

ˆ Both conditions must be met: I must place an order and receive a confirmation email
for the statement to be true.

Disjunction (OR, P ∨ Q)
P (Place order) Q (Receive email) P ∨ Q (Order OR Email)
T T T
T F T
F T T
F F F

Interpretation:

ˆ The disjunction is true if at least one of the conditions occurs. It is false only if neither
occurs.
Quantitative Reasoning II Dr. Adeel Anjum 8

Implication (IF-THEN, P → Q)
P (Place order) Q (Receive email) P → Q (If Order, then Email)
T T T
T F F
F T T
F F T

Interpretation:

ˆ The implication fails (F) only when I place an order (T) but do not receive a confir-
mation email (F). Otherwise, it holds true.

Biconditional (IF AND ONLY IF, P ↔ Q)

P (Place order) Q (Receive email) P ↔ Q (Order IFF Email)
T T T
T F F
F T F
F F T

Interpretation:

ˆ The biconditional is true only when both statements have the same truth value (both
true or both false) and false otherwise.

Example 5: Coding and Compilation Scenario

Statements:
ˆ P : ”I write code.”

ˆ Q: ”My code compiles successfully.”

Negation (NOT, ¬P )
P (I write code) ¬P (I do not write code)
T F
F T

Interpretation:

ˆ If I write code (T), then ”I do not write code” is false (F).

ˆ If I do not write code (F), then ”I do not write code” is true (T).
Quantitative Reasoning II Dr. Adeel Anjum 9

Conjunction (AND, P ∧ Q)
P (I write code) Q (Code compiles) P ∧ Q (Code written AND compiles)
T T T
T F F
F T F
F F F
Interpretation:
ˆ The statement is true only if I write code and my code compiles successfully.

Disjunction (OR, P ∨ Q)
P (I write code) Q (Code compiles) P ∨ Q (Code written OR compiles)
T T T
T F T
F T T
F F F
Interpretation:
ˆ The disjunction is true if at least one condition holds: either I write code or my code
compiles successfully.

Implication (IF-THEN, P → Q)
P (I write code) Q (Code compiles) P → Q (If code is written, then it compiles)
T T T
T F F
F T T
F F T
Interpretation:
ˆ The implication fails only when I write code (T) but my code does not compile (F).

Biconditional (IF AND ONLY IF, P ↔ Q)

P (I write code) Q (Code compiles) P ↔ Q (Code written IFF compiles)
T T T
T F F
F T F
F F T
Interpretation:
ˆ The biconditional is true when both conditions share the same truth value: either I
write code and it compiles, or I do not write code (so the code does not compile).