Conditional Statement: "If p, then q" (p → q)
Converse: "If q, then p" (q → p)
Inverse: "If not p, then not q" (~p → ~q)
Contrapositive: "If not q, then not p" (~q → ~p)
- Identify the hypothesis (p) and conclusion (q)
- Form the converse by switching p and q
- Form the inverse by negating both p and q
- Form the contrapositive by switching and negating p and q
Hypothesis (p): A triangle has three congruent angles
Conclusion (q): It is equilateral
If a triangle has three congruent angles, then it is equilateral.
If a triangle is equilateral, then it has three congruent angles.
If a triangle does not have three congruent angles, then it is not equilateral.
If a triangle is not equilateral, then it does not have three congruent angles.
Original: TRUE (by definition of equilateral triangle)
Converse: TRUE (equilateral triangles have 60° angles)
Inverse: TRUE (contrapositive of the converse)
Contrapositive: TRUE (logically equivalent to original)
Inverse: If not 3 congruent angles, then not equilateral
Contrapositive: If not equilateral, then not 3 congruent angles
Converse: If a triangle is equilateral, then it has three congruent angles.
Inverse: If a triangle does not have three congruent angles, then it is not equilateral.
Contrapositive: If a triangle is not equilateral, then it does not have three congruent angles.
• Logical equivalence: A conditional and its contrapositive are logically equivalent
• Converse/inverse relationship: Converse and inverse are logically equivalent
• Truth preservation: Original and contrapositive have same truth value
| p (3 congruent angles) | q (equilateral) | p → q | q → p | ~p → ~q | ~q → ~p |
|---|---|---|---|---|---|
| T | T | T | T | T | T |
| T | F | F | T | F | T |
| F | T | T | F | T | F |
| F | F | T | T | T | T |
Biconditional Statement: "p if and only if q" (p ↔ q) means both p → q and q → p are true
p: A polygon is a square
q: It has four right angles and four congruent sides
If a polygon is a square, then it has four right angles and four congruent sides.
This is TRUE by definition of a square.
If a polygon has four right angles and four congruent sides, then it is a square.
This is TRUE because having four right angles makes it a rectangle, and having four congruent sides makes it a rhombus. A rectangle that is also a rhombus is a square.
Since both p → q and q → p are true, p ↔ q is true.
The biconditional statement is true because both conditions are met.
The statement is true. A polygon is a square if and only if it has four right angles and four congruent sides.
• Biconditional equivalence: p ↔ q is true when both p → q and q → p are true
• Definition verification: Check both directions of logical implication
• Geometric properties: Understand relationships between shapes and their defining characteristics
Logical operators: ∧ (and), ∨ (or), → (implies), ¬ (not)
Truth table: Shows all possible truth values for a logical expression
We have three variables: p, q, and r
Number of rows needed: 2³ = 8
Create columns for p, q, r, (p ∧ q), and (p ∧ q) → r
| p | q | r | p ∧ q | (p ∧ q) → r |
|---|---|---|---|---|
| T | T | T | T | T |
| T | T | F | T | F |
| T | F | T | F | T |
| T | F | F | F | T |
| F | T | T | F | T |
| F | T | F | F | T |
| F | F | T | F | T |
| F | F | F | F | T |
Looking at the truth table, (p ∧ q) → r is false only when:
p = T, q = T, and r = F
This makes sense: if both p and q are true, then for the implication to be true, r must also be true.
Remember: An implication p → q is false only when p is true and q is false.
So (p ∧ q) → r is false only when (p ∧ q) is true and r is false.
(p ∧ q) is true only when both p and q are true.
The statement (p ∧ q) → r is false only when p is true, q is true, and r is false.
• Implication rule: p → q is false only when p is true and q is false
• Conjunction rule: p ∧ q is true only when both p and q are true
• Truth table method: Systematically evaluate all possibilities
Logical reasoning: The process of using rational thinking to arrive at valid conclusions
Proposition: A statement that is either true or false
Conditional statement: An "if-then" statement of the form "if p then q"
Logical equivalence: Two statements that have the same truth values in all possible scenarios
- Identify propositions: Recognize the basic statements in the argument
- Determine logical structure: Identify the connectives and relationships
- Apply logical rules: Use established rules of inference
- Construct arguments: Build valid logical sequences
- Verify conclusions: Check the validity of the reasoning
- Identify fallacies: Detect common errors in reasoning
• Law of Contrapositive: p → q ≡ ¬q → ¬p
• De Morgan's Laws: ¬(p ∧ q) ≡ ¬p ∨ ¬q and ¬(p ∨ q) ≡ ¬p ∧ ¬q
• Commutative Laws: p ∧ q ≡ q ∧ p and p ∨ q ≡ q ∨ p
• Associative Laws: (p ∧ q) ∧ r ≡ p ∧ (q ∧ r) and (p ∨ q) ∨ r ≡ p ∨ (q ∨ r)
• Distributive Laws: p ∧ (q ∨ r) ≡ (p ∧ q) ∨ (p ∧ r) and p ∨ (q ∧ r) ≡ (p ∨ q) ∧ (p ∨ r)
Conjunction (∧): "and" - true only when both statements are true
Disjunction (∨): "or" - true when at least one statement is true
Negation (¬): "not" - reverses the truth value
Conditional (→): "if...then" - false only when antecedent is true and consequent is false
Biconditional (↔): "if and only if" - true when both statements have the same truth value
Deductive reasoning: Drawing specific conclusions from general principles or premises
Premise 1: If a triangle is equilateral, then it is isosceles. (p → q)
Premise 2: If a triangle is isosceles, then it has at least two congruent angles. (q → r)
Premise 3: Triangle ABC is equilateral. (p)
From p → q and p, we can conclude q.
Therefore: Triangle ABC is isosceles.
From q → r and q, we can conclude r.
Therefore: Triangle ABC has at least two congruent angles.
From p → q and q → r, we can conclude p → r (law of syllogism).
From p → r and p, we can conclude r (law of detachment).
Equilateral → Isosceles → At least two congruent angles
Triangle ABC is equilateral → Triangle ABC is isosceles → Triangle ABC has at least two congruent angles
By deductive reasoning, Triangle ABC has at least two congruent angles.
• Law of Detachment: If p → q and p are true, then q is true
• Law of Syllogism: If p → q and q → r are true, then p → r is true
• Logical chain: Build conclusions step by step from given premises
Logical fallacy: An error in reasoning that renders an argument invalid
Affirming the consequent: The fallacy of assuming (p → q) and q together imply p
Major premise: If a quadrilateral is a square, then it has four right angles. (p → q)
Minor premise: This quadrilateral has four right angles. (q)
Conclusion: Therefore, this quadrilateral is a square. (p)
Valid form: p → q, p ⊢ q (Modus Ponens)
Valid form: p → q, ¬q ⊢ ¬p (Modus Tollens)
Invalid form: p → q, q ⊢ p (Affirming the Consequent)
The argument follows the pattern: p → q, q ⊢ p
This is the fallacy of affirming the consequent.
A rectangle that is not a square also has four right angles.
So having four right angles does not necessarily mean the quadrilateral is a square.
Valid conclusion: We cannot determine if the quadrilateral is a square just from knowing it has four right angles.
To conclude it's a square, we would need additional information about side lengths.
The argument commits the fallacy of affirming the consequent. Having four right angles does not guarantee that a quadrilateral is a square.
• Affirming the Consequent: Invalid form: p → q, q ⊢ p
• Counterexample: Show that the conclusion doesn't always follow
• Logical validity: Only certain forms of inference preserve truth
Proposition: A declarative sentence that is either true or false, but not both. Example: "2 + 2 = 4" is a proposition (true).
Logical Connective: Words or symbols that combine propositions to form compound propositions. Examples: ∧ (and), ∨ (or), ¬ (not), → (implies), ↔ (if and only if).
Argument: A sequence of statements where the final statement (conclusion) follows from the preceding statements (premises).
Validity: An argument is valid if the conclusion follows logically from the premises, regardless of the truth of the premises.
- Translation: Convert verbal statements into symbolic form using logical operators
- Analysis: Examine the structure of arguments and identify logical patterns
- Evaluation: Determine the validity of arguments using truth tables or rules
- Construction: Build valid arguments using proper logical forms
- Verification: Check reasoning for common fallacies and errors
- Application: Use logical reasoning to solve mathematical and real-world problems
• Double Negation: ¬(¬p) ≡ p
• Contrapositive: p → q ≡ ¬q → ¬p
• De Morgan's Laws: ¬(p ∧ q) ≡ ¬p ∨ ¬q and ¬(p ∨ q) ≡ ¬p ∧ ¬q
• Implication: p → q ≡ ¬p ∨ q
• Biconditional: p ↔ q ≡ (p → q) ∧ (q → p)
• Exportation: (p ∧ q) → r ≡ p → (q → r)
Modus Ponens: p → q, p ⊢ q
Modus Tollens: p → q, ¬q ⊢ ¬p
Law of Syllogism: p → q, q → r ⊢ p → r
Disjunctive Syllogism: p ∨ q, ¬p ⊢ q
Conjunction: p, q ⊢ p ∧ q
• Affirming the Consequent: p → q, q ⊢ p
• Denying the Antecedent: p → q, ¬p ⊢ ¬q
• Circular Reasoning: Assuming the conclusion in the premises
• Hasty Generalization: Drawing broad conclusions from insufficient evidence
• False Dilemma: Presenting only two options when more exist