MR%28B%299+2026

Administrative and Course Information

  • Course: Mathematical Reasoning 2026
  • Instructor: Vivek Tewary
  • Date: 18 August 2026
  • Section: Section B
  • Topic: 9. Logic III

Fundamental Logical Laws and Equivalences

  • De Morgan's Laws:

    • Negation of Conjunction (AND):¬(P∧Q)≡(¬P∨¬Q)\neg (P \land Q) \equiv (\neg P \lor \neg Q)
      • Rule: "And" transforms to "Or" under negation, accompanied by the negation of both component statements.
    • Negation of Disjunction (OR):¬(P∨Q)≡(¬P∧¬Q)\neg (P \lor Q) \equiv (\neg P \land \neg Q)
      • Rule: "Or" transforms to "And" under negation, accompanied by the negation of both component statements.
  • Commutativity:

    • P∨Q≡Q∨PP \lor Q \equiv Q \lor P
    • P∧Q≡Q∧PP \land Q \equiv Q \land P
  • Associativity:

    • P∨(Q∨R)≡(P∨Q)∨RP \lor (Q \lor R) \equiv (P \lor Q) \lor R
    • P∧(Q∧R)≡(P∧Q)∧RP \land (Q \land R) \equiv (P \land Q) \land R
  • Distributivity:

    • P∧(Q∨R)≡(P∧Q)∨(P∧R)P \land (Q \lor R) \equiv (P \land Q) \lor (P \land R)
    • P∨(Q∧R)≡(P∨Q)∧(P∨R)P \lor (Q \land R) \equiv (P \lor Q) \land (P \lor R)
  • Equivalences Involving Conditionals:

    • P  ⟹  Q≡¬P∨QP \implies Q \equiv \neg P \lor Q
    • ¬(P  ⟹  Q)≡P∧¬Q\neg (P \implies Q) \equiv P \land \neg Q
    • P  ⟹  Q≡(¬Q  ⟹  ¬P)P \implies Q \equiv (\neg Q \implies \neg P)

Negation of Compound and Quantified Statements

  • Verification of ¬(P  ⟹  Q)≡P∧¬Q\neg (P \implies Q) \equiv P \land \neg Q:
    • Conceptual Foundation: The only scenario in which the conditional P  ⟹  QP \implies Q evaluates to false is when PP is true and QQ is false.
    • Truth Table Verification:
PPQQ¬Q\neg QP  ⟹  QP \implies Q¬(P  ⟹  Q)\neg (P \implies Q)P∧¬QP \land \neg Q
TTTTFFTTFFFF
TTFFTTFFTTTT
FFTTFFTTFFFF
FFFFTTTTFFFF
*   **Algebraic Proof:**

        ¬(P  ⟹  Q)≡¬(¬P∨Q)\neg (P \implies Q) \equiv \neg (\neg P \lor Q)≡¬(¬P)∧¬Q\equiv \neg (\neg P) \land \neg Q≡P∧¬Q\equiv P \land \neg Q

*   **Verbal Illustration:**
    *   Original Statement: "It is not the case that if it will rain, then I will get drenched."
    *   Logically Equivalent Statement: "It will rain and I will not get drenched."
  • Quantified Negation Examples:

    • Example 1:

      • Original Statement: "For every natural number xx, if xx is prime then xx is not rational."
      • Predicate Definition: Let P(x)P(x) denote "xx is prime."
      • Formal Representation: ∀x∈N,(P(x)  ⟹  (x∉Q))\forall x \in \mathbb{N}, (P(x) \implies (x \notin \mathbb{Q}))
      • Negation Formulation: ∃x∈N,(P(x)∧(x∈Q))\exists x \in \mathbb{N}, (P(x) \land (x \in \mathbb{Q}))
      • Verbal Negation: "There is a natural number xx such that xx is prime and it is rational."
    • Example 2:

      • Original Statement: "There is a real number aa for which a+x=xa + x = x for every real number xx"
      • Predicate Definition: Let P(a,x)P(a, x) denote "a+x=xa + x = x".
      • Formal Representation: ∃a∈R,(∀x∈R,P(a,x))\exists a \in \mathbb{R}, (\forall x \in \mathbb{R}, P(a, x))
      • Negation Formulation: ∀a∈R,(∃x∈R,¬P(a,x))\forall a \in \mathbb{R}, (\exists x \in \mathbb{R}, \neg P(a, x))
      • Verbal Negation: "For every real number aa, there is a real number xx such that a+x≠xa + x \neq x"
    • Example 3:

      • Original Statement: "If xx is a rational number and x>0x > 0, then tan⁡(x)\tan(x) is not a rational number."
      • Formal Representation: ∀x∈R,(((x∈Q)∧(x>0))  ⟹  (tan⁡(x)∉Q))\forall x \in \mathbb{R}, (((x \in \mathbb{Q}) \land (x > 0)) \implies (\tan(x) \notin \mathbb{Q}))
      • Negation Formulation: ∃x∈R,(((x∈Q)∧(x>0))∧(tan⁡(x)∈Q))\exists x \in \mathbb{R}, (((x \in \mathbb{Q}) \land (x > 0)) \land (\tan(x) \in \mathbb{Q}))
      • Verbal Negation: "There is a real number xx which is positive, rational and tan⁡(x)\tan(x) is also rational."
    • Example 4:

      • Original Statement: "For every prime number pp, there is another prime number qq with q>pq > p"
      • Domain Set Definition: Let P\mathbb{P} denote the set of all prime numbers.
      • Formal Representation: ∀p∈P,(∃q∈P,(q>p))\forall p \in \mathbb{P}, (\exists q \in \mathbb{P}, (q > p))
      • Negation Formulation: ∃p∈P,(∀q∈P,(q≤p))\exists p \in \mathbb{P}, (\forall q \in \mathbb{P}, (q \le p))
      • Verbal Negation: "There is a prime number pp such that all other prime numbers are not more than pp"

Converse and Contrapositive

  • Converse:

    • Definition: Given the conditional statement P  ⟹  QP \implies Q, the conditional statement Q  ⟹  PQ \implies P is called the converse.
    • Truth Value Relationship: The truth of the conditional statement does not imply the truth of its converse.
    • Real-World Example: While it is considered true that global warming is caused by methane, the converse (methane is caused by global warming) is not true.
  • Contrapositive:

    • Definition: Given the conditional statement P  ⟹  QP \implies Q, the conditional statement ¬Q  ⟹  ¬P\neg Q \implies \neg P is called the contrapositive.
    • Truth Value Relationship: The truth of a conditional statement is logically equivalent to the truth of its contrapositive.
    • Real-World Example: "If the sun is out, then it is hot" is logically equivalent to "If it is not hot, then the sun is not out."
  • Verification of Contrapositive Equivalence (P  ⟹  Q≡(¬Q  ⟹  ¬P)P \implies Q \equiv (\neg Q \implies \neg P)):

    • Truth Table Verification:

| PP | QQ | ¬P\neg P | ¬Q\neg Q | $$