9.1 Propositional Logic, Truth Tables & Quantifiers

9.1 Propositional Logic, Truth Tables & Quantifiers

Deductive reasoning and formal logic constitute the foundational architecture of secondary and higher mathematics. For accomplished mathematics educators (grades 9–12), mastery of propositional calculus, truth tables, and predicate quantification is essential not only for teaching formal geometric and algebraic proofs, but also for cultivating students' capacity to construct viable arguments and critique the reasoning of others (Common Core Standard for Mathematical Practice 3; NBPTS Standard II). This section develops the syntactic and semantic structures of propositional logic, systematizes logical equivalences, investigates quantified statements, and examines prevalent student cognitive fallacies.

---

1. Foundations of Propositional Logic: Statements and Truth Values

A proposition (or statement) is a declarative sentence that is definitively either True (T) or False (F), but not both simultaneously. Classical propositional logic is governed by two foundational principles:

1. The Law of Excluded Middle: For any proposition p, the compound statement p ∨ ¬p is universally valid. Every proposition possesses a definite truth value; there are no indeterminate or intermediate truth states in bivalent logic.
2. The Law of Non-Contradiction: For any proposition p, the compound statement ¬(p ∧ ¬p) is universally valid. A statement cannot be simultaneously true and false within the same context.

Distinguishing Propositions from Non-Propositions

In secondary classrooms, students frequently confuse open expressions, commands, or subjective opinions with formal mathematical propositions:

---

2. Logical Connectives and Truth Tables

Compound statements are constructed from atomic propositions using primitive logical operators (connectives). The semantic behavior of each connective is defined strictly by its truth table.

The Connectives Defined

• Negation (¬p or ~p): Reverses the truth value of p. If p is T, ¬p is F; if p is F, ¬p is T.
• Conjunction (p ∧ q): Represents "p and q". The statement p ∧ q is true if and only if both p and q are true.
• Disjunction (p ∨ q): Represents the mathematical inclusive OR ("p or q or both"). The statement p ∨ q is true if at least one operand is true, failing only when both p and q are false. In contrast, the secondary exclusive OR (XOR, denoted p ⊕ q) requires exactly one operand to be true: p ⊕ q ≡ (p ∨ q) ∧ ¬(p ∧ q). In formal mathematics, "or" is assumed inclusive unless explicitly qualified.
• Conditional (p → q): Represents "if p, then q". Here p is the antecedent (hypothesis) and q is the consequent (conclusion). The implication p → q asserts that if p occurs, q must necessarily occur. Thus, p → q is false exclusively when the hypothesis p is true but the conclusion q is false (T → F). In all other cases, p → q evaluates to True.
• Biconditional (p ↔ q): Represents "p if and only if q" (abbreviated iff). The biconditional is true when p and q share identical truth values (T ↔ T and F ↔ F) and false when their truth values differ. It represents mutual implication: (p → q) ∧ (q → p).

The Pedagogical Challenge of Vacuous Truth

A persistent stumbling block for high school students is accepting that p → q evaluates to True whenever p is false (F → T is T, and F → F is T). This is termed vacuous truth.

[!NOTE] Pedagogical Analogy for Vacuous Truth: Frame the conditional as a contractual commitment: "If you achieve a 95% on the final exam (p), then I will write you a letter of recommendation (q)."

• If the student achieves a 95% and the teacher writes the letter (T → T), the commitment was fulfilled (True).
• If the student achieves a 95% and the teacher refuses to write the letter (T → F), the commitment was violated (False).
• If the student achieves an 80% (p is False), the teacher has broken no contractual promise regardless of whether they choose to write the letter (F → T) or decline (F → F). In neither case is the teacher guilty of a false promise. Hence, the conditional statement remains unviolated (True).

In set theory, this justifies why the empty set ∅ is a subset of every set A: the conditional definition x ∈ ∅ ⟹ x ∈ A is vacuously true because the hypothesis x ∈ ∅ is universally false for all x.

---

3. Logical Equivalences & Conditional Variations

Two compound statements P and Q are logically equivalent (written P ≡ Q or P ⟺ Q) if they possess identical truth values across every possible combination of truth assignments to their constituent propositional variables. A compound statement that evaluates to true across all rows of its truth table is a tautology (T₀); a statement that evaluates to false across all rows is a contradiction (F₀); and a statement whose truth depends on variable assignments is a contingency.

Fundamental Logical Equivalences

De Morgan's Laws and Disjunctive Equivalence

De Morgan's Laws dictate that negating a compound conjunction distributes negation to both components while toggling the connective from AND to OR: ¬(p ∧ q) ≡ ¬p ∨ ¬q. Similarly, the conditional equivalence p → q ≡ ¬p ∨ q reveals that an implication is simply an assertion that either the hypothesis failed or the conclusion held. Applying De Morgan's Law to this disjunction yields the formal negation of a conditional: ¬(p → q) ≡ ¬(¬p ∨ q) ≡ ¬(¬p) ∧ ¬q ≡ p ∧ ¬q

This identity is foundational to indirect mathematical proof: to disprove an implication p → q, one does not prove that p implies ¬q; rather, one must exhibit an instance where p is simultaneously true and q is false.

The Four Conditional Variations

From an original conditional statement p → q, three related conditional statements are formed:

                    [ DIRECT CONDITIONAL ]
                           p → q
                          ↗     ↖
             CONVERSE    /       \   CONVERSE
                        ↙         ↘
         [ CONVERSE ]                 [ INVERSE ]
            q → p                       ¬p → ¬q
                        ↖         ↗
             CONVERSE    \       /   CONVERSE
                          ↘     ↙
                    [ CONTRAPOSITIVE ]
                        ¬q → ¬p

• Direct Statement: p → q ("If p, then q")
• Converse: q → p ("If q, then p")
• Inverse: ¬p → ¬q ("If not p, then not q")
• Contrapositive: ¬q → ¬p ("If not q, then not p")

[!IMPORTANT] Equivalence Pairs Theorem:

1. A conditional statement and its contrapositive are strictly logically equivalent: (p → q) ≡ (¬q → ¬p).
2. The converse and inverse of a conditional statement are strictly logically equivalent to each other: (q → p) ≡ (¬p → ¬q).
3. A conditional statement is NOT logically equivalent to its converse or its inverse: (p → q) ≢ (q → p) and (p → q) ≢ (¬p → ¬q).

---

4. Predicate Logic, Quantifiers & Negation Duality

A predicate (or propositional function) P(x) is a statement containing one or more variables that becomes a formal proposition once the variables are bound by specific values from a designated domain of discourse (universe) U, or by quantifiers.

Universal and Existential Quantifiers

• Universal Quantifier (∀): The notation ∀x ∈ U, P(x) translates as "for all x in U, P(x) is true" or "for every x, P(x) holds." The universal statement is true if and only if P(x) is true for every individual element in domain U. If U is a finite set {x₁, x₂, …, xₙ}, universal quantification behaves as an iterated conjunction: ∀x P(x) ≡ P(x₁) ∧ P(x₂) ∧ … ∧ P(xₙ)
• Existential Quantifier (∃): The notation ∃x ∈ U, P(x) translates as "there exists an x in U such that P(x) is true" or "for at least one x, P(x) holds." The existential statement is true if there is at least one witness c ∈ U for which P(c) is true. Over a finite domain U, existential quantification behaves as an iterated disjunction: ∃x P(x) ≡ P(x₁) ∨ P(x₂) ∨ … ∨ P(xₙ)

Negation of Quantified Statements (Duality Principle)

Applying De Morgan's Laws to the iterated conjunctions and disjunctions of finite domains illuminates the fundamental duality rules for negating quantifiers in predicate logic: ¬(∀x P(x)) ≡ ∃x ¬P(x) ¬(∃x P(x)) ≡ ∀x ¬P(x)

1. Negating a Universal Claim: To negate "Every quadratic equation has two real roots" (∀q, R(q)), one does not assert that "No quadratic equations have real roots." Rather, the negation asserts: "There exists at least one quadratic equation that does not have two real roots" (∃q, ¬R(q)). A single counterexample (e.g., x² + 1 = 0) definitively establishes the negation.
2. Negating an Existential Claim: To negate "There exists an even prime number" (∃x, P(x)), one must establish that "For all numbers x, x is not an even prime" (∀x, ¬P(x)).

Order Dependence with Nested Quantifiers

When propositions involve multiple variables, the sequence of quantifiers is critical. While identical quantifiers commute (∀x ∀y P(x, y) ≡ ∀y ∀x P(x, y) and ∃x ∃y P(x, y) ≡ ∃y ∃x P(x, y)), mixed quantifiers do NOT commute: ∀x ∃y Q(x, y) ≢ ∃y ∀x Q(x, y)

• ∀x ∈ ℝ, ∃y ∈ ℝ, (x + y = 0): "For every real number x, there exists an additive inverse y." This is True (choose y = -x, which depends on x).
• ∃y ∈ ℝ, ∀x ∈ ℝ, (x + y = 0): "There exists a single universal real number y such that for every real number x, x + y = 0." This is False (no single number serves as the inverse for all numbers simultaneously).

In secondary calculus, this structural distinction separates pointwise continuity from uniform continuity on an interval.

---

5. Secondary Pedagogical Strategies & Diagnostic Error Analysis

Accomplished high school mathematics teachers systematically diagnose deductive reasoning flaws and deploy targeted structural interventions:

Fallacy 1: Affirming the Consequent (The Fallacy of the Converse)

Students frequently treat a valid conditional p → q as if its converse q → p were automatically true:

• Student Reasoning: "Theorem: If a quadrilateral is a rhombus (p), then its diagonals are perpendicular (q). Quadrilateral ABCD has perpendicular diagonals (q). Therefore, ABCD must be a rhombus (p)."
• Teacher Diagnostic: The student has observed the consequent q and erroneously inferred the antecedent p, confusing implication with equivalence. The argument ((p → q) ∧ q) ⟹ p is invalid.
• Pedagogical Intervention: Have students draw an explicit counterexample: a kite with perpendicular diagonals of lengths 4 and 8 intersecting at (0, 2) where adjacent sides are not all congruent, or a generic non-symmetric quadrilateral with perpendicular diagonals. Reinforce using Euler/Venn diagrams: the set of rhombuses is a proper subset of quadrilaterals with perpendicular diagonals (A ⊂ B does not imply B ⊂ A).

Fallacy 2: Denying the Antecedent (The Fallacy of the Inverse)

Students assume that if the hypothesis fails, the conclusion must fail:

• Student Reasoning: "If a polygon is a regular hexagon, the sum of its interior angles is 720°. Polygon P is not a regular hexagon. Therefore, the sum of its interior angles is not 720°."
• Teacher Diagnostic: The argument ((p → q) ∧ ¬p) ⟹ ¬q is invalid. An irregular hexagon also possesses an interior angle sum of (6 - 2) × 180° = 720°.
• Pedagogical Intervention: Map the argument onto the truth table for p → q. When p = F, the conditional is satisfied regardless of whether q is T or F. Emphasize that a conditional specifies what happens when p is met, asserting nothing about what happens when p fails.

Fallacy 3: Incorrect Negation of Universal and Existential Quantifiers

Secondary students frequently over-negate universal statements due to colloquial English linguistic interference:

• Student Reasoning: When asked to write the negation of "All students scored above 80 on the exam," a student writes: "All students scored 80 or below" or "No students scored above 80."
• Teacher Diagnostic: The student has conflated the logical negation ¬(∀x P(x)) ≡ ∃x ¬P(x) with the universal opposite ∀x ¬P(x). In natural speech, "all... not" is often used ambiguously to mean "not all," creating cognitive dissonance.
• Pedagogical Intervention: Frame negation around the minimal condition required to falsify a claim. Ask: "Imagine someone claims to you that every student scored above 80. What is the absolute bare minimum evidence you need to prove them wrong?" Students recognize that they do not need to show the entire class failed; producing just one student with a score of 74 destroys the claim.