Study Guide Logic
Study Guide Logic
1 argument that you must translate into the language of SL and then test for validity using a truth-table. If the argument is
invalid, you will need to provide an invalidating interpretation.
Part 1: T/F
Part 2: Symbolizations
Provide a scheme of abbreviation and symbolize each of the following statements making
sure to reveal as much logical structure as possible.
1. Sam will pass the test only if he studies and does not drink too much.
B: sam study
C: sam drinks
A ⊃ (B ● ~ C)
2. Neither Sam nor Bugs will pass the test unless the test is easy.
A: Sam will pass the test
B: Bugs will pass the test
C: The test is easy
(~A ● ~B) ∨ C
3. Elmer will pass the test if and only if Daffy does not distract him.
4. Trump will win the election if and only if the Supreme Court is corrupt and Americans are
asleep at the wheel.
A ≡ (B ● C)
5. Assuming Bill both studies and bribes the instructor, he will pass unless he fails to show up
for the final.
A: Bill studies
C: Bill passes
(A ● B) ⊃ (C v ~D)
Part 3: Indirect Truth Tables
Use the indirect truth table method to determine whether the following arguments are
valid or invalid. If an argument is invalid, please provide an invalidating interpretation:
Problem 1:
P ⊃ (L ∨ C) / ~C ∨ (O ⊃ ~P) / C ⊃ (O ∨ B) / B ⊃ Q / ~Q // (P ∨ C) ⊃ L
Invalid: P O L B C Q
FTFFTF
Problem 2:
R ⊃ (P ● C) / ~G ∨ (Q ● F) / (P ● Q) ⊃ ~S // (R ● G) ⊃ ~S - VALID
Use the indirect truth table method to determine whether the following set of statements is
consistent or inconsistent. If the statements are consistent, please provide an interpretation
that shows this:
Problem 1:
P ⊃ Q / (Q ∨ R) ⊃ ~S / W ⊃ (V ● S) / W ● ~P / ~R ≡ (V ∨ Q)
Consistent: P S Q W R V
FT FT F T
Problem 2:
(~P ∨ S) / Q ⊃ ~H / ~P ∨ (~S ∨ Q) / ~H ⊃ (P ● ~U) / P ≡ Q
Consistent: P S Q U
TTT F
Part 4: Proofs
Prove that the following arguments are valid using the method of natural
deduction. Argument 1:
1. P ⊃ Q
2. P ⊃ (Q ⊃ R)
3. (P ⊃ R) ⊃ S
4. ~(S ∨ T) // ∴ U
5. ~P V Q 1 - MI
6. ~P V ~~Q - 5 - DN
7. ~P ● Q 6 - DM
8. Q 7 - SIMP
9. Q V U - 8 - ADD
10. Q V ~~U 9. DN
11. Q ● U 10. DM
12. U 11- SIMP
Argument 2:
1. (P ⊃ Q) ∨ (R ⊃ S) // ∴ (P ⊃ S) ∨ (R ⊃ Q)
2. ~(P ⊃ S) ∨ (R ⊃ Q) AIP
3. ~(P ⊃ S) ● ~(R ⊃ Q) 2 - DM
4. ~~(P ⊃ S) ● ~(R ⊃ Q) 3 - DN
5. ~~(P ⊃ S) 4 - Simp
6. ~(P V S) 5 - MI
7. ~(P V ~~S) 6 - DN
8. ~P ● S 7 - DM
9. ~(P V S) 5 - MI
10. ~P ● ~S 9 - DM
11. S 8 - SIMP
12. ~S 10 - SIMP
13. S ● ~S 11,12 - CONJ
14. (P ⊃ S) ∨ (R ⊃ Q) 2-13, IP
Part 5:
Translate the following argument into the language of basic sentential logic, then test for
validity using a truth table. If the argument is valid, prove it using the method of natural
deduction.
1. If life is devoid of meaning, then true happiness is not attainable. Thus, true
happiness is not attainable, since even if life is not devoid of meaning, true happiness is
not attainable.
A⊃~B
~A⊃~B
… ~B
VALID because there is no case in which conclusion is false and premise is true.
2. Either Alfred will study for the final or stay up too late drinking. If Alfred stays up
too late drinking, then he will not be happy. If Alfred is not happy, then he did not
study for the final. Therefore, either Alfred is happy or he studied.
A∨B
B ⊃ ~C
~C ⊃~A
C∨A
This is INVALID A B C
F TF