PHILOSOPHY 220 NOTES

1/13/2013 7:31:00 PM

#@$4 Week 1 (Starting Mon 31 Dec 2012) Topics o Course introduction. o UBC Connect course website. o Symbolic logic and logical concepts. Tasks o Read LPL2 Introduction p 1-5 CH2.SEC0-1.P41-44 (argument, validity, logical consequence concepts) CH4.SEC1.P94 (first 3 paragraphs logical truth concept) CH4.SEC2.P106 (first 2 paragraphs logical equivalence concept) Exercise 11.5 (logical independence concept) CH5.SEC3.P138 (3rd & 2nd last paragraphs) CH5.SEC4.P141-142 (contradiction/inconsistency concept)

o Read LM Unit1.SEC1.SEC2.SEC3.SEC4 Do o UBC Connect Assessments Course Orientation Exercise Exercises 1.3.1, 1.3.2, 1.4 Week 2 (Starting Mon 07 Jan 2013) Topics1 o Tarski Artificial language and worlds o Other logic languages and worlds Tasks1 o Read LPL2 CH1.SEC0-4.P19-31 CH1.SEC7.P38-39 Introduction Page 5-11 (Gradegrinder) o Read LM

Unit2.SEC1

Do1 o Gradegrinder: LPL2 Exercises 1.3, 1.4, 1.5 o UBC Connect Assessments The Bonus Survey Topics2 o Artificial logic languages (eg Tarski logic languages) truthfunctional operators Tasks2 o Read LPL2 CH3.SEC0-4.P67-77 (skip game rule for NOT P69) (skip game rule for AND P72) (skip game rule for OR P75-76) CH3.SEC5-6.P79-84 CH7.SEC0-2.P178-189 (skip game rule for IF P180) (skip game rule for IFF P185) CH7.SEC4.P192-198 o Read LM Unit2.SEC2

Do2 o Gradegrinder LPL2 Exercises 3.2, 3.3, 3.7, 3.10, 3.13, 3.18, 7.10 (ignore play the game in 7.10), 7.16, 7.17, 7.25 Topics3 o Artificial logic languages (eg Tarski logic language) quantifiers Tasks3 o Read LPL2 CH9.SEC0-2.P229-233 CH9.SEC4-5.P237-245 (skip game rules quantifiers P239-241) o Read LM Unit2.SEC3 Do3 o Gradegrinder LPL2 Exercises 9.5, 9.6

Week 3 (Starting Mon 14 Jan) Topics1 o Artificial logic languages (eg Tarski logic language) quantifiers Tasks1 o Read LPL2 CH10.SEC3-4.P279-286 (starting at De Morgan for quantifiers) CH11.SEC0-2.P298-306 CH11.SEC7.P320-324 o Read about Truth-functional expansions o Read LM Unit2.SEC5.SEC6.SEC8 Do1 o Gradegrinder LPL2 Exercises 9.9, 9.14, 10.22, 11.2, 11.3, 11.9, 11.10, 11.12, 11.38 o UBC Connect Assessments Exercises 2.5, 2.6, 2.8 Topics2 o Syntax Tarski logic language and other logic languages o Legal strings and formulas o Free variables o Sentences vs wffs o Main logic operator Tasks2 o Read LPL2 CH9.SEC3.P233-236 o Read LM Unit3.SEC1-5.SEC7-8 Do2 o Nothing

Week 4 (Starting Mon 21 Jan) Topics1 o Syntax Tarski logic language and other logic languages o Legal strings and formulas

o Free variables o Sentences vs wffs o Main logic operator Tasks1 o Read LPL2 CH9.SEC3.P233-236 o Read LM Unit3.SEC1-5.SEC7-8 Do1 o UBC Connect Assessments Exercises 3.2, 3.3, 3.5, 3.7, 3.8 Topics2 o Tarski logic language truth-functional operators translation Tasks2 o Review LPL2 CH3.SEC0-4.P67-77 (skip "game rule for NOT" P69, skip "game rule for AND" P72, skip "game rule for OR" P75-76) CH3.SEC5-6.P79-84 CH7.SEC0-2.P178-189 (skip "game rule for IF" P180, skip "game rule for IFF" P185) CH7.SEC4.P192-198 o Read LPL2 CH3.SEC7.P84-89 CH7.SEC3.P189-192 o Read LM Unit4.SEC1-2 Do2 o Nothing

Week 5 (Starting Mon 28 Jan) Topics o Tarski logic language truth-functional operators translation Tasks o Review LPL2 CH3.SEC0-4.P67-77 (skip "game rule for NOT" P69, skip "game rule for AND" P72, skip "game rule for OR" P75-76)

 o Read o Read Do

CH3.SEC5-6.P79-84 CH7.SEC0-2.P178-189 (skip "game rule for IF" P180, skip "game rule for IFF" P185) CH7.SEC4.P192-198 LPL2 CH3.SEC7.P84-89 CH7.SEC3.P189-192 LM Unit4.SEC1-2

o Gradegrinder LPL2 Exercises 3.20, 3.21, 7.11, 7.12, 7.15 o UBC Connect Assessments Exercises 4.2.1, 4.2.2 Week 6 (Starting Mon 04 Feb) Topics1 o Tarski logic language identity and quantifier operators translation Tasks1 o Review LPL2 CH9.SEC0-2.P229-233 CH9.SEC4-5.P237-245 (skip "Game rules quantifiers" P239-241) CH10.SEC3-4.P279-286 (starting at De Morgan for quantifiers) CH11.SEC0-2.P298-306 CH11.SEC7.P320-324 o Read LPL2 CH9.SEC6.P245-253 CH7.SEC3.P189-192 CH11.SEC3-5.P307-317 o Read LM Unit4.SEC3.SEC5-6 Do1 o UBC Connect Assessments

Exercises 4.3.1, 4.3.2, 4.3.3, 4.5, 4.6 o Gradegrinder LPL2 Exercises 9.12, 9.13, 9.16, 9.17, 9.18, 11.4, 11.16, 11.17, 11.19, 11.20 Topics2 o Tarski logic language quantifier operators complex patterns translation, eg numeric quantification, definite descriptions Tasks2 o Read LPL2 CH14.SEC0-1.P373-383 CH14.SEC3.P388-391 o Read LM Unit4.SEC4 Unit5.SEC2 Do2 o UBC Connect Assessments Exercises 4.4, 5.2 o Gradegrinder LPL2 Exercises 14.1, 14.3, 14.4, 14.28

Week 7 (Starting Mon 11 Feb) Topics1 o Applications logic language translation Tasks1 o Read LM Unit5.SEC3-4 o No LPL2 Readings o Recommended on BNA project: Guardian newspaper articles Bloomfield on logic and law and Kowalski on logic and law o Recommended on Arrow and voting methods: New Yorker magazine article Voting methods and fair elections, transcript Arrow interview video shown in class (what video? Email prof) Do1 o UBC Connect Assessments: Exercise 5.3 Topics2

o Nonstandard interpretations and the logical concepts again Tasks2 o Read LM Unit2.SEC7 Unit6.ALLSECTIONS o No LPL2 Readings Do2 o UBC Connect Assessments Exericses 2.7, 6.2, 6.3, 6.5, 6.6, 6.7, 6.8

Week 8 (Starting Mon 18 Feb) Midterm break. No assignments. Week 9 (Starting Mon 25 Feb) Topics1 o Semantic tableau truth trees o The truth-functional operators Tasks1 o Read LM Unit7.ALLSECTIONS o Recommended: Sections from Hodges, Logic Sec10 Sec11 Sec20 Sec36 Sec 40 Do1 o UBC Connect Assessments Exercises 7.1, 7.3 Topics2 o Semantic tableau truth trees o Quantifier operators and identity Tasks2 o Read LM Unit7 o Recommended: Sections from Hodges Logic Sec10 Sec11 Sec20 Sec36 Sec 40 Do2 o UBC Connect Assessments Exercises 7.2, 7.4, 7.5 EXTRA: Instructions for using TWOOTIE semantic tableau truthtrees program on Mac OSX. Download TWOOTIE MSDOS

package for Macintosh.Instructions for using TWOOTIE semantic tableau truthtrees program on Windows. Download TWOOTIE MSDOS package for Windows. Week 10 (Starting Mon 04 Mar) Topics1 o Semantic tableau truth trees o Quantifier operators and identity Tasks1 o Read LM Unit7 o Recommended: Sections from Hodges Logic Sec10 Sec11 Sec20 Sec36 Sec 40 Do1 o UBC Connect Assessments Exercises 7.2, 7.4, 7.5 Topics2 o Proof/derivations o Rules for identity, the truth-functional operators, quantifiers o Using derivation rules forwards and backwards Tasks2 o Read o Read LPL2 CH2.SEC2-4.P46-62 CH5.ALLSECTIONS.P128-142 CH6.ALLSECTIONS.P143-177 CH8.SEC0-2.P199-215 CH12.SEC0-4.P328-347 CH13.SEC0-3.P351-369 LM

Unit8.SEC1.SEC2.SEC4.SEC5.SEC7 o Watch Quicktime video of doing LPL exercise 6.1 Conjunction proof 2 in FITCH program.

Week 11 (Starting Mon 11 Mar) Topics o Proof/derivations

o Rules for identity, the truth-functional operators, quantifiers o Using derivation rules forwards and backwards Tasks o Read LPL2 CH2.SEC2-4.P46-62 CH5.ALLSECTIONS.P128-142 CH6.ALLSECTIONS.P143-177 CH8.SEC0-2.P199-215 CH12.SEC0-4.P328-347 CH13.SEC0-3.P351-369 o Read LM Unit8.SEC1.SEC2.SEC4.SEC5.SEC7 o Watch Quicktime video of doing LPL exercise 6.1 Conjunction proof 2 in FITCH program.

Do o UBC Connect Assessments Exercises 8.2, 8.4, 8.7 o Gradegrinder LPL2 Exercises 2.16, 6.1, 6.2, 6.7, 6.8, 6.33, 8.17, 13.1 Proof Universal 1 only, 13.10

Week 12 (Starting Mon 18 Mar) Topics1 o Proof/derivations o Rules for identity, the truth-functional operators, quantifiers o Using derivation rules forwards and backwards Tasks1 o Read LPL2 o Read CH2.SEC2-4.P46-62 CH5.ALLSECTIONS.P128-142 CH6.ALLSECTIONS.P143-177 CH8.SEC0-2.P199-215 CH12.SEC0-4.P328-347 CH13.SEC0-3.P351-369 LM Unit8.SEC1.SEC2.SEC4.SEC5.SEC7

Do1 o UBC Connect Assessments Exercises 8.2, 8.4, 8.7 o Gradegrinder LPL2 Exercises 2.16, 6.1, 6.2, 6.7, 6.8, 6.33, 8.17, 13.1 Proof Universal 1 only, 13.10 Topics2 o Positive subformulas o Identity proof/derivation strategies, truth-functional proof/derivation strategies, quantifier proof/derivation strategies Tasks2 o Read LPL2 CH o Read LM Unit3.SEC9 Unit8.SEC3.SEC6.SEC8.SEC9 Do2 o UBC Connect Assessments Exercises 3.9, 8.3, 8.5, 8.8 o Gradegrinder LPL2 Exercises 2.17, 2.18, 6.3-6.6, 6.9, 6.12, 6.186.20, 6.24-6.27 no informal proofs, 8.19, 8.20, 8.23, 8.24, 8.25, 8.26-8.30 not using Taut Con rule, 13.2 not using Taut Con rule, 13.3 not using Taut Con rule, 13.4 not using Taut Con rule, 13.8 not using Taut Con rule, 13.11 not using Taut Con rule, 13.14 not using Taut Con rule, 13.28-13.31 not using Taut Con rule o

Week 13 (Starting Mon 27 Mar) Topics o Identity proof/derivation strategies, truth-functional proof/derivation strategies, quantifier proof/derivation strategies Tasks

o Read o Read Do

LPL2 CH LM Unit3.SEC9 Unit8.SEC3.SEC6.SEC8.SEC9

o UBC Connect Assessments Exercises 3.9, 8.3, 8.5, 8.8 o Gradegrinder LPL2 Exercises 2.17, 2.18, 6.3-6.6, 6.9, 6.12, 6.186.20, 6.24-6.27 no informal proofs, 8.19, 8.20, 8.23, 8.24, 8.25, 8.26-8.30 not using Taut Con rule, 13.2 not using Taut Con rule, 13.3 not using Taut Con rule, 13.4 not using Taut Con rule, 13.8 not using Taut Con rule, 13.11 not using Taut Con rule, 13.14 not using Taut Con rule, 13.28-13.31 not using Taut Con rule EXTRAS: o Strategies flowchart: TF operators o Strategies flowchart: TF+identity operators o Strategies flowchart: TF+identity+Quantifier operators Week 14 (Starting Mon 01 Apr) Topics1 o Logic applications proofs/derivations and tableau: Russell set theory paradox Tasks1 o Read LPL2 CH1.SEC6.P37-38 CH15.SEC0-3.P413-422 CH15.SEC9.P442-443 o Read LM Unit9.SEC1-3 o Watch background YouTube video about Russells' set theory paradox Do1 o UBC Connect Assessments

Exercises 9.2.1, 9.2.2, 9.2.3, 9.2.4, 9.3.1, 9.3.3, 9.3.5

Topics2 o Logic applications proofs/derivations and tableau: God Tasks2 o Read LM Unit9.SEC4 o Watch YouTube video about Anselm's proof. o Read Anselm Proslogion ch 2 Do2 o UBC Connect Assessments Exericse .. Topics3 o Logic applications proofs/derivations and tableau: Arrow on preferences Tasks3 o Read LPL2 CH15.SEC6.P432 Properties of relations o Read LM Unit9.SEC5 Do3 o UBC Connect Assessments Exercise 9.5.1

1/13/2013 7:31:00 PM Week 1 (Starting Mon 31 Dec 2012) Topics o Course introduction. o UBC Connect course website. o Symbolic logic and logical concepts. Tasks o Read LPL2 Introduction p 1-5 CH2.SEC0-1.P41-44 (argument, validity, logical consequence concepts) o Read Do o UBC Connect Assessments Course Orientation Exercise Exercises 1.3.1, 1.3.2, 1.4 NOTES: Chapter 2 Section 0-1 An argument is logically valid if its conclusion is a logical consequence of its premises o All men are mortal. Socrates is a man. So, Socrates is mortal. Logically valid. Conclusion is logical consequence of premises o Lucretius is a man. After all, Lucretius is mortal and all men are mortal. Premises are true, but conclusion might be CH4.SEC1.P94 (first 3 paragraphs logical truth concept) CH4.SEC2.P106 (first 2 paragraphs logical equivalence concept) Exercise 11.5 (logical independence concept) CH5.SEC3.P138 (3rd & 2nd last paragraphs) CH5.SEC4.P141-142 (contradiction/inconsistency concept) LM Unit1.SEC1.SEC2.SEC3.SEC4

false (fish is mortal.. doesnt mean its man.). conclusion is not logical consequences of its premises Argument = logically valid IFF conclusion must be true on the assumption that the premises are true Premises dont have to be true in order for the argument to be valid BUT, if argument is valid and premises are also true, then argument is sound. o Argument about Socrates above = sound o All rich actors are good actors. Brad Pitt is a rich actor. So he must be a good actor = unsound because first premise is false, but argument is valid even though we dont know if conclusion is true since premise isnt. Logic focuses more on validity of argument, not soundness. Fitch format page 43

Chapter 4 Section 1-2 Tautological equivalence two sentences are tautologically equivalent if they can be seen to be equivalent simply in virtue of the meanings of the truth-functional connectives Chapter 5 Section 3-4 Contradictory or inconsistent set of sentences = any set of sentences that could not all be true in any single situation - symbol often used as a way of saying that a contradiction has been obtained. Basically, it means that a conclusion has been reached that is logically impossible, or that several conclusions have been reached that together are impossible. No circumstance exists where the premises are all true and conclusion is false. So, all premises true = conclusion true A proof of a contradiction from its premises shows that the premises are inconsistent. An argument with inconsistent premises is always valid, and always unsound.

LM Unit 1 Section 1-4

All premises can be true while conclusion is false o bill gates is rich, therefore I am rich. <- example it is possible to have all true premises and conclusion, but still have invalid argument. o Bill gates is rich, so I have more than $10. Premise and conclusion is true, but thats totally invalid dur. True premise and true conclusion can also be valid argument. o I have more than 10$, so I have more than 4$. This is true premise, true conclusion, and valid argument overall!

1/13/2013 7:31:00 PM Week 2 (Starting Mon 07 Jan 2013) Topics1 o Tarski Artificial language and worlds o Other logic languages and worlds Tasks1 o Read LPL2 CH1.SEC0-4.P19-31 CH1.SEC7.P38-39 Introduction Page 5-11 (Gradegrinder) o Read LM Unit2.SEC1 Do1 o Gradegrinder: LPL2 Exercises 1.3, 1.4, 1.5 o UBC Connect Assessments The Bonus Survey Topics2 o Artificial logic languages (eg Tarski logic languages) truthfunctional operators Tasks2 o Read LPL2 CH3.SEC0-4.P67-77 (skip game rule for NOT P69) (skip game rule for AND P72) (skip game rule for OR P75-76) CH3.SEC5-6.P79-84 CH7.SEC0-2.P178-189 (skip game rule for IF P180) (skip game rule for IFF P185) CH7.SEC4.P192-198 o Read LM Unit2.SEC2 Do2 o Gradegrinder LPL2 Exercises 3.2, 3.3, 3.7, 3.10, 3.13, 3.18, 7.10 (ignore play the game in 7.10), 7.16, 7.17, 7.25 Topics3 o Artificial logic languages (eg Tarski logic language) quantifiers

Tasks3 o Read LPL2 CH9.SEC0-2.P229-233 CH9.SEC4-5.P237-245 (skip game rules quantifiers P239-241) o Read LM Unit2.SEC3 Do3 o Gradegrinder LPL2 Exercises 9.5, 9.6

NOTES: Chapter 1 Section 0-4,7 FOL first order logic In FOL o Every individual constant must name an actually existing object o No individual constant can name more than one object o An object can have more than one name, or no name at all Gave(x,y) x gave to y there are many examples of shiz like this. Learn dat. First order arithmetic o The names 0,1 are terms o If t1, t2 are terms, then the expressions (t1+t2) and (t1xt2) are also terms o Nothing is a term unless it can be obtained by repeated application of the above 2 points

Chapter 3 Section 0-6 - Negative symbol (like using the term not) o Ex) It is not the case that John is home: Home(john) o You can put a in front of another one like Home(john) which is true if and only if John is home. o A sentence is a literal if it is either atomic or the negation of an atomic sentence

o In Tarskis world, we can abbreviate negated identity claims like (b=c) using so bc - conjunction symbol (like using the term and, moreover, but) o John and Mary are home: Home(john) Home(Mary) true IFF john and mary are both home o John slipped and fell-- Slipped(john) Fell(john) o D is a large cubelarge(d) Cube(d) o If we said Max went home and Claire went to sleep, our assertion would carry the implication that max went home BEFORE Claire went to sleep, but using this conjunction symbol.. no such thing is implied WentHome(max) FellAsleep(Claire) is same as FellAsleep(Claire) WentHome(max)

V disjunction symbol (like using term or) o John or Mary is home Home(john) v Home(mary) First Order Logic talk is much less ambiguous than regular talk thanks to its nifty symbols as outlined above. o BUT, parentheses must be used whenever ambiguity would result from their omission. This just means that conjunctions and disjunctions must be wrapped in parentheses whenever combined by means of some other connective Equivalent ways of saying things o P <-> P o (P Q) <-> (P v Q) o (P v Q) <-> (P Q)

Chapter 7 Section 0-2, 4 -> : used to combine two sentences P and Q to form P -> Q. The sentence means If P, then Q o P->Q is false if P is true and Q is false then its no true mofo o Home(max) -> Library(Claire) means if max is home then Claire is at the library o P->Q means.. P only if Q, Q provided P, Q if P. o P -> Q means unless P, Q and Q unless P o Q is a logical consequence of P1,,Pn if an only if the sentence (P1 and and Pn) -> Q is a logical truth

<-> : used to express IFF, also just in case sometimes o Home(max) <-> Library(Claire) means max is home if and only if Claire is at the library o Even(n) <-> Event(n^2) means n is even IFF n^2 is even, and n is even just in case n^2 is even A set of connectives is truth-functionally complete if the connectives allow us to express every truth function Various sets of connectives, including the Boolean connectives, are truth-functionally complete

Chapter 9 Section 0-2, 4-5 - universal quantifier (used to express claims like everything, each thing, all things, and anything) o xHome(x) Everything is at home o x(Doctor(x) Smart(x)) Every doctor is smart - existential quantifier (used to express claims like something, at least one thing, a, an) o xHome(x) Something is at home o x(Doctor(x) Smart(x)) some doctor is smart Some has the and sign in the middle whereas all as seen above has the sign x (P(x) Q(x)) : All Ps are Qs x (P(x) ~Q(x)) : No Ps are Qs x (P(x) Q(x)) : Some Ps are Qs x (P(x) ~Q(x)) : Some Ps are not Qs

LM Unit 2 Section 1-3 Section 1: shows how to write stuff on program Section 2: shows how to write stuff on program loldurrp Section 3: same as the others

1/13/2013 7:31:00 PM Week 3 (Starting Mon 14 Jan) Topics1 o Artificial logic languages (eg Tarski logic language) quantifiers Tasks1 o Read LPL2 CH10.SEC3-4.P279-286 (starting at De Morgan for quantifiers) CH11.SEC0-2.P298-306 CH11.SEC7.P320-324 o Read about Truth-functional expansions o Read LM Unit2.SEC5.SEC6.SEC8 Do1 o Gradegrinder LPL2 Exercises 9.9, 9.14, 10.22, 11.2, 11.3, 11.9, 11.10, 11.12, 11.38 o UBC Connect Assessments Exercises 2.5, 2.6, 2.8 Topics2 o Syntax Tarski logic language and other logic languages o Legal strings and formulas o Free variables o Sentences vs wffs o Main logic operator Tasks2 o Read LPL2 CH9.SEC3.P233-236 o Read LM Unit3.SEC1-5.SEC7-8 Do2 o Nothing NOTES: Chapter 10 DeMorgan laws for quantifiers o ~All(x)P(x) is logically equivalent to Some(x)~P(x) o ~Some(x)P(x) is logically equivalent to All(x)~P(x)

o Page 279-280 for relationship between all and and and some and or o Read 281-286 for more.. pretty straight forward lolyolo. Chapter 11 When evaluating a sentence with multiple quantifiers, dont fall into the trap of thinking that distinct variables range over distinct objects. o All(x)All(y)P(x,y) logically implies All(x)P(x,x) o Some(x)P(x,x) logically implies Some(x)Some(y)P(x,y) When dealing with mixed quantifiers, the order is VERY important. o All(x)Some(y)R(x,y) is NOT logically equivalent to Some(y)All(x)R(x,y) A sentence is in prenex form if any quantifiers contained in it are out in front. Any sentence is logically equivalent to one in prenex form.

Chapter 9 Next week notes LM Unit 2 Section 5/6/8: read online

1/13/2013 7:31:00 PM Week 4 (Starting Mon 21 Jan) Topics1 o Syntax Tarski logic language and other logic languages o Legal strings and formulas o Free variables o Sentences vs wffs o Main logic operator Tasks1 o Read LPL2 CH9.SEC3.P233-236 o Read LM Unit3.SEC1-5.SEC7-8 Do1 o UBC Connect Assessments Exercises 3.2, 3.3, 3.5, 3.7, 3.8

NOTES: Chapter 9 Complex wffs are built from atomic wffs by means of truthfunctional connectives and quantifiers in accord with the rules on page 233 When you append either quantifier All(x) or Some(x) to a wff P, we say that the quantifier binds all the free occurrences of x in P A sentence is a wff in which no variables occur free (unbound)

LM Unit 3 ::= <- that means that the right side can be broken down into or rewritten as or made up of the left side. o Nonlexical rules fruitpie ::= topshell filling bottomshell fruitpie ::= filling bottomshell o Lexical rule filling ::= apple, cherry, blackberry, ... o Nonlexical: means multiple ways exist 1. wff ::= wff 2. wff ::= ( wff ... wff ) 3. wff ::= ( wff ... wff )

4. wff ::= ( wff wff ) 5. wff ::= ( wff wff ) 6. wff ::= variable wff 7. wff ::= variable wff Parser tree examples: o Example 1:

o Example 2:

Section 3 has a lot of useful rules to memorize and such

Section 4 is like section 3 but with genealogy Section 5 is like section 3 but with numbers IF the occurrence a variable is found within the scope of a quantifier or THEN it is a bound occurrence (by the quantifier). IF a variable is not found within the scope of a quantifier or AND it is not an occurrence inside the quantifier

itself THEN it's occurrence is free. Instantiation o IF a wff of an artficial logic language is either or where is a VARIABLE AND is a WFF THEN an instantiation of the wff is whatever formula results from doing the following (1) Dropping the quantifier or , leaving the wff . (2) Replacing each occurrence of the free variable in with some name or constant . Sometimes the name or constant in part (2) above is called the instantiating constant. o Ex) Cube(a) is an instantiation of xCube(x) o Ex) Cube(a) yTet(y) is an instantiation of x(Cube(x) yTet(y)) o Ex) Larger(a,b) is an instantiation of xLarger(x,b) o Ex) xLarger(x,b) is an instantiation of y xLarger(x,b) o Cube(a)Tet(b) is not an instantiation of Cube(a) yTet(y). Cube(a) yTet(y) is not of the form or .

Scope o IF a wff of an artficial logic language is either or where is a VARIABLE AND is a WFF THEN the wff is called thescope of the quantifier or

Main operators, unit 3 section 8!!!

1/13/2013 7:31:00 PM Week 5 (Starting Mon 28 Jan) Topics o Tarski logic language truth-functional operators translation Tasks o Review LPL2 CH3.SEC0-4.P67-77 (skip "game rule for NOT" P69, skip "game rule for AND" P72, skip "game rule for OR" P75-76) CH3.SEC5-6.P79-84 CH7.SEC0-2.P178-189 (skip "game rule for IF" P180, o Read o Read Do o Gradegrinder LPL2 Exercises 3.20, 3.21, 7.11, 7.12, 7.15 o UBC Connect Assessments Exercises 4.2.1, 4.2.2 NOTES Chapter 3 In order for an FOL sentence to be a good translation of an English sentence, it is sufficient that the two sentences have the same truth values in all possible circumstances, that is, that they have the same truth conditions The English expression and sometimes suggests a temporal ordering; the FOL expression (upside down v) never does. The English expressions but, however, yet, nonetheless, moreover are all stylistic variants of and The English expressions either, both are often used like parentheses to clarify an otherwise ambiguous sentence skip "game rule for IFF" P185) CH7.SEC4.P192-198 LPL2 CH3.SEC7.P84-89 CH7.SEC3.P189-192 LM Unit4.SEC1-2

Chapter 7 If the assertion of a sentence carries with it a suggestion that could be cancelled (without contradiction) by further elaboration by the speaker, then the suggestion is a conversational implicature, not part of the content of the original claim LM Unit 4 All about translating sentences into VOODOPHILOSOPHYTALKzomg

1/13/2013 7:31:00 PM Week 6 (Starting Mon 04 Feb) Topics1 o Tarski logic language identity and quantifier operators translation Tasks1 o Review LPL2 CH9.SEC0-2.P229-233 CH9.SEC4-5.P237-245 (skip "Game rules quantifiers" P239-241) CH10.SEC3-4.P279-286 (starting at De Morgan for o Read o Read quantifiers) CH11.SEC0-2.P298-306 CH11.SEC7.P320-324 LPL2 CH9.SEC6.P245-253 CH7.SEC3.P189-192 CH11.SEC3-5.P307-317 LM Unit4.SEC3.SEC5-6

Do1 o UBC Connect Assessments Exercises 4.3.1, 4.3.2, 4.3.3, 4.5, 4.6 o Gradegrinder LPL2 Exercises 9.12, 9.13, 9.16, 9.17, 9.18, 11.4, 11.16, 11.17, 11.19, 11.20 Topics2 o Tarski logic language quantifier operators complex patterns translation, eg numeric quantification, definite descriptions Tasks2 o Read o Read Do2 LPL2 CH14.SEC0-1.P373-383 CH14.SEC3.P388-391 LM Unit4.SEC4 Unit5.SEC2

o UBC Connect Assessments Exercises 4.4, 5.2 o Gradegrinder LPL2 Exercises 14.1, 14.3, 14.4, 14.28

NOTES: Chapter 9 A small happy dog is at home o Some(x) [(Small(x) & happy(x) & dog(x)) & home(x)] o Some(x) usually has & Every small dog that is at home is happy o All(x) [(small(x) & dog(x) & home(x)) -> happy(x)] o All(x) usually has -> The order of an English sentence may not necessarily correspond to the order of its FOL translation Translations of complex quantified noun phrases frequently employ conjunctions of atomic predicates All Ps are Qs does not necessarily imply that there ARE some Ps Some Ps are Qs does not necessarily imply that not all Ps are Qs

Chapter 7 Not much here conversational implicature is all Chapter 11 Instructions for step by step breaking down sentences. PAGE 307/310 great examples o Every freshman who takes a logic class must be smart o Each cube is to the left of a tetrahedron (see 307/310 for both examples) REVIEW DONKEY SENTENCES page 310 lol An important source of ambiguity in English stems from the order in which quantifiers are interpreted. To translate such a sentence into FOL, you must know which order the speaker of the sentence had in

mind. This can often be determined by looking at the context in which the sentence was used. Unit 4 Unit 5

Section 3: useful table for translations!! Section 5/6: Section 4: not that useful..

Section 2: quite long.. read through it :/

Chapter 14 Review of Vx and]x stuff New stuff on page 380 about notation for there are at least/at most/exactly n things such that look it up bro! The Russellian analysis of: o The A is a B is the FOL translation of There is exactly one A and it is a B. o Both As are Bs is the FOL translation of There are exactly two As and each of them is a B o Neither A is a B is the FOL translation of There are exactly two As and each of them is not a B o The competing Strawsonian analysis of these determiners treats them as having presuppositions, and so as only making claims when these presuppositions are met. On Strawsons analysis, these determiners cannot be adequately translated in FOL

1/13/2013 7:31:00 PM Week 7 (Starting Mon 11 Feb) Topics1 o Applications logic language translation Tasks1 o Read LM Unit5.SEC3-4 o No LPL2 Readings o Recommended on BNA project: Guardian newspaper articles Bloomfield on logic and law and Kowalski on logic and law o Recommended on Arrow and voting methods: New Yorker magazine article Voting methods and fair elections, transcript Arrow interview video shown in class (what video? Email prof)

Do1 o UBC Connect Assessments: Exercise 5.3 Topics2 o Nonstandard interpretations and the logical concepts again Tasks2 o Read LM Unit2.SEC7 Unit6.ALLSECTIONS o No LPL2 Readings Do2 o UBC Connect Assessments Exericses 2.7, 6.2, 6.3, 6.5, 6.6, 6.7, 6.8

NOTES UNIT 5 Nothing useful in sections 3-4.. check for CYC project stuff UNIT 2 Section 7: review of tarski block stuff like backof, frontof, small, cube, tet, etc Differences are for non-standard interpretation:

o Backof,leftof,rightof,frontof for this to apply, two things must be same column or same row now.. cant just be generally in front/back/left/right Right/left (must be same row) Back/front (must be same column) UNIT 6 aa

1/13/2013 7:31:00 PM Week 8 (Starting Mon 18 Feb) Midterm break. No assignments.

1/13/2013 7:31:00 PM Week 9 (Starting Mon 25 Feb) Topics1 o Semantic tableau truth trees o The truth-functional operators Tasks1 o Read LM Unit7.ALLSECTIONS o Recommended: Sections from Hodges, Logic Sec10 Sec11 Sec20 Sec36 Sec 40 Do1 o UBC Connect Assessments Exercises 7.1, 7.3 Topics2 o Semantic tableau truth trees o Quantifier operators and identity Tasks2 o Read LM Unit7 o Recommended: Sections from Hodges Logic Sec10 Sec11 Sec20 Sec36 Sec 40 Do2 o UBC Connect Assessments Exercises 7.2, 7.4, 7.5 EXTRA: Instructions for using TWOOTIE semantic tableau truthtrees program on Mac OSX. Download TWOOTIE MSDOS package for Macintosh.Instructions for using TWOOTIE semantic tableau truthtrees program on Windows. Download TWOOTIE MSDOS package for Windows.

UNIT 7 Section 1

1/13/2013 7:31:00 PM Week 10 (Starting Mon 04 Mar) Topics1 o Semantic tableau truth trees o Quantifier operators and identity Tasks1 o Read LM Unit7 o Recommended: Sections from Hodges Logic Sec10 Sec11 Sec20 Sec36 Sec 40 Do1 o UBC Connect Assessments Exercises 7.2, 7.4, 7.5 Topics2 o Proof/derivations o Rules for identity, the truth-functional operators, quantifiers o Using derivation rules forwards and backwards Tasks2 o Read LPL2 CH2.SEC2-4.P46-62 CH5.ALLSECTIONS.P128-142 CH6.ALLSECTIONS.P143-177 CH8.SEC0-2.P199-215 CH12.SEC0-4.P328-347 CH13.SEC0-3.P351-369 o Read LM Unit8.SEC1.SEC2.SEC4.SEC5.SEC7 o Watch Quicktime video of doing LPL exercise 6.1 Conjunction proof 2 in FITCH program.

1/13/2013 7:31:00 PM Week 11 (Starting Mon 11 Mar) Topics o Proof/derivations o Rules for identity, the truth-functional operators, quantifiers o Using derivation rules forwards and backwards Tasks o Read LPL2 CH2.SEC2-4.P46-62 CH5.ALLSECTIONS.P128-142 CH6.ALLSECTIONS.P143-177 CH8.SEC0-2.P199-215 CH12.SEC0-4.P328-347 CH13.SEC0-3.P351-369 o Read LM Unit8.SEC1.SEC2.SEC4.SEC5.SEC7 o Watch Quicktime video of doing LPL exercise 6.1 Conjunction proof 2 in FITCH program. Do o UBC Connect Assessments Exercises 8.2, 8.4, 8.7 o Gradegrinder LPL2 Exercises 2.16, 6.1, 6.2, 6.7, 6.8, 6.33, 8.17, 13.1 Proof Universal 1 only, 13.10 CHAPTER 2 A proof of a statement S from premises P1, , Pn is a step-by-step demonstration which shows that S MUST be true in any circumstances in which the premises P1, , Pn are all true. Informal and formal proofs differ in style, but NOT rigor. Symmetry of identity: if b=c, then c=b Transitivity of identity: if a=b and b=c, then a=c Reflexivity of identity: sentences of form b=b are always true =Intro used to introduce, for any name or complex term, n in use in the proof. Ie, a=a =Intro =Elim it tells us that if we have proven a sentence containing n (which we indicate by writing P(n)) and a sentence of the form n =

m, then we are justified in asserting any sentence which results from P(n) by replacing some or all of the occurrences of n by m. CHAPTER 6 CHAPTER 12 aasdfl

1/13/2013 7:31:00 PM Week 12 (Starting Mon 18 Mar) Topics1 o Proof/derivations o Rules for identity, the truth-functional operators, quantifiers o Using derivation rules forwards and backwards Tasks1 o Read LPL2 CH2.SEC2-4.P46-62 CH5.ALLSECTIONS.P128-142 CH6.ALLSECTIONS.P143-177 CH8.SEC0-2.P199-215 CH12.SEC0-4.P328-347 CH13.SEC0-3.P351-369 o Read LM Unit8.SEC1.SEC2.SEC4.SEC5.SEC7 Do1 o UBC Connect Assessments Exercises 8.2, 8.4, 8.7 o Gradegrinder LPL2 Exercises 2.16, 6.1, 6.2, 6.7, 6.8, 6.33, 8.17, 13.1 Proof Universal 1 only, 13.10

Topics2 o Positive subformulas o Identity proof/derivation strategies, truth-functional proof/derivation strategies, quantifier proof/derivation strategies Tasks2 o Read LPL2 CH o Read LM Unit3.SEC9 Unit8.SEC3.SEC6.SEC8.SEC9 Do2 o UBC Connect Assessments Exercises 3.9, 8.3, 8.5, 8.8 o Gradegrinder

LPL2 Exercises 2.17, 2.18, 6.3-6.6, 6.9, 6.12, 6.186.20, 6.24-6.27 no informal proofs, 8.19, 8.20, 8.23, 8.24, 8.25, 8.26-8.30 not using Taut Con rule, 13.2 not using Taut Con rule, 13.3 not using Taut Con rule, 13.4 not using Taut Con rule, 13.8 not using Taut Con rule, 13.11 not using Taut Con rule, 13.14 not using Taut Con rule, 13.28-13.31 not using Taut Con rule

1/13/2013 7:31:00 PM Week 13 (Starting Mon 25 Mar) Topics o Identity proof/derivation strategies, truth-functional proof/derivation strategies, quantifier proof/derivation strategies Tasks o Read LPL2 CH o Read LM Unit3.SEC9 Do o UBC Connect Assessments Exercises 3.9, 8.3, 8.5, 8.8 o Gradegrinder LPL2 Exercises 2.17, 2.18, 6.3-6.6, 6.9, 6.12, 6.186.20, 6.24-6.27 no informal proofs, 8.19, 8.20, 8.23, 8.24, 8.25, 8.26-8.30 not using Taut Con rule, 13.2 not using Taut Con rule, 13.3 not using Taut Con rule, 13.4 not using Taut Con rule, 13.8 not using Taut Con rule, 13.11 not using Taut Con rule, 13.14 not using Taut Con rule, 13.28-13.31 not using Taut Con rule EXTRAS: o Strategies flowchart: TF operators o Strategies flowchart: TF+identity operators o Strategies flowchart: TF+identity+Quantifier operators Unit8.SEC3.SEC6.SEC8.SEC9

1/13/2013 7:31:00 PM Week 14 (Starting Mon 01 Apr) Topics1 o Logic applications proofs/derivations and tableau: Russell set theory paradox Tasks1 o Read LPL2 CH1.SEC6.P37-38 CH15.SEC0-3.P413-422 CH15.SEC9.P442-443 o Read LM Unit9.SEC1-3 o Watch background YouTube video about Russells' set theory paradox Do1 o UBC Connect Assessments Exercises 9.2.1, 9.2.2, 9.2.3, 9.2.4, 9.3.1, 9.3.3, 9.3.5 Topics2 o Logic applications proofs/derivations and tableau: God Tasks2 o Read LM Unit9.SEC4 o Watch YouTube video about Anselm's proof. o Read Anselm Proslogion ch 2 Do2 o UBC Connect Assessments Exericse .. Topics3 o Logic applications proofs/derivations and tableau: Arrow on preferences Tasks3 o Read LPL2 CH15.SEC6.P432 Properties of relations o Read LM Unit9.SEC5 Do3 o UBC Connect Assessments Exercise 9.5.1