Logic Review
description
Transcript of Logic Review
![Page 1: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/1.jpg)
Logic Review
![Page 2: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/2.jpg)
FORMAT
![Page 3: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/3.jpg)
Format
Part I• 30 questions• 2.5 marks each• Total 30 x 2.5 = 75 marksPart II• 10 questions• Answer only 5 of them!• Total 5 x 5 marks each = 25 marks
![Page 4: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/4.jpg)
Part I
The questions in Part I are multiple choice.
About 8-10 out of the questions in Part I (30 total) are about argument analysis and logic. ~20-25% of the total marks.
![Page 5: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/5.jpg)
Part II
Part II contains mostly logic questions, about 9 out of 10.
You are only required to answer 5 of the 10 questions. If you answer more than 5, I will only mark the first 5.
Part II is much harder than Part I.
![Page 6: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/6.jpg)
LOGICAL CONCEPTS
![Page 7: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/7.jpg)
Logical Concepts on the Final
About 6/30 multiple choice questions deal with argument analysis (identification of premises and conclusions) and logical concepts (validity, soundness, logical equivalence, etc.).
Therefore mastering these concepts can go a long way toward the grade you get on the Final, up to about 15%.
![Page 8: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/8.jpg)
What to Study
• Read Joe Lau’s modules on Argument Analysis and Meaning Analysis (recommended reading, Week 14).
• Read the powerpoint slides from 25/4• Read the logic slides in Week 5.
![Page 9: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/9.jpg)
Arguments
Arguments (in philosophy) are a collection of premises (possibly zero) given in support of a conclusion.
![Page 10: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/10.jpg)
Argument Analysis
You will be asked to identify premises and conclusions in questions, and to identify hidden assumptions.
These questions are not hard if you think about them and know the ideas.
![Page 11: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/11.jpg)
Validity
To say that an argument is valid is to say:
If all of the premises of the argument are true, then the conclusion must be true.
![Page 12: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/12.jpg)
Validity
For the final you should memorize the definition of validity. Furthermore, you should be able to answer some basic questions about the definition.
![Page 13: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/13.jpg)
Examples
Can a valid argument have false premises?
Can it have a true conclusion?
Can it have false premises and a false conclusion?
Can it have true premises and a false conclusion?
![Page 14: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/14.jpg)
Inductive Validity
You need to know the definition of inductively valid/ inductively strong arguments. First: inductively valid = inductively strong.
An argument is inductively strong if when all the premises are true, the conclusion is very likely to be true (has a high probability of being true).
![Page 15: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/15.jpg)
Note
If the final asks you about a “valid argument” assume that it means “deductively valid argument.” We will always say “inductively valid (strong)” when we mean that.
![Page 16: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/16.jpg)
Logical Equivalence
Two sentences A and B are logically equivalent when A├ B and B├ A.
In other words, A and B are logically equivalent when “A therefore B” and “B therefore A” are both valid arguments.
In other words A is true if and only if B is true.
![Page 17: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/17.jpg)
Soundness
To say that an argument is sound is to say:
The argument is valid AND it has true premises.
You need to memorize this definition and be able to answer some basic questions about it. Can a sound argument have a false conclusion? Etc.
![Page 18: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/18.jpg)
SENTENTIAL LOGIC
![Page 19: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/19.jpg)
SL on the Final
There aren’t a lot of multiple choice questions about SL (there are only 30 questions total), but there are several short answer questions (Part II) that involve (or can involve) SL.
Knowing SL perfectly can count for up to about 20% of the marks on the final.
![Page 20: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/20.jpg)
What to Study
• Read Joe Lau’s Sentential Logic Module (on the readings list for Week 5).
• Read all the powerpoint slides from Weeks 5 and 6.
If you know all that material, you are as well prepared for the logic questions as you can be.
![Page 21: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/21.jpg)
Difficulty
Some of the questions are hard, and even made me stop and think about them.
They are supposed to be like that.
Difficult questions help differentiate students. The exam will be curved and the same number of students will get A’s in this class as in any other class.
![Page 22: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/22.jpg)
Proofs
There are two proofs on the optional section. They are not easy, but if you are good at proofs, you might consider answering them.
If you don’t like proofs don’t bother studying them. You can always choose 5 questions on Part II that do not involve proofs.
![Page 23: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/23.jpg)
Translations
You need to memorize the standard translations for the logical connectives into English, both because you will be asked questions about which English sentence translates some predicate logic sentence and because you will be asked which predicate logic sentence translates some English sentence.
![Page 24: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/24.jpg)
Standard Translations
~A: not A, A is false, A is not true, it’s not the case that A(A & B): A and B, A but B, although A, B(~A & ~B): neither A nor B(A v B): A or B, A unless B(A → B): if A then B, A only if B, B if A(A ↔ B): A if and only if B
![Page 25: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/25.jpg)
“If” and “Only if”
The most difficult part of translations is “if” and “only if” and “if and only if”
“If A then B” “A only if B” “B if A”: (A → B)“If B then A” “B only if A” “A if B”: (B → A)“A if and only if B” “B if and only if A”: (A ↔ B)
![Page 26: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/26.jpg)
Example Problem
(((P v Q) v R) → (S v (T & U)))…
a. …is true if S is trueb. …is true if T and U are falsec. …is true if R is falsed. …is false only if S is false
![Page 27: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/27.jpg)
Truth-Table Won’t Work
This seems like a hard problem at first sight.
A truth-table would take too much time to construct. It would have to have 2 x 2 x 2 x 2 x 2 x 2 = 64 rows!
Let’s consider it intelligently.
![Page 28: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/28.jpg)
True Conditionals
When is (((P v Q) v R) → (S v (T & U))) true?
It’s a conditional, so it’s true whenever either
• ((P v Q) v R) is false• Or (S v (T & U)) is true
![Page 29: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/29.jpg)
The Material Conditional
φ ψ (φ → ψ)T T TT F FF T TF F T
![Page 30: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/30.jpg)
False Conditionals
Additionally (((P v Q) v R) → (S v (T & U))) is false when:
• ((P v Q) v R) is true• And (S v (T & U)) is false
![Page 31: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/31.jpg)
Example Problem
(((P v Q) v R) → (S v (T & U)))…
a. …is true if S is trueb. …is true if T and U are falsec. …is true if R is falsed. …is false only if S is false
![Page 32: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/32.jpg)
Disjunction
If S is true, then (S v (T & U)) is true, because disjunctions are true when either disjunct is true.
![Page 33: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/33.jpg)
Disjunction
φ ψ (φ v ψ)T T TT F TF T TF F F
![Page 34: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/34.jpg)
Not (a)
So if S is true, (S v (T & U)) is true.
But then (((P v Q) v R) → (S v (T & U))) could be false, if ((P v Q) v R) is false.
So (a) is not the right answer.
![Page 35: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/35.jpg)
Example Problem
(((P v Q) v R) → (S v (T & U)))…
a. …is true if S is trueb. …is true if T and U are falsec. …is true if R is falsed. …is false only if S is false
![Page 36: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/36.jpg)
Not (b)
If T and U are false, then (T & U) is false.
But this tells us nothing about whether (S v (T & U) is true or false, because if S is false, it is false and if S is true it is true.
Therefore we don’t know whether (((P v Q) v R) → (S v (T & U))) is true or false. So (b) is wrong.
![Page 37: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/37.jpg)
Example Problem
(((P v Q) v R) → (S v (T & U)))…
a. …is true if S is trueb. …is true if T and U are falsec. …is true if R is falsed. …is false only if S is false
![Page 38: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/38.jpg)
Not (c)
If R is false, then ((P v Q) v R) can be either true or false. For example, it will be true if P is true or if Q is true, and only false when P and Q are both false.
Assuming R is false, ((P v Q) v R) might be true, and therefore the whole sentence could be false (antecedent true, consequent false).
![Page 39: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/39.jpg)
Example Problem
(((P v Q) v R) → (S v (T & U)))…
a. …is true if S is trueb. …is true if T and U are falsec. …is true if R is falsed. …is false only if S is false
![Page 40: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/40.jpg)
Why (d)?
By process of elimination, you know the answer is (d). But why is it the right one?
“A only if B” means if A, then B.
(((P v Q) v R) → (S v (T & U))) is false only if S is falseIf (((P v Q) v R) → (S v (T & U))) is false, then S is false.
![Page 41: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/41.jpg)
Why (d)?
If (((P v Q) v R) → (S v (T & U))) is falseThen ((P v Q) v R) is trueAnd (S v (T & U)) is false.
If (S v (T & U)) is false then(T & U) is falseAnd S is false.
![Page 42: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/42.jpg)
Example Problem 2
Use a truth-table to determine whether a logically entails b.
a. (A & B) b. ~(~A v ~B)
![Page 43: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/43.jpg)
Make Truth-Table for (A & B)
A B (A & B)T TT FF TF F
![Page 44: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/44.jpg)
Copy A, B
A B (A & B)T TT FF TF F
![Page 45: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/45.jpg)
Copy A, B
A B (A & B)T T T TT F T FF T F TF F F F
![Page 46: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/46.jpg)
Use TT for &
A B (A & B)T T T TT F T FF T F TF F F F
![Page 47: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/47.jpg)
Use TT for &
A B (A & B)T T T T TT F T F FF T F F TF F F F F
![Page 48: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/48.jpg)
Now Make TT for ~(~A v ~B)
A B ~ (~ A v ~ B)T TT FF TF F
![Page 49: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/49.jpg)
Copy A, B
A B ~ (~ A v ~ B)T TT FF TF F
![Page 50: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/50.jpg)
Copy A, B
A B ~ (~ A v ~ B)T T T TT F T FF T F TF F F F
![Page 51: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/51.jpg)
Use TT for ~
A B ~ (~ A v ~ B)T T T TT F T FF T F TF F F F
![Page 52: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/52.jpg)
Use TT for ~
A B ~ (~ A v ~ B)T T F T F TT F F T T FF T T F F TF F T F T F
![Page 53: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/53.jpg)
Use TT for v
A B ~ (~ A v ~ B)T T F T F TT F F T T FF T T F F TF F T F T F
![Page 54: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/54.jpg)
Use TT for v
A B ~ (~ A v ~ B)T T F T F F TT F F T T T FF T T F T F TF F T F T T F
![Page 55: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/55.jpg)
Use TT for ~
A B ~ (~ A v ~ B)T T F T F F TT F F T T T FF T T F T F TF F T F T T F
![Page 56: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/56.jpg)
Use TT for ~
A B ~ (~ A v ~ B)T T T F T F F TT F F F T T T FF T F T F T F TF F F T F T T F
![Page 57: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/57.jpg)
Truth-Table Test
Now we can do the truth-table test for validity. Remember that an argument is valid when IF the premises are true, THEN the conclusion is true.
![Page 58: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/58.jpg)
Write Down Possibilities
A BT TT FF TF F
![Page 59: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/59.jpg)
Write Down TT for Premises
A B (A & B)T T TT F FF T FF F F
![Page 60: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/60.jpg)
Write Down TT for Conclusion
A B (A & B) ~(~A v ~B)T T T TT F F FF T F FF F F F
![Page 61: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/61.jpg)
Make Sure Conclusion T when Premises T
A B (A & B) ~(~A v ~B)T T T TT F F* FF T F* FF F F* F
![Page 62: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/62.jpg)
Consistency
A set of sentences is consistent if all of the sentences can be true at the same time. (Some or all of them might in fact be false, but they all CAN be true together).
A set of sentences is inconsistent if they CANNOT all be true at the same time.
![Page 63: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/63.jpg)
Example Problem #3
Consider the following three sentences.
1. Sam will be sad unless we come to his party.2. We will come to Sam’s party if and only if there is food.3. Sam won’t have food at the party.
Are they logically consistent all together?
![Page 64: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/64.jpg)
Using SL
Translate:
S = Sam is sadC = We come to Sam’s partyF = There is food at the party
![Page 65: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/65.jpg)
Using SL
Translate:
1. (S v C)2. (C ↔ F)3. ~F
![Page 66: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/66.jpg)
SolutionS C F (S v C) (C ↔ F) ~FT T T T T FT T F T F TT F T T F FT F F T T TF T T T T FF T F T F TF F T F F FF F F F T T
![Page 67: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/67.jpg)
SolutionS C F (S v C) (C ↔ F) ~FT T T T T F*T T F T F* TT F T T F* F*T F F T T TF T T T T F*F T F T F* TF F T F* F* F*F F F F* T T
![Page 68: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/68.jpg)
Proofs
I advise you to avoid the proofs unless you are already pretty confident about your ability to do them.
Advance warning: the two optional proofs both involve using ~I or ~E. These rules are tricky, so if you plan on considering the proofs, commit them to memory.
![Page 69: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/69.jpg)
~I (Negation Introduction)
If you have assumed ψ, and you have derived (φ&~φ),
then you can write down ~ψ,
depending on everything (φ&~φ) depends on except ψ.
![Page 70: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/70.jpg)
(P v P) ├ P
1 1. (P v P) A2 2. ~P A (for ~E)1,2 3. P 1 vE1,2 4. (P & ~P) 2,3 &I2 5. P 2,4 ~E
![Page 71: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/71.jpg)
PREDICATE LOGIC
![Page 72: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/72.jpg)
Predicate Logic on the Final
There are fewer predicate logic questions on the final than SL questions. About 2 multiple choice and 2 short answer. So between 5% and 15% of your grade, depending on which questions you choose on the short answer.
![Page 73: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/73.jpg)
What to Study
• The lecture slides on predicate logic.• Joe Lau’s module on predicate logic, especially
PL02 Quantifiers.
The predicate logic questions are surprisingly not as difficult as you would think, so studying PL is a good investment.
![Page 74: Logic Review](https://reader035.fdocuments.in/reader035/viewer/2022062520/568161ec550346895dd21f78/html5/thumbnails/74.jpg)
Equivalences
I’d highly recommend committing to memory these very easy-to-remember logical equivalences: • ∀yDy ≡ ~ y~Dy∃• ~ yDy ≡ y~Dy∀ ∃• ∀y~Dy ≡ ~ yDy∃• ~ y~Dy ≡ yDy∀ ∃