Comprehensive Study Guide to Logic and Statements

Fundamentals of Logic and Statements

  • Definition of Logic: Logic is the study of methods and principles used to distinguish correct from incorrect arguments and reasoning.
  • Statement: A statement is a declarative sentence for which it is meaningful to say it is either true (TT) or false (FF).
    • Statements are typically represented by lowercase letters such as pp, qq, and rr.
  • Logical Value (LV): The truth or falsity of a statement is referred to as its logical value (or truth value).
    • Example 1: Statement pp: 2+2=42 + 2 = 4. Logical Value: TT.
    • Example 2: Statement qq: Every prime number is odd. Logical Value: FF (Note: the number 2 is a prime number and is even).
    • Example 3: Statement rr: There is a real number xx such that x2+1=0x^{2} + 1 = 0. Logical Value: FF (The solutions for x2=1x^{2} = -1 are imaginary numbers, not real numbers).

Categorical Statements

  • Description: A categorical statement expresses a relationship between two categories or sets: the subject set (SS) and the predicate set (PP).
  • The Four Types of Categorical Statements:
    1. All S are P: This indicates that every member of the subject set is also a member of the predicate set.
    2. No S are P: This indicates that the subject set and the predicate set have no members in common; they are disjoint.
    3. Some S are P: This indicates that there is at least one member of set SS that is also a member of set PP.
    4. Some S are not P: This indicates that there is at least one member of set SS that is not a member of set PP.

Negation of Statements

  • Definition of Negation: The negation of a statement is any statement that is false if and only if the original statement is true. A statement and its negation always have opposite truth values.
  • Symbolism: The symbol \sim is used for negation. The expression p\sim p is read as "not pp."
    • If pp is true, then p\sim p is false.
    • If pp is false, then p\sim p is true.
  • Examples of Negation Truth Values:
    • Statement pp: 2+2=42 + 2 = 4 (LV: TT). Negation p\sim p: 2+242 + 2 \neq 4 (LV: FF).
    • Statement qq: Every prime number is odd (LV: FF). Negation q\sim q: It is not true that every prime number is odd (LV: TT).
    • Statement rr: There is a real number xx such that x2+1=0x^{2} + 1 = 0 (LV: FF). Negation r\sim r: There is no real number xx such that x2+1=0x^{2} + 1 = 0 (LV: TT).
  • Negation of Quantified Statements:
    • Negation of All: If a statement claims "All objects of a certain type have a particular property," its negation asserts that "at least one of those objects does not have the property."
      • Example: pp: All roses are red. p\sim p: There is at least one rose that is not red.
    • Negation of Some: If a statement claims "Some object of a certain type has a particular property," its negation asserts that "none of those objects has the property."
      • Example: pp: Some roses are red. p\sim p: No roses are red.

Logical Operations and Notation

  • Summary Table of Notations:
    • Negation: Meaning: "not". Symbol: \sim.
    • Conjunction: Meaning: "and". Symbols: \bullet or \wedge.
    • Disjunction: Meaning: "or". Symbol: \vee.
    • Conditional: Meaning: "if…then". Symbol: \rightarrow.
    • Biconditional: Meaning: "if and only if". Symbol: \leftrightarrow.
  • Specific Negation Rules:
    • Statement: AA or BB. Negation: not AA and not BB.
    • Statement: AA and BB. Negation: Not AA or not BB.
    • Statement: If AA, then BB. Negation: AA and not BB.

Conditional Statements

  • Definition: A conditional statement is a sentence of the form "if pp, then qq," where pp and qq are given statements.
  • Symbolic Form: pqp \rightarrow q (read as "pp implies qq").
  • Example:
    • pp: xx is divisible by 4.
    • qq: xx is even.
    • pqp \rightarrow q: If xx is divisible by 4, then xx is even.

Variations of Conditional Statements

Given a conditional statement pqp \rightarrow q, the following variations can be formed:

  • Converse: qpq \rightarrow p (If qq, then pp).
  • Inverse: pq\sim p \rightarrow \sim q (If not pp, then not qq).
  • Contrapositive: qp\sim q \rightarrow \sim p (If not qq, then not pp).
  • Example 1: Divisibility:
    • Conditional: If xx is divisible by 4, then xx is even.
    • Converse: If xx is even, then xx is divisible by 4.
    • Inverse: If xx is not divisible by 4, then xx is not even.
    • Contrapositive: If xx is not even, then xx is not divisible by 4.
  • Example 2: Geometry:
    • Conditional: If a quadrilateral is a rectangle, then it has two pairs of parallel sides.
    • Converse: If a quadrilateral has two pairs of parallel sides, then it is a rectangle.
    • Inverse: If a quadrilateral is not a rectangle, then it does not have two pairs of parallel sides.
    • Contrapositive: If a quadrilateral does not have two pairs of parallel sides, then it is not a rectangle.

Logical Equivalence and Biconditionals

  • Logical Equivalence:
    • A conditional statement is logically equivalent to its contrapositive. Either both statements are true, or both are false.
    • The converse and inverse of a conditional statement are logically equivalent to each other. Either both are true, or both are false.
    • Truth Value Case Study:
      • Conditional (pqp \rightarrow q): If xx is divisible by 4, then xx is even. (Logical Value: TT).
      • Contrapositive (qp\sim q \rightarrow \sim p): If xx is not even, then xx is not divisible by 4. (Logical Value: TT).
      • Converse (qpq \rightarrow p): If xx is even, then xx is divisible by 4. (Logical Value: FF, e.g., x=6x=6).
      • Inverse (pq\sim p \rightarrow \sim q): If xx is not divisible by 4, then xx is not even. (Logical Value: FF, e.g., x=6x=6).
  • Biconditional Statements:
    • Definition: A biconditional is a combination of a conditional and its converse. It is expressed as "pp if and only if qq."
    • Symbolic Form: pqp \leftrightarrow q.
    • Truth Values:
      • A biconditional statement is true when both its conditional (pqp \rightarrow q) and converse (qpq \rightarrow p) are true.
      • A biconditional statement is false when either its conditional or its converse (or both) are false.
    • Example:
      • Conditional: If xx is divisible by 4, then xx is even. (TT).
      • Converse: If xx is even, then xx is divisible by 4. (FF).
      • Biconditional: xx is divisible by 4 if and only if xx is even. (Logical Value: FF).