Conditional statement: A statement of the form "If P, then Q" where P is the hypothesis and Q is the conclusion
Hypothesis: The "if" part of the conditional statement
Conclusion: The "then" part of the conditional statement
- Identify P (hypothesis) and Q (conclusion)
- Apply the logical rule: A conditional is false only when P is true and Q is false
- Truth table: If P is true and Q is true → conditional is true
- Truth table: If P is true and Q is false → conditional is false
- Truth table: If P is false → conditional is true regardless of Q
Hypothesis (P): "It rains"
Conclusion (Q): "The ground gets wet"
P is true (it rains), Q is true (ground is wet)
If P is true and Q is true → conditional is TRUE
P is true (it rains), Q is false (ground is dry)
If P is true and Q is false → conditional is FALSE
Both have P false (no rain), regardless of Q
When P is false → conditional is ALWAYS TRUE
| Scenario | P (Rain) | Q (Wet) | If P then Q |
|---|---|---|---|
| (a) Rain & Wet | True | True | True |
| (b) Rain & Dry | True | False | False |
| (c) No Rain & Wet | False | True | True |
| (d) No Rain & Dry | False | False | True |
(a) True, (b) False, (c) True, (d) True
• Conditional logic: A conditional is false only when hypothesis is true and conclusion is false
• Truth preservation: When hypothesis is false, the conditional is automatically true
• Logical analysis: Separate hypothesis from conclusion for evaluation
Logical conjunction (AND): A compound statement is true only when both parts are true
Truth table for AND: P ∧ Q is true only when both P and Q are true
P: "Today is Monday"
Q: "It is raining"
P ∧ Q is true only when both P and Q are true
If either P or Q (or both) is false, then P ∧ Q is false
(a) P = True, Q = True → P ∧ Q = True
(b) P = True, Q = False → P ∧ Q = False
(c) P = False, Q = True → P ∧ Q = False
(d) P = False, Q = False → P ∧ Q = False
| Scenario | P (Monday) | Q (Raining) | P ∧ Q |
|---|---|---|---|
| (a) Mon & Rain | True | True | True |
| (b) Mon & No Rain | True | False | False |
| (c) Not Mon & Rain | False | True | False |
| (d) Not Mon & No Rain | False | False | False |
(a) True, (b) False, (c) False, (d) False
• AND logic: Both statements must be true for the compound to be true
• Truth requirement: Only one false makes the entire compound false
• Conjunction principle: More restrictive than disjunction
Logical disjunction (OR): A compound statement is true when at least one part is true
Truth table for OR: P ∨ Q is false only when both P and Q are false
P: "I will study"
Q: "I will watch TV"
P ∨ Q is true when at least one of P or Q is true
P ∨ Q is false only when both P and Q are false
(a) P = True, Q = True → P ∨ Q = True
(b) P = True, Q = False → P ∨ Q = True
(c) P = False, Q = True → P ∨ Q = True
(d) P = False, Q = False → P ∨ Q = False
Only scenario (d) results in False because both components are false
| Scenario | P (Study) | Q (TV) | P ∨ Q |
|---|---|---|---|
| (a) Study & TV | True | True | True |
| (b) Study & No TV | True | False | True |
| (c) No Study & TV | False | True | True |
| (d) No Study & No TV | False | False | False |
(a) True, (b) True, (c) True, (d) False
• OR logic: At least one statement must be true for the compound to be true
• Truth flexibility: Only requires one true component
• Disjunction principle: Less restrictive than conjunction
Logical reasoning: Using valid arguments to reach conclusions based on given premises
Proposition: A statement that is either true or false
Truth value: Whether a proposition is true or false
- Identify propositions: Break complex statements into simple parts
- Recognize connectives: AND, OR, NOT, IF-THEN
- Apply logical rules: Use established truth tables
- Construct truth tables: For systematic analysis
- Verify conclusions: Check logical consistency
Negation: The opposite of a statement that has the opposite truth value
Universal quantifier negation: ¬(∀x, P(x)) ≡ ∃x, ¬P(x)
Existential quantifier negation: ¬(∃x, P(x)) ≡ ∀x, ¬P(x)
Original: "All birds can fly"
Negation: "Not all birds can fly" or "Some birds cannot fly"
Original: "Some cats are black"
Negation: "Not some cats are black" or "No cats are black"
Original: "No fish live on land"
Negation: "Some fish live on land"
Original: "Every student passed the exam"
Negation: "Not every student passed the exam" or "Some students did not pass"
Original (a) is false → Negation is true
Original (b) is true → Negation is false
Original (c) is true → Negation is false
Original (d) depends on context → Negation has opposite truth value
| Statement | Negation | Truth Value |
|---|---|---|
| All birds can fly | Some birds cannot fly | True |
| Some cats are black | No cats are black | False |
| No fish live on land | Some fish live on land | False |
| Every student passed | Some didn't pass | Context-dependent |
(a) Some birds cannot fly, (b) No cats are black, (c) Some fish live on land, (d) Some students did not pass
• Negation principle: Switch true to false and vice versa
• Quantifier rules: "All" becomes "not all" (some aren't)
• Contrapositive logic: Maintain logical equivalence
Logical deduction: Using given premises to eliminate possibilities systematically
Process of elimination: Removing impossible options until only valid ones remain
(1) Alex is not in the middle
(2) Carol is not on the right
(3) Ben is not on the left
Alex can be on the left or right, but not in the middle
Carol can be on the left or middle, but not on the right
Ben can be in the middle or right, but not on the left
Carol cannot be on the right, so Carol is on the left or middle
Ben cannot be on the left, so Ben is in the middle or right
Since Carol could be on the left, let's try that first
If Carol is on the left, Ben must be in the middle or right
Alex cannot be in the middle, so if Ben is in the middle, Alex must be on the right
This satisfies all constraints: Carol(left), Ben(middle), Alex(right)
From left to right: Carol, Ben, Alex
• Constraint satisfaction: All conditions must be met simultaneously
• Systematic elimination: Remove impossible combinations
• Logical inference: Draw conclusions from multiple premises
Proposition: A statement that is either true or false, but not both
Logical connective: Words like AND, OR, NOT that combine propositions
Truth table: A table showing all possible truth values of a logical expression
Valid argument: An argument where true premises guarantee a true conclusion
Sound argument: A valid argument with all true premises
- Proposition identification: Recognize statements that have truth values
- Connective recognition: Identify logical operators (AND, OR, NOT, IF-THEN)
- Structure analysis: Determine how propositions are connected
- Truth evaluation: Apply logical rules to determine truth values
- Reasoning validation: Check if conclusions follow logically from premises
• Law of non-contradiction: A statement cannot be both true and false
• Law of excluded middle: A statement is either true or false
• De Morgan's laws: ¬(P∧Q) ≡ ¬P∨¬Q and ¬(P∨Q) ≡ ¬P∧¬Q
• Modus ponens: If P→Q and P are true, then Q is true
• Modus tollens: If P→Q and ¬Q are true, then ¬P is true