QUESTION 1: 4-1 Analyzing Arguments with Truth Tables
- (M V G) ⸫ H
H | M | G | M | V | G | ⸫ | H | |
T | T | T | T | T | T | T | ||
T | T | F | T | T | F | T | ||
T | F | T | F | T | T | T | ||
T | F | F | F | F | F | T | ||
F | T | T | T | T | T | F | ||
F | T | F | T | T | F | F | ||
F | F | T | F | T | T | F | ||
F | F | F | F | F | F | F |
Concerning question 1 and drawing from the table, the argument is invalid. In row 4 is an entirely false premise, whereas its conclusion is true.
Below is the table abbreviated from question 1.
H M G | M V G | ⸫ | H |
F T T | T T T | F | |
F | |||
F | |||
F |
QUESTION 2: 5-1 Journal: Direct Proofs in Natural Deduction
Choosing 1 and 4;
- ~M, (~M • ~N) → (Q → P), P → R, ~N, therefore, Q → R
- (S v U) • ~U, S → [T • (F v G)], [T v (J • P)] → (~B • E), therefore, S • ~B
Choosing Argument 1
- ~M
- (~M ~N) → (Q → P)
- P → R
- ~N
- (~M ~N) 1 and 4 Conjunction
- (Q → P) 2 and 5 Modus Ponens
- (Q → R) 6 and 3 HS
\ Conclusion – Q → R is a derivative of premises
M: I am attending the summit
N: Prince is attending the summit
Q: Lilian will attend the summit
P: Frank will attend the summit
R: Catherine will attend the summit
Argument 1 filled
I am not attending the summit. If I am not attending the summit and Prince is not attending the summit, then if Lilian is attending the summit, Frank will attend the summit. If Frank attends the summit, then Catherine will attend the summit. Prince is not attending the summit. I am not attending the summit, and Prince is not attending the summit. If Lilian attends the summit, then Frank will attend the summit. If Lilian attends the summit, then Catherine will attend the summit.
Choosing Argument 4
- (S v U) • ~U
- S → [T • (F v G)]
- [T v (J • P)] → (~B • E)
- ~U 1 Simplification Rule
- (S v U) 1 Simplification Rule
- S
- T • (F v G) 2 and 6 Simplification Rule
- T 7 Simplification Rule
- T v (J • P) 8 Addition Rule
- (~B • E) 3 and 9 Modus ponens
- ~B 10 Simplification Rule
- S • ~B 6 and 11 Conjunction
\ conclusion S • ~B is derived from the premises
S: My cow’s tag is Beto.
U: My cow’s tag is Trevin.
T: My dove’s tag is Joy.
F: My ugly beast’s tag is Trevin.
G: My chick’s tag is Kwikwi.
J: My worm’s tag is Canker.
P: My tortoise’s tag is Prince.
B: My python’s tag is Hearty.
E: My bear’s tag is Clarice.
Argument 4 – Filled Out
My cow’s tag is Beto or Trevin, but not Trevin. If my cow’s tag is Beto, then my dove’s tag is Joy, and my python’s tag is Hearty, or my chick’s tag is Kwikwi. If my dove’s tag is Joy or my worm’s tag is Canker, and my tortoise’s tag is Prince. My cow’s tag is not Trevin. My cow’s tag is Beto, or my cow’s tag is Trevin. My cow’s tag is Beto. My dove’s tag is Joy, and my ugly beast’s tag is Trevin, or my chick’s tag is Kwikwi. My dove’s tag is Joy. My dove’s tag is Joy, or my worm’s tag is Canker, and my tortoise’s tag is Prince. My python’s tag is not Hearty, and my bear’s tag is Clarice. My python’s tag is not Hearty. Therefore, my cow’s tag is Beto, and my python’s tag is not Hearty.
Question 3: 6-1 Journal: Indirect Proofs in Natural Deduction
- (G • P) → K, E → Z, ~P → ~ Z, G → (E v L), therefore, (G • ~L) → K
Conditional proof
1 | (G•P)àK | ||
2 | EàZ | ||
3 | ~Pà~Z | ||
4 | GàE v L | ||
∴ | (G•~L)àK | ||
5 | G•~L | The assumption for Conditional Proof | |
6 | G | 5 | Simplification |
7 | ~L | 5 | Simplification |
8 | E v L | 4, 6 | Modus Ponens |
9 | E | 7, 8 | Disjunctive Syllogism |
10 | Z | 2, 9 | Modus Ponens |
11 | ~~Z | 10 | Double Negation |
12 | ~~P | 3, 11 | Modus Tollens |
13 | P | 14 | Double Negation |
14 | G•P | 6, 13 | Conjunction |
15 | K | 1, 14 | Modus Ponens |
16 | (G•~L)àK | 5-15 | Conditional Proof |
If RAA was used for the proof, now CP will be used to replace it; if CP had been used earlier, now RAA will be used. Then, construct an alternative proof.
Reductio Ad Absurdum (Contradiction)
1 | (G•P)àK | ||
2 | EàZ | ||
3 | ~Pà~Z | ||
4 | GàE v L | ||
∴ | (G•~L)àK | ||
5 | ~[(G•~L)àK] | ||
6 | ~[~(G•~L) v K] | ||
7 | ~~(G•~L) •~K | ||
8 | (G•~L) •~K | ||
9 | ~K | ||
10 | G•~L | ||
11 | G | ||
12 | ~L | ||
13 | E v L | ||
14 | E | ||
15 | Z | ||
16 | ~~Z | ||
17 | ~~P | ||
18 | P | ||
19 | G•P | ||
20 | K | ||
21 | K•~K | ||
22 |
Question 4: 7-1 Journal: Basic Predicate Logic
Problem 1.
(x)(Fx → Sx), (x)(Rx → Sx) ∴ (x)(Fx → Rx)
- (x)(Fx → Sx) (premise)
- (x)(Rx → Sx) (premise)
∴ (x)(Fx → Rx) (conclusion)
- Fa (CP)
- Fa → Sa 1, UO
- Ra → Sa 2, UO
- Sa →Ra 5, CN
- Fa →Ra 4, 6 CH
- (x)(Fx → Rx) 7, UI
Proof and symbolization
The Peloponnesian War is a familiar thing to every historian. Familiarization with the Peloponnesian War can result in dominance in a conversation. Hence, every historian can gain dominance over a conversation.
(x)(Hx → Fx), (x)(Fx → Dx) |- (x)(Hx → Dx)
- (x)(Hx → Fx) P
- (x)(Fx → Dx) P – want (x)(Hx → Dx)
- Ha* → Fa* 1 UO
- Fa* → Da* 2 UO
- Ha* → Da* 3,4 CH
- (x)(Hx → Dx)
References
Howard-Snyder, D., Howard-Snyder, F., & Wasserman, R. (2020). The power of logic.