(An)Thony S. Gillies. Chicago Philosophy of Language/Semantics Workshop
|
|
- Poppy Perry
- 5 years ago
- Views:
Transcription
1 Iffiness (An)Thony S. Gillies Chicago Philosophy of Language/Semantics Workshop
2 An Iffy Thesis An Iffy Thesis
3 An Iffy Thesis Examples (1) a. If the goat is behind door #1, then the new car is behind door #2 b. If Eto o regains his form, then Barça might advance c. If Carl is at the party, then Lenny must also be at the party
4 An Iffy Thesis Conditional Information These all express conditional information what might or must be if such-and-such is or turns out to be For example (1b) If Eto o regains his form, then Barça might advance says that among the Eto o regains his form possibilities lies a Barça advance possibility
5 An Iffy Thesis Conditional Information These all express conditional information what might or must be if such-and-such is or turns out to be For example (1b) If Eto o regains his form, then Barça might advance says that among the Eto o regains his form possibilities lies a Barça advance possibility
6 An Iffy Thesis Iffiness (Old School) Our examples express conditional information because if is a conditional operator the same conditional operator in (1a) (1c)
7 An Iffy Thesis Problem There might not be a single operator that can do that - Iffiness requires if = - But if s interact with epistemic modals - No way to predict that interaction given that if =
8 An Iffy Thesis Problem There might not be a single operator that can do that - Iffiness requires if = - But if s interact with epistemic modals - No way to predict that interaction given that if =
9 An Iffy Thesis Problem 2 - New School anti-iffiness - Lewis, Kratzer, Heim, et al. - No such thing as conditionals - if s aren t operators at all, and so not the same operator in our examples, and so not the same iffy operator in them - They merely restrict other operators - In our examples those are epistemic modals - This predicts if /modal interaction trivially
10 An Iffy Thesis Problem 2 - New School anti-iffiness - Lewis, Kratzer, Heim, et al. - No such thing as conditionals - if s aren t operators at all, and so not the same operator in our examples, and so not the same iffy operator in them - They merely restrict other operators - In our examples those are epistemic modals - This predicts if /modal interaction trivially
11 An Iffy Thesis Problem 2 - New School anti-iffiness - Lewis, Kratzer, Heim, et al. - No such thing as conditionals - if s aren t operators at all, and so not the same operator in our examples, and so not the same iffy operator in them - They merely restrict other operators - In our examples those are epistemic modals - This predicts if /modal interaction trivially
12 An Iffy Thesis Problem 2 - New School anti-iffiness - Lewis, Kratzer, Heim, et al. - No such thing as conditionals - if s aren t operators at all, and so not the same operator in our examples, and so not the same iffy operator in them - They merely restrict other operators - In our examples those are epistemic modals - This predicts if /modal interaction trivially
13 An Iffy Thesis Options for Old School Q How can we rescue iffiness? A Deny Fact(s) about if /modal interaction A Take if to be doubly shifty strict conditional
14 An Iffy Thesis Options for Old School Q How can we rescue iffiness? A Deny Fact(s) about if /modal interaction A Take if to be doubly shifty strict conditional
15 An Iffy Thesis Options for Old School Q How can we rescue iffiness? A Deny Fact(s) about if /modal interaction A Take if to be doubly shifty strict conditional
16 An Iffy Thesis Tragically Hip Old School (Sneak Preview) Index Shifty truth at i depends on truth of constituents at worlds other than i Context Shifty truth in C depends on truth of constituents in contexts other than C
17 An Iffy Thesis Plan For Today 1st Show that iffiness requires that if = 2nd State three facts about if /modal interaction 3rd Argue that Old School Iffiness isn t compatible the facts 4th And that New School Anti-Iffiness predict them trivially 5th Rescue Old School Iffiness
18 Ground Rules Ground Rules
19 Ground Rules Task at Hand Assume meanings get associated with sentences by getting associated with formulas of intermediate language representing LFs - Say what the LFs of the sentences are - Assign those LFs semantic values
20 Ground Rules Preliminaries - L is a propositional language built from atoms,, in the usual way - Plus (if )( ) - And might and must - Truth-values at index wrt context - contexts idle for boolean stuff - contexts select domains modals quantify over
21 Ground Rules Contexts and Proxies Let c be a real context C i = {j : j is compatible with the c-relevant info at i} - Pretend only work context does is select such C s - Let modal bases go proxy for real contexts
22 Ground Rules Constraints on Contexts Contexts must be well-behaved - i C i Reflexiveness - if j C i then C i C j Euclideanness Implies if j C i, then C j = C i (Closure)
23 Ground Rules Constraints on Contexts Contexts must be well-behaved - i C i Reflexiveness - if j C i then C i C j Euclideanness Implies if j C i, then C j = C i (Closure)
24 Ground Rules Modal Oomph might says some worlds compatible with C i are prejacent worlds must says all worlds compatible with C i are prejacent worlds - might p C,i = 1 iff C i p C - must p C,i = 1 iff C i p C
25 Ground Rules Iffiness, Relevant Worlds, and Contexts The most general iffy semantics says that (2) a. If such-and-such, then thus-and-so b. (if such-and-such)(thus-and-so) is true at i wrt C iff the right relation holds between the right such-and-such worlds and the thus-and-so worlds
26 Ground Rules Constraints on Relevant Worlds D i is the set of relevant worlds at i... i D i... D i C i We haven t said how D i is determined that depends on your favorite theory we re just requiring that the set your favorite theory does determine is not completely unruly
27 Ground Rules Constraints on Relevant Worlds D i is the set of relevant worlds at i... i D i... D i C i We haven t said how D i is determined that depends on your favorite theory we re just requiring that the set your favorite theory does determine is not completely unruly
28 Conditional Operators Conditional Operators
29 Conditional Operators What Does Iffiness Require? By saying what must be true of an operator for it to be conditional we can say what must be true of a story for it to be iffy [Sneak Preview if has to mean ]
30 Conditional Operators What Does Iffiness Require? By saying what must be true of an operator for it to be conditional we can say what must be true of a story for it to be iffy [Sneak Preview if has to mean ]
31 Conditional Operators It Takes (At Least) Two Things To Be Iffy Thing One (if p)(q) doesn t take a stand on whether p is true Thing Two (if p)(q) expresses a relation between p-worlds and q-worlds
32 Conditional Operators Thing One Ordinary indicatives like If such-and-such, then thus-and-so get a truth-value at i wrt C only if such-and-such is compatible with C i (if p)(q) C,i is defined only if p is compatible w/c i
33 Conditional Operators Thing One Ordinary indicatives like If such-and-such, then thus-and-so get a truth-value at i wrt C only if such-and-such is compatible with C i (if p)(q) C,i is defined only if p is compatible w/c i
34 Conditional Operators Thing Two Truth-conditions of ordinary indicatives (3) If such-and-such, then thus-and-so can be put as whether or not some relation holds between the relevant such-an-such worlds and the thus-and-so worlds
35 Conditional Operators Thing Two, Again Let P be the set of such-and-such worlds (p-worlds) and Q the set of thus-and-so worlds (q-worlds) We have to be able to put truth-conditions this way: if defined... (if p)(q) C,i = 1 iff R(D i P, Q)... for some R and relevant worlds D i
36 Conditional Operators Thing Two, Again Let P be the set of such-and-such worlds (p-worlds) and Q the set of thus-and-so worlds (q-worlds) We have to be able to put truth-conditions this way: if defined... (if p)(q) C,i = 1 iff R(D i P, Q)... for some R and relevant worlds D i
37 Conditional Operators But Not Just Any Relation Will Do Assume this much about R Order D i P imposes order on Q Active Q matters to whether R holds Quality Only the relation between D i P and Q matters
38 Conditional Operators Orderliness R is something (if )( ) at i could mean only if - R(D i P, P) REFLEXIVITY - R(D i P, Q) and Q S imply R(D i P, S) RIGHT UPWARD MONOTONICITY - R(D i P, Q) and R(D i P, S) imply R(D i P, Q S) CONJUNCTION
39 Conditional Operators Orderliness R is something (if )( ) at i could mean only if - R(D i P, P) REFLEXIVITY - R(D i P, Q) and Q S imply R(D i P, S) RIGHT UPWARD MONOTONICITY - R(D i P, Q) and R(D i P, S) imply R(D i P, Q S) CONJUNCTION
40 Conditional Operators Activity R is something (if )( ) at i could mean only if - if D i P then there s a Q and Q s.t.... R(D i P, Q) but... not R(D i P, Q )
41 Conditional Operators Quality, First Take If R holds at all between D i -plus-the-antecedent-determined-p and the consequent-possibilities Q, then R will hold between any two sets of things that play the right possibility role
42 Conditional Operators Quality, Second Take Claim Your favorite off-the-shelf-theory can be put in terms of a way of determining D i (restricted to C i ) Ex. #1 Variably Strict: given an ordering over worlds take D i to be set of worlds no further from i than closest p-world to i Ex. #2 Strict: take your ordering to be universal and take D i to be set of worlds no further from i than closest p-world to i Ex. #3 Horseshoe: take your ordering to be maximally discerning and take D i to be set of worlds no further from i than closest world to i simpliciter
43 Conditional Operators Quality, Second Take Claim Your favorite off-the-shelf-theory can be put in terms of a way of determining D i (restricted to C i ) Ex. #1 Variably Strict: given an ordering over worlds take D i to be set of worlds no further from i than closest p-world to i Ex. #2 Strict: take your ordering to be universal and take D i to be set of worlds no further from i than closest p-world to i Ex. #3 Horseshoe: take your ordering to be maximally discerning and take D i to be set of worlds no further from i than closest world to i simpliciter
44 Conditional Operators Quality, Second Take Claim Your favorite off-the-shelf-theory can be put in terms of a way of determining D i (restricted to C i ) Ex. #1 Variably Strict: given an ordering over worlds take D i to be set of worlds no further from i than closest p-world to i Ex. #2 Strict: take your ordering to be universal and take D i to be set of worlds no further from i than closest p-world to i Ex. #3 Horseshoe: take your ordering to be maximally discerning and take D i to be set of worlds no further from i than closest world to i simpliciter
45 Conditional Operators Quality, Second Take Claim Your favorite off-the-shelf-theory can be put in terms of a way of determining D i (restricted to C i ) Ex. #1 Variably Strict: given an ordering over worlds take D i to be set of worlds no further from i than closest p-world to i Ex. #2 Strict: take your ordering to be universal and take D i to be set of worlds no further from i than closest p-world to i Ex. #3 Horseshoe: take your ordering to be maximally discerning and take D i to be set of worlds no further from i than closest world to i simpliciter
46 Conditional Operators Quality, Third Take If your story says there is structure that a conditional operator is sensitive to structure relevant for figuring out D i then Quality requires that swapping possibilities for possibilities in a way that preserves that structure doesn t muck up R s holding So if O is your ordering, we require invariance under O-automorphisms
47 Conditional Operators Quality, Third Take If your story says there is structure that a conditional operator is sensitive to structure relevant for figuring out D i then Quality requires that swapping possibilities for possibilities in a way that preserves that structure doesn t muck up R s holding So if O is your ordering, we require invariance under O-automorphisms
48 Conditional Operators Quality, Final Take R is something (if )( ) at i could mean only if - R(D i P, Q) implies R(π(D i P), π(q))... where π is an order-preserving mapping
49 Conditional Operators That Pretty Much Means if = all Proposition Order, Activity, and Quality together imply that R(D i P, Q) holds iff D i P Q
50 Conditional Operators Here s Why Suppose R(D i P, Q) but D i P Q By Order R(D i P, P Q) By Quality World witnessing D i P Q can be exploited (repeatedly) to show that no world in P Q plays a role in R(D i P, P Q) holding - it follows that R(D i P, ) By Activity It follows that D i P must be empty
51 Three Facts Three Facts
52 Three Facts Fact #1: I ve Lost My Marbles Red might be in the box and Yellow might be in the box. So, if Yellow isn t in the box, Red must be; and if Red isn t in the box, then Yellow must be. (4) a. might S 1 and might S 2 b. if not S 1, then must S 2 ; and if not S 2, then must S 1
53 Three Facts Fact #1: I ve Lost My Marbles Red might be in the box and Yellow might be in the box. So, if Yellow isn t in the box, Red must be; and if Red isn t in the box, then Yellow must be. (4) a. might S 1 and might S 2 b. if not S 1, then must S 2 ; and if not S 2, then must S 1
54 Three Facts Fact #2: Wherever Carl Goes, Lenny Goes I do not know whether Carl made it to the party. But wherever Carl goes, Lenny is sure to follow. So if Carl is at the party, Lenny must be Lenny is at the party, if Carl is. (5) a. if S 1, then must S 2 b. if S 1, then S 2
55 Three Facts Fact #2: Wherever Carl Goes, Lenny Goes I do not know whether Carl made it to the party. But wherever Carl goes, Lenny is sure to follow. So if Carl is at the party, Lenny must be Lenny is at the party, if Carl is. (5) a. if S 1, then must S 2 b. if S 1, then S 2
56 Three Facts Fact #3: Cubs Might Win It All My team are not likely to win it all this year. It is late in the season and they have made too many miscues. But they are not quite out of it. If they win their remaining three games, and the team at the top lose theirs, they will be champions. But our last three are against strong teams and their last three are against cellar dwellers. Still, my spirits high: if they win out, they might win it all. (6) a. if S 1, then might S 2 b. it might be that [S 1 and S 2 ]
57 Three Facts Fact #3: Cubs Might Win It All My team are not likely to win it all this year. It is late in the season and they have made too many miscues. But they are not quite out of it. If they win their remaining three games, and the team at the top lose theirs, they will be champions. But our last three are against strong teams and their last three are against cellar dwellers. Still, my spirits high: if they win out, they might win it all. (6) a. if S 1, then might S 2 b. it might be that [S 1 and S 2 ]
58 Three Facts Really? - Deny Fact #1 plain icky - Deny Fact #2 deny deduction theorem for ordinary if, modus ponens, or factivity of must - Deny Fact #3 OKness of (7) a. #If my team wins out, they might win it all; but they can t win out and win it all b. #It might turn out that my team wins out and wins it all, but there s no way that if they win out, they might win it all
59 Three Facts Really? - Deny Fact #1 plain icky - Deny Fact #2 deny deduction theorem for ordinary if, modus ponens, or factivity of must - Deny Fact #3 OKness of (7) a. #If my team wins out, they might win it all; but they can t win out and win it all b. #It might turn out that my team wins out and wins it all, but there s no way that if they win out, they might win it all
60 Three Facts Really? - Deny Fact #1 plain icky - Deny Fact #2 deny deduction theorem for ordinary if, modus ponens, or factivity of must - Deny Fact #3 OKness of (7) a. #If my team wins out, they might win it all; but they can t win out and win it all b. #It might turn out that my team wins out and wins it all, but there s no way that if they win out, they might win it all
61 Three Facts Really? - Deny Fact #1 plain icky - Deny Fact #2 deny deduction theorem for ordinary if, modus ponens, or factivity of must - Deny Fact #3 OKness of (7) a. #If my team wins out, they might win it all; but they can t win out and win it all b. #It might turn out that my team wins out and wins it all, but there s no way that if they win out, they might win it all
62 Three Facts Wrinkle: Symmetry of if... might Fact #3 implies (8) if S 1, then might S 2 if S 2, then might S 1 (9) a. If I jump out the window, I might break a leg b. If I break a leg, I might jump out the window Sweep this under same rug as (10) Some smoke and get cancer/some get cancer and smoke
63 Three Facts Wrinkle: Symmetry of if... might Fact #3 implies (8) if S 1, then might S 2 if S 2, then might S 1 (9) a. If I jump out the window, I might break a leg b. If I break a leg, I might jump out the window Sweep this under same rug as (10) Some smoke and get cancer/some get cancer and smoke
64 Three Facts Wrinkle: Symmetry of if... might Fact #3 implies (8) if S 1, then might S 2 if S 2, then might S 1 (9) a. If I jump out the window, I might break a leg b. If I break a leg, I might jump out the window Sweep this under same rug as (10) Some smoke and get cancer/some get cancer and smoke
65 Scope Matters Scope Matters
66 Scope Matters Choices The L-representation of (11) If such-and-such then modal thus-and-so is either Narrowscoped (12a) or Widescoped (12b) (12) a. (if S 1 )(modals 2 ) b. modal (if S 1 )(S 2 )
67 Scope Matters Problem (Cliffs Notes Version) - Iffiness requires that if = - Iffiness requires either narrowscoping or widescoping - Narrowscoping + Fact #1 - Widescoping + (Fact #2 & Fact #3)
68 Scope Matters Problem (Cliffs Notes Version) - Iffiness requires that if = - Iffiness requires either narrowscoping or widescoping - Narrowscoping + Fact #1 - Widescoping + (Fact #2 & Fact #3)
69 Scope Matters Problem (Cliffs Notes Version) - Iffiness requires that if = - Iffiness requires either narrowscoping or widescoping - Narrowscoping + Fact #1 - Widescoping + (Fact #2 & Fact #3)
70 Scope Matters NS Fact #1 Narrowscope the marble example (Fact #1) (13) a. Modal claim: Red might be in the box and Yellow might be might p might q b. First conditional: If Yellow isn t in the box, then Red must be (if q)(must p) c. Second conditional: If Red isn t in the box, then Yellow one must be (if p)(must q)
71 Scope Matters NS Fact #1 Narrowscope the marble example (Fact #1) (13) a. Modal claim: Red might be in the box and Yellow might be might p might q b. First conditional: If Yellow isn t in the box, then Red must be (if q)(must p) c. Second conditional: If Red isn t in the box, then Yellow one must be (if p)(must q)
72 Scope Matters Inconsistent! Suppose otherwise. Just one marble is in the box, so for any i exactly one of these holds (1) i is a q-world (2) i is a p-world
73 Scope Matters Assume (1): i is q-world - by hypothesis (if q)(must p) C,i = 1 - so D i q C must p C - i D i and so i must p C - so must p C,i = 1 which is to say C i p But wait! might p might q is true and so there must be a p-world in C i
74 Scope Matters Assume (1): i is q-world - by hypothesis (if q)(must p) C,i = 1 - so D i q C must p C - i D i and so i must p C - so must p C,i = 1 which is to say C i p But wait! might p might q is true and so there must be a p-world in C i
75 Scope Matters Assume (1): i is q-world - by hypothesis (if q)(must p) C,i = 1 - so D i q C must p C - i D i and so i must p C - so must p C,i = 1 which is to say C i p But wait! might p might q is true and so there must be a p-world in C i
76 Scope Matters Assume (1): i is q-world - by hypothesis (if q)(must p) C,i = 1 - so D i q C must p C - i D i and so i must p C - so must p C,i = 1 which is to say C i p But wait! might p might q is true and so there must be a p-world in C i
77 Scope Matters Assume (2): i is a p-world - by hypothesis (if p)(must q) C,i = 1 - so D i p C must q C - i D i and so i must q C - so must q C,i = 1 which is to say C i q But wait! might p might q is true and so there must be a q-world in C i
78 Scope Matters Assume (2): i is a p-world - by hypothesis (if p)(must q) C,i = 1 - so D i p C must q C - i D i and so i must q C - so must q C,i = 1 which is to say C i q But wait! might p might q is true and so there must be a q-world in C i
79 Scope Matters Assume (2): i is a p-world - by hypothesis (if p)(must q) C,i = 1 - so D i p C must q C - i D i and so i must q C - so must q C,i = 1 which is to say C i q But wait! might p might q is true and so there must be a q-world in C i
80 Scope Matters Assume (2): i is a p-world - by hypothesis (if p)(must q) C,i = 1 - so D i p C must q C - i D i and so i must q C - so must q C,i = 1 which is to say C i q But wait! might p might q is true and so there must be a q-world in C i
81 Scope Matters WS (Facts #2 + #3) If we WS then ways that might square with one of these pretty much rules out squaring with the other
82 Scope Matters Egalitarianism vs. Chauvinism Some theories say choosing relevant worlds from behind a veil of ignorance shouldn t affect what gets chosen Egalitarianism Domains invariant across worlds compatible with C - whenever j C i then D i = D j Chauvinism Not egalitarianism - sometimes j C i but D i D j
83 Scope Matters Egalitarianism vs. Chauvinism Some theories say choosing relevant worlds from behind a veil of ignorance shouldn t affect what gets chosen Egalitarianism Domains invariant across worlds compatible with C - whenever j C i then D i = D j Chauvinism Not egalitarianism - sometimes j C i but D i D j
84 Scope Matters Back to Fact #2 (14) a. For (5a) If Carl is at the party, then Lenny must be at the party must (if p)(q) b. For (5b) If Carl is at the party, then Lenny is at the party (if p)(q)
85 Scope Matters Back to Fact #2 (14) a. For (5a) If Carl is at the party, then Lenny must be at the party must (if p)(q) b. For (5b) If Carl is at the party, then Lenny is at the party (if p)(q)
86 Scope Matters WS + Chauvinism Fact #2 The reason is simple: - Fact #2 requires (5a) (5b) - WS requires must (if p)(q) (if p)(q) - Chauvinism implies that D i C i - So must (if p)(q) says something stronger than (if p)(q)
87 Scope Matters WS + Chauvinism Fact #2 The reason is simple: - Fact #2 requires (5a) (5b) - WS requires must (if p)(q) (if p)(q) - Chauvinism implies that D i C i - So must (if p)(q) says something stronger than (if p)(q)
88 Scope Matters Egalitarianism and Covering Covering D i covers C i iff D i = C i - Egalitarianism implies that D i always covers C i - Covering implies that worlds in C i agree on (if p)(q) C
89 Scope Matters Egalitarianism and Covering Covering D i covers C i iff D i = C i - Egalitarianism implies that D i always covers C i - Covering implies that worlds in C i agree on (if p)(q) C
90 Scope Matters Back to Fact #3 Whatever your thoughts you don t think TFAE (15) a. If my team wins out, they might win it all might (if p)(q) b. It might turn out that my team wins out and wins it all might(p q) c. If my team wins out, they re gonna win it all must (if p)(q)
91 Scope Matters WS + Egalitarianism Triviality (and so Fact #3) - Covering implies - might (if p)(q) C,i = 1 iff must (if p)(q) C,i = 1 - WS + Egalitarianism imply - If S 1, might S 2 If S 1, must S 2 Maybe S 1 and S 2
92 Iffiness Lost Iffiness Lost
93 Iffiness Lost Bad? (Yes) How Bad? (Very) Assuming iffiness means having to sort out scopes and there s no good one-size way to do that Ditching iffiness makes life a lot easier
94 Iffiness Lost Kratzer s Thesis The history of the conditional is the history of a syntactic mistake. There is no two-place if... then connective in the logical forms for natural languages. If -clauses are devices for restricting the domains of various operators.
95 Iffiness Lost Anti-iffiness (Sketch) Modal Force, Amended - might(p)(q) C,i = 1 iff (C i p ) q C - must(p)(q) C,i = 1 iff (C i p ) q C (... requiring p to be compatible with C i for definedness)
96 Iffiness Lost Anti-iffiness (Still Sketching) Assume... - When no restrictor is explicit in a modal, fill first argument with - Job of if -clause makes non-trivial restrictor explicit - If there s no overt modal, take it to be a covert must
97 Iffiness Lost Ouch Predicting Facts #1 through #3 is now wicked easy
98 Iffiness Lost Fact #1: These Are Consistent - might( )(p) might( )(q) - must( p)(q) - must( q)(p) Unrestricted modals say some worlds in C i are p-worlds and some are q-worlds... Restricted modals say all worlds in C i p are q-worlds and all worlds in C i q are p-worlds
99 Iffiness Lost Fact #2 Bare if and must-version get same LF - must(p)(q) That makes it hard for their truth-conditions to come apart
100 Iffiness Lost Fact #3 It s modals all the way down - might( )(p q) - might(p)(q) The first says that some worlds in C i are (p q)-worlds and the second says that some p-worlds in C i are q-worlds
101 Iffiness Regained Iffiness Regained
102 Iffiness Regained Iffiness Redux We said iffiness requires that (if p)(q) at i in C expresses some relation R between D i P and Q, where P and Q are the antecedent and consequent worlds We assumed that Q = q C just because the if was issued in C
103 Iffiness Regained Iffiness Redux We said iffiness requires that (if p)(q) at i in C expresses some relation R between D i P and Q, where P and Q are the antecedent and consequent worlds We assumed that Q = q C just because the if was issued in C
104 Iffiness Regained Ramsey Test (My Version of Schoolyard Version) An indicative is true in a context iff adding information of its antecedent to that context results in a situation in which the consequent is true
105 Iffiness Regained Two Jobs Thus Assigned to If -clause Job One constrain set of worlds where we check if q is true Index Shifting Job Two constrain context against which we check if q is true Context Shifting
106 Iffiness Regained Two Jobs Thus Assigned to If -clause Job One constrain set of worlds where we check if q is true Index Shifting Job Two constrain context against which we check if q is true Context Shifting
107 Iffiness Regained Two Jobs Thus Assigned to If -clause Job One constrain set of worlds where we check if q is true Index Shifting Job Two constrain context against which we check if q is true Context Shifting
108 Iffiness Regained Ramseyan Iffiness (Gloss) (16) If such-and-such, then thus-and-so is true at i wrt C iff all such-and-such worlds in C i are worlds at which thus-and-so is true Question What context is relevant for seeing if thus-and-so is true at the antecedent possibilities in C i? Answer The (Ramseyan) derived or subordinate context C + p got by taking C and hypothetically adding the information that such-and-such to it
109 Iffiness Regained Ramseyan Iffiness (Gloss) (16) If such-and-such, then thus-and-so is true at i wrt C iff all such-and-such worlds in C i are worlds at which thus-and-so is true Question What context is relevant for seeing if thus-and-so is true at the antecedent possibilities in C i? Answer The (Ramseyan) derived or subordinate context C + p got by taking C and hypothetically adding the information that such-and-such to it
110 Iffiness Regained Ramseyan Iffiness Iffiness + Shiftiness - (if p)(q) C,i = 1 iff C i p C q C+p - C + p = λi.c i p C (... assuming definedness, of course)
111 Iffiness Regained Shiftiness 2 Index Truth value of some sentences at an index in a context depends on truth value of some constituents at other indices Context Truth value of some sentences at an index in a context depends on truth value of some constituents at other contexts
112 Iffiness Regained Facts Neatly Align All we need is to narrowscope the modals and the predictions follow pretty much straightaway
113 Iffiness Regained Fact #1: if not-q, then must p Let C i = {i, j} - i a (p q)-world - j a (q p)-world (if q)(must p) C,i = 1 iff - all worlds in C i q are in must p C+ q - i is the only one in C i q... and it s a p-world
114 Iffiness Regained Fact #1: if not-q, then must p Let C i = {i, j} - i a (p q)-world - j a (q p)-world (if q)(must p) C,i = 1 iff - all worlds in C i q are in must p C+ q - i is the only one in C i q... and it s a p-world
115 Iffiness Regained Fact #1: if not-q, then must p Let C i = {i, j} - i a (p q)-world - j a (q p)-world (if q)(must p) C,i = 1 iff - all worlds in C i q are in must p C+ q - i is the only one in C i q... and it s a p-world
116 Iffiness Regained Fact #1: if not-q, then must p Let C i = {i, j} - i a (p q)-world - j a (q p)-world (if q)(must p) C,i = 1 iff - all worlds in C i q are in must p C+ q - i is the only one in C i q... and it s a p-world
117 Iffiness Regained Fact #2: Bare-to-must (if p)(q) C,i = 1 implies - All p-worlds in C i are q-worlds - Each of them is such that must q C+p,j = 1 - Well-behavedness implies every world in C i is such that must q C+p,j = 1
118 Iffiness Regained Fact #2: Bare-to-must (if p)(q) C,i = 1 implies - All p-worlds in C i are q-worlds - Each of them is such that must q C+p,j = 1 - Well-behavedness implies every world in C i is such that must q C+p,j = 1
119 Iffiness Regained Fact #3: if /might-to-might/and (if p)(might q) C,i = 1 iff - If j is a p-world in C i then might q C+p,j = 1 Well-behavedness guarantees that - j, k C i p implies (C + p) j = (C + p) k = C i p
120 Iffiness Regained Fact #3: Continued Putting all that together - If there s a q-world in (C + p) j then might q C+p is true throughout C i p - So (if p)(might q) true iff there s a q-world in C i p
121 Iffiness Regained Still Old School - if expresses - That s true no matter the consequent - bare, universal modal, or existential modal - Uniform LFs and if /modal interaction - Facts fall out of compositional interaction of and quantificational view of modals - That s (tragically) hip
122 Iffiness Regained Still Old School - if expresses - That s true no matter the consequent - bare, universal modal, or existential modal - Uniform LFs and if /modal interaction - Facts fall out of compositional interaction of and quantificational view of modals - That s (tragically) hip
123 Iffiness Regained Still Old School - if expresses - That s true no matter the consequent - bare, universal modal, or existential modal - Uniform LFs and if /modal interaction - Facts fall out of compositional interaction of and quantificational view of modals - That s (tragically) hip
124 Iffiness Regained Still Old School - if expresses - That s true no matter the consequent - bare, universal modal, or existential modal - Uniform LFs and if /modal interaction - Facts fall out of compositional interaction of and quantificational view of modals - That s (tragically) hip
125 Bonus Material Bonus Material
126 Bonus Material And Now for Something Completely Different Q What does a program or recipe π mean? A What it does - that is, π should be the set of pairs X, Y st doing π in X gets you to Y Suppose we said formulas of L are like that? They mean what they do to sets of worlds (full-stop)
127 Bonus Material And Now for Something Completely Different Q What does a program or recipe π mean? A What it does - that is, π should be the set of pairs X, Y st doing π in X gets you to Y Suppose we said formulas of L are like that? They mean what they do to sets of worlds (full-stop)
128 Bonus Material And Now for Something Completely Different Q What does a program or recipe π mean? A What it does - that is, π should be the set of pairs X, Y st doing π in X gets you to Y Suppose we said formulas of L are like that? They mean what they do to sets of worlds (full-stop)
129 Bonus Material And Now for Something Completely Different Q What does a program or recipe π mean? A What it does - that is, π should be the set of pairs X, Y st doing π in X gets you to Y Suppose we said formulas of L are like that? They mean what they do to sets of worlds (full-stop)
130 Bonus Material CCP s (If -free) Take s to be a set of worlds - s[p atomic ] = {i s : i(p atomic ) = 1} - s[ p] = s \ s[p] - s[p q] = s[p][q] - s[might p] = {i s : s[p] } - p is true in s iff s[p] = s
131 Bonus Material CCP s (If -free) Take s to be a set of worlds - s[p atomic ] = {i s : i(p atomic ) = 1} - s[ p] = s \ s[p] - s[p q] = s[p][q] - s[might p] = {i s : s[p] } - p is true in s iff s[p] = s
132 Bonus Material CCP s (Part Two) - s[(if p)(q)] = {i s : q is true in s[p]} (Assuming definedness, of course) Implies - (if p)(q) is true in s iff q is true in s[p]
133 Bonus Material CCP s (Part Two) - s[(if p)(q)] = {i s : q is true in s[p]} (Assuming definedness, of course) Implies - (if p)(q) is true in s iff q is true in s[p]
134 Bonus Material BOGOF Let C i = s and j s Obs #1 Then (C + p) j = s[p] Obs #2 Thus (if p)(q) is true at i in C iff it s true in s full-stop
135 Bonus Material Highlight Reel - We can still be Old School (Yay Chuck Taylors) - Price of iffiness is shiftiness - Dynamics gratis - Other goodies, too
136 00:00.00
Iffiness. Anthony S. Gillies
cuurent: 06.17.2008 initial: 05.2006 thony@umich.edu www.umich.edu/~thony Iffiness Anthony S. Gillies 1 An iffy thesis One thing language is good for is imparting plain and simple information: there is
More informationHedging Your Ifs and Vice Versa
Hedging Your Ifs and Vice Versa Kai von Fintel and Anthony S. Gillies MIT and Rutgers November 21 University of Latvia Ramsey s Test If two people are arguing If p will q? and are both in doubt as to p,
More informationIndicative conditionals
Indicative conditionals PHIL 43916 November 14, 2012 1. Three types of conditionals... 1 2. Material conditionals... 1 3. Indicatives and possible worlds... 4 4. Conditionals and adverbs of quantification...
More informationMust... stay... strong!
Alex Goebel 620 Spring 2016 Paper Presentation of von Fintel & Gillies (2010) Synopsis Must... stay... strong! Von Fintel & Gillies (vf&g) argue against a weakened semantics of must and propose an alternative
More informationComments on Conditional propositions and conditional assertions
Comments on Conditional propositions and conditional assertions (An)Thony Gillies Department of Philosophy University of Michigan Context and Content Workshop LSA Institute, July 2005 The Murder Case Suspects:
More informationFirst-Degree Entailment
March 5, 2013 Relevance Logics Relevance logics are non-classical logics that try to avoid the paradoxes of material and strict implication: p (q p) p (p q) (p q) (q r) (p p) q p (q q) p (q q) Counterintuitive?
More informationDeontic Logic and Meta-Ethics
Deontic Logic and Meta-Ethics Deontic Logic as been a field in which quite apart from the questions of antinomies "paradoxes" have played a decisive roles, since the field has been invented. These paradoxes
More informationPropositional Logic: Syntax
4 Propositional Logic: Syntax Reading: Metalogic Part II, 22-26 Contents 4.1 The System PS: Syntax....................... 49 4.1.1 Axioms and Rules of Inference................ 49 4.1.2 Definitions.................................
More informationIndicative Conditionals
Indicative Conditionals Anthony S. Gillies Rutgers University 1 The Target Sometimes philosophy gets started by pointing. Carving out the target for theories of indicative conditionals is a case in point.
More informationMathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 15 Propositional Calculus (PC)
Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras Lecture - 15 Propositional Calculus (PC) So, now if you look back, you can see that there are three
More informationNatural deduction for truth-functional logic
Natural deduction for truth-functional logic Phil 160 - Boston University Why natural deduction? After all, we just found this nice method of truth-tables, which can be used to determine the validity or
More informationMarch 2, 2007 Menéndez-Benito. Quick Introduction to the Semantics of Modals 1
Quick Introduction to the Semantics of Modals 1 Syntactic assumptions (following von Fintel & Heim 2005): modals are raising predicates (see Wurmbrand 1999, Bhatt 1998) 1) John must go home. 2) [John [λ
More informationPhilosophy 244: Modal Logic Preliminaries
Philosophy 244: Modal Logic Preliminaries By CI Lewis in his 1910 Harvard dis- sertation The Place of Intuition in Knowledge (advised by Josiah Royce). Lewis credits earlier work of Hugh MacColl s. What
More informationSupplementary Logic Notes CSE 321 Winter 2009
1 Propositional Logic Supplementary Logic Notes CSE 321 Winter 2009 1.1 More efficient truth table methods The method of using truth tables to prove facts about propositional formulas can be a very tedious
More informationCompleteness in the Monadic Predicate Calculus. We have a system of eight rules of proof. Let's list them:
Completeness in the Monadic Predicate Calculus We have a system of eight rules of proof. Let's list them: PI At any stage of a derivation, you may write down a sentence φ with {φ} as its premiss set. TC
More informationIntensional semantics: worlds, modals, conditionals
Intensional semantics: worlds, modals, conditionals 1 Limitations of the actual world Recall some assumptions we have followed in this class: Sentences are conditional truth values ( 1 iff truth condition]
More informationPhilosophy 244: #8 Counterfactuals, Neighborhood Semantics, Probability, Predicative Necessity, etc.
Philosophy 244: #8 Counterfactuals, Neighborhood Semantics, Probability, Predicative Necessity, etc. Modal operators are non-truth-functional; the truth-value of α at a world is not determined by α s s
More informationCapturing Lewis s Elusive Knowledge
Zhaoqing Xu Department of Philosophy, Peking University zhaoqingxu@gmail.com September 22, 2011 1 Introduction 2 Philosophical Background Dretske s Relevant Alternatives Theory Lewis s Elusive Knowledge
More informationAxiomatic systems. Revisiting the rules of inference. Example: A theorem and its proof in an abstract axiomatic system:
Axiomatic systems Revisiting the rules of inference Material for this section references College Geometry: A Discovery Approach, 2/e, David C. Kay, Addison Wesley, 2001. In particular, see section 2.1,
More informationModal and temporal logic
Modal and temporal logic N. Bezhanishvili I. Hodkinson C. Kupke Imperial College London 1 / 83 Overview Part II 1 Soundness and completeness. Canonical models. 3 lectures. 2 Finite model property. Filtrations.
More informationProof Techniques (Review of Math 271)
Chapter 2 Proof Techniques (Review of Math 271) 2.1 Overview This chapter reviews proof techniques that were probably introduced in Math 271 and that may also have been used in a different way in Phil
More informationLing 98a: The Meaning of Negation (Week 5)
Yimei Xiang yxiang@fas.harvard.edu 15 October 2013 1 Review Negation in propositional logic, oppositions, term logic of Aristotle Presuppositions Projection and accommodation Three-valued logic External/internal
More informationModal Logics. Most applications of modal logic require a refined version of basic modal logic.
Modal Logics Most applications of modal logic require a refined version of basic modal logic. Definition. A set L of formulas of basic modal logic is called a (normal) modal logic if the following closure
More informationThe Semantics of Questions Introductory remarks
MIT, September-October 2012 1 1. Goals for this class The Semantics of Questions Introductory remarks (1) a. Which boy (among John, Bill and Fred) read the book? Uniqueness presupposition (UP): exactly
More informationThe Converse of Deducibility: C.I. Lewis and the Origin of Modern AAL/ALC Modal 2011 Logic 1 / 26
The Converse of Deducibility: C.I. Lewis and the Origin of Modern Modal Logic Edwin Mares Victoria University of Wellington AAL/ALC 2011 The Converse of Deducibility: C.I. Lewis and the Origin of Modern
More informationProofs: A General How To II. Rules of Inference. Rules of Inference Modus Ponens. Rules of Inference Addition. Rules of Inference Conjunction
Introduction I Proofs Computer Science & Engineering 235 Discrete Mathematics Christopher M. Bourke cbourke@cse.unl.edu A proof is a proof. What kind of a proof? It s a proof. A proof is a proof. And when
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationLa logique des conditionnels. Rentrée Cogmaster
La logique des conditionnels Rentrée Cogmaster M. Cozic & P. Egré IHPST/Paris 1, CNRS, DEC-ENS IJN, CNRS, DEC-ENS What are conditional sentences? If P then Q (1) If it s a square, then it s rectangle.
More informationSpring 2017 Ling 620 The Semantics of Control Infinitives: A First Introduction to De Se Attitudes
The Semantics of Control Infinitives: A First Introduction to De Se Attitudes 1. Non-Finite Control Complements and De Se Attitudes (1) Two Sentences that Seem Very Close in Meaning a. Dave expects he
More informationSemantics and Generative Grammar. Quantificational DPs, Part 3: Covert Movement vs. Type Shifting 1
Quantificational DPs, Part 3: Covert Movement vs. Type Shifting 1 1. Introduction Thus far, we ve considered two competing analyses of sentences like those in (1). (1) Sentences Where a Quantificational
More informationInference and Proofs (1.6 & 1.7)
EECS 203 Spring 2016 Lecture 4 Page 1 of 9 Introductory problem: Inference and Proofs (1.6 & 1.7) As is commonly the case in mathematics, it is often best to start with some definitions. An argument for
More informationIntroduction to Semantics. The Formalization of Meaning 1
The Formalization of Meaning 1 1. Obtaining a System That Derives Truth Conditions (1) The Goal of Our Enterprise To develop a system that, for every sentence S of English, derives the truth-conditions
More informationPropositional Logic Review
Propositional Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane The task of describing a logical system comes in three parts: Grammar Describing what counts as a formula Semantics Defining
More informationIntermediate Logic. Natural Deduction for TFL
Intermediate Logic Lecture Two Natural Deduction for TFL Rob Trueman rob.trueman@york.ac.uk University of York The Trouble with Truth Tables Natural Deduction for TFL The Trouble with Truth Tables The
More informationMichael Franke Fritz Hamm. January 26, 2011
Michael Franke Fritz Hamm Seminar für Sprachwissenschaft January 26, 2011 Three n would, p would, l would, n might p might l might Basic intuition (1) If that match had been scratched, it would have lighted.
More informationSpring 2017 Ling 620. The Semantics of Modals, Part 3: The Ordering Source 1
1. On Our Last Episode The Semantics of Modals, Part 3: The Ordering Source 1 We developed a semantics for modal auxiliaries in English, that achieved the goals in (1). (1) Overarching Analytic Goal A
More informationMathematics 114L Spring 2018 D.A. Martin. Mathematical Logic
Mathematics 114L Spring 2018 D.A. Martin Mathematical Logic 1 First-Order Languages. Symbols. All first-order languages we consider will have the following symbols: (i) variables v 1, v 2, v 3,... ; (ii)
More informationSystems of modal logic
499 Modal and Temporal Logic Systems of modal logic Marek Sergot Department of Computing Imperial College, London utumn 2008 Further reading: B.F. Chellas, Modal logic: an introduction. Cambridge University
More informationRelevant Logic. Daniel Bonevac. March 20, 2013
March 20, 2013 The earliest attempts to devise a relevance logic that avoided the problem of explosion centered on the conditional. FDE, however, has no conditional operator, or a very weak one. If we
More information127: Lecture notes HT17. Week 8. (1) If Oswald didn t shoot Kennedy, someone else did. (2) If Oswald hadn t shot Kennedy, someone else would have.
I. Counterfactuals I.I. Indicative vs Counterfactual (LfP 8.1) The difference between indicative and counterfactual conditionals comes out in pairs like the following: (1) If Oswald didn t shoot Kennedy,
More informationKaplan s Paradox and Epistemically Possible Worlds
Kaplan s Paradox and Epistemically Possible Worlds 1. Epistemically possible worlds David Chalmers Metaphysically possible worlds: S is metaphysically possible iff S is true in some metaphysically possible
More informationOn the Deeply Contingent A Priori. David J. Chalmers
On the Deeply Contingent A Priori David J. Chalmers Contingent A Priori n Julius invented the zip (if anyone did) n Stick S is one meter long (if it exists) Deep Necessity n Evans: Julius invented the
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationScalar Implicatures: Are There Any?
Scalar Implicatures: Are There Any? Angelika Kratzer University of Massachusetts at Amherst Workshop on Polarity, Scalar Phenomena, and Implicatures. University of Milan-Bicocca June 18, 2003 1 The cast
More informationFORMAL PROOFS DONU ARAPURA
FORMAL PROOFS DONU ARAPURA This is a supplement for M385 on formal proofs in propositional logic. Rather than following the presentation of Rubin, I want to use a slightly different set of rules which
More informationHomogeneity and Plurals: From the Strongest Meaning Hypothesis to Supervaluations
Homogeneity and Plurals: From the Strongest Meaning Hypothesis to Supervaluations Benjamin Spector IJN, Paris (CNRS-EHESS-ENS) Sinn und Bedeutung 18 Sept 11 13, 2013 1 / 40 The problem (1) Peter solved
More informationTutorial Exercises 1 (mjs)
499 Modal and Temporal Logic Autumn 2008 Tutorial Exercises 1 (mjs) 1. Suppose that Σ is closed under RM. SOLUTIONS Suppose first that Σ contains C. A derivation of K: 1. Σ (A (A B) ) B PL 2. Σ (A (A B)
More informationProofs. Introduction II. Notes. Notes. Notes. Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry. Fall 2007
Proofs Slides by Christopher M. Bourke Instructor: Berthe Y. Choueiry Fall 2007 Computer Science & Engineering 235 Introduction to Discrete Mathematics Sections 1.5, 1.6, and 1.7 of Rosen cse235@cse.unl.edu
More informationMathematics for Computer Science Exercises from Chapter 3
Mathematics for Computer Science Exercises from Chapter 3 Silvio Capobianco Last update: 19 September 2018 Problems from Section 3.1 Problem 3.2. Your class has a textbook and a final exam. Let P, Q, and
More informationBasics of conversational implicatures
Semantics I, Rutgers University Week 12 Yimei Xiang November 19, 2018 1. Implication relations Basics of conversational implicatures Implication relations are inferential relations between sentences. A
More informationGeneralized Quantifiers Logical and Linguistic Aspects
Generalized Quantifiers Logical and Linguistic Aspects Lecture 1: Formal Semantics and Generalized Quantifiers Dag Westerståhl University of Gothenburg SELLC 2010 Institute for Logic and Cognition, Sun
More informationFirst Order Logic: Syntax and Semantics
CS1081 First Order Logic: Syntax and Semantics COMP30412 Sean Bechhofer sean.bechhofer@manchester.ac.uk Problems Propositional logic isn t very expressive As an example, consider p = Scotland won on Saturday
More informationPhilosophy 240 Symbolic Logic. Russell Marcus Hamilton College Fall 2013
Philosophy 240 Symbolic Logic Russell Marcus Hamilton College Fall 2013 Class #4 Philosophy Friday #1: Conditionals Marcus, Symbolic Logic, Fall 2013, Slide 1 Natural-Language Conditionals A. Indicative
More informationLogic I - Session 10 Thursday, October 15,
Logic I - Session 10 Thursday, October 15, 2009 1 Plan Re: course feedback Review of course structure Recap of truth-functional completeness? Soundness of SD Thursday, October 15, 2009 2 The course structure
More informationTitle: Logical Agents AIMA: Chapter 7 (Sections 7.4 and 7.5)
B.Y. Choueiry 1 Instructor s notes #12 Title: Logical Agents AIMA: Chapter 7 (Sections 7.4 and 7.5) Introduction to Artificial Intelligence CSCE 476-876, Fall 2018 URL: www.cse.unl.edu/ choueiry/f18-476-876
More informationRelational Reasoning in Natural Language
1/67 Relational Reasoning in Natural Language Larry Moss ESSLLI 10 Course on Logics for Natural Language Inference August, 2010 Adding transitive verbs the work on R, R, and other systems is joint with
More informationThe statement calculus and logic
Chapter 2 Contrariwise, continued Tweedledee, if it was so, it might be; and if it were so, it would be; but as it isn t, it ain t. That s logic. Lewis Carroll You will have encountered several languages
More informationPROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL
THOMAS HOFWEBER PROOF-THEORETIC REDUCTION AS A PHILOSOPHER S TOOL 1. PROOF-THEORETIC REDUCTION AND HILBERT S PROGRAM Hilbert s program in the philosophy of mathematics comes in two parts. One part is a
More informationCounterfactual Scorekeeping
Linguistics & Philosophy, to appear Counterfactual Scorekeeping Anthony S. Gillies University of Michigan July 3, 2007 1 Loophole Counterfactuals like (1) If Sophie had gone to the parade,
More informationHandout 8: Bennett, Chapter 10
Handout 8: Bennett, Chapter 10 Philosophy 691: Conditionals Northern Illinois University Fall 2011 Geoff Pynn terminology 1. Chapters 10-18 concern subjunctive conditionals, which Bennett distinguishes
More informationPropositions. c D. Poole and A. Mackworth 2010 Artificial Intelligence, Lecture 5.1, Page 1
Propositions An interpretation is an assignment of values to all variables. A model is an interpretation that satisfies the constraints. Often we don t want to just find a model, but want to know what
More informationWhy Learning Logic? Logic. Propositional Logic. Compound Propositions
Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional
More informationModel Theory of Modal Logic Lecture 4. Valentin Goranko Technical University of Denmark
Model Theory of Modal Logic Lecture 4 Valentin Goranko Technical University of Denmark Third Indian School on Logic and its Applications Hyderabad, January 28, 2010 Model Theory of Modal Logic Lecture
More informationLogic and Proofs 1. 1 Overview. 2 Sentential Connectives. John Nachbar Washington University December 26, 2014
John Nachbar Washington University December 26, 2014 Logic and Proofs 1 1 Overview. These notes provide an informal introduction to some basic concepts in logic. For a careful exposition, see, for example,
More informationDiscrete Structures Proofwriting Checklist
CS103 Winter 2019 Discrete Structures Proofwriting Checklist Cynthia Lee Keith Schwarz Now that we re transitioning to writing proofs about discrete structures like binary relations, functions, and graphs,
More informationTo every formula scheme there corresponds a property of R. This relationship helps one to understand the logic being studied.
Modal Logic (2) There appeared to be a correspondence between the validity of Φ Φ and the property that the accessibility relation R is reflexive. The connection between them is that both relied on the
More informationChapter 1: The Logic of Compound Statements. January 7, 2008
Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive
More informationIntroducing Proof 1. hsn.uk.net. Contents
Contents 1 1 Introduction 1 What is proof? 1 Statements, Definitions and Euler Diagrams 1 Statements 1 Definitions Our first proof Euler diagrams 4 3 Logical Connectives 5 Negation 6 Conjunction 7 Disjunction
More informationPresuppositions (introductory comments)
1 Presuppositions (introductory comments) Some examples (1) a. The person who broke the typewriter was Sam. b. It was Sam who broke the typewriter. c. John screwed up again. d. John likes Mary, too. e.
More informationConditional Logic and Belief Revision
Conditional Logic and Belief Revision Ginger Schultheis (vks@mit.edu) and David Boylan (dboylan@mit.edu) January 2017 History The formal study of belief revision grew out out of two research traditions:
More informationProving Completeness for Nested Sequent Calculi 1
Proving Completeness for Nested Sequent Calculi 1 Melvin Fitting abstract. Proving the completeness of classical propositional logic by using maximal consistent sets is perhaps the most common method there
More informationDiscrete Mathematics for CS Fall 2003 Wagner Lecture 3. Strong induction
CS 70 Discrete Mathematics for CS Fall 2003 Wagner Lecture 3 This lecture covers further variants of induction, including strong induction and the closely related wellordering axiom. We then apply these
More informationWeek 2: Defining Computation
Computational Complexity Theory Summer HSSP 2018 Week 2: Defining Computation Dylan Hendrickson MIT Educational Studies Program 2.1 Turing Machines Turing machines provide a simple, clearly defined way
More informationIntroduction to Pragmatics
Introduction to Pragmatics Summer 2016 Tuesdays 2:30--4:00pm @ 2321.HS 3H INSTRUCTOR Todor Koev (Todor.Koev@uni-duesseldorf.de) Presupposition projection Presupposition is a prevalent type of inference
More informationLECTURE 15: SIMPLE LINEAR REGRESSION I
David Youngberg BSAD 20 Montgomery College LECTURE 5: SIMPLE LINEAR REGRESSION I I. From Correlation to Regression a. Recall last class when we discussed two basic types of correlation (positive and negative).
More informationFormal Logic. Critical Thinking
ormal Logic Critical hinking Recap: ormal Logic If I win the lottery, then I am poor. I win the lottery. Hence, I am poor. his argument has the following abstract structure or form: If P then Q. P. Hence,
More information1 Propositional Logic
CS 2800, Logic and Computation Propositional Logic Lectures Pete Manolios Version: 384 Spring 2011 1 Propositional Logic The study of logic was initiated by the ancient Greeks, who were concerned with
More informationFinal Exam Theory Quiz Answer Page
Philosophy 120 Introduction to Logic Final Exam Theory Quiz Answer Page 1. (a) is a wff (and a sentence); its outer parentheses have been omitted, which is permissible. (b) is also a wff; the variable
More informationLogic. Propositional Logic: Syntax
Logic Propositional Logic: Syntax Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about
More informationAnnouncements. Today s Menu
Announcements Reading Assignment: > Nilsson chapters 13-14 Announcements: > LISP and Extra Credit Project Assigned Today s Handouts in WWW: > Homework 10-13 > Outline for Class 26 > www.mil.ufl.edu/eel5840
More informationTR : Possible World Semantics for First Order LP
City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2011 TR-2011010: Possible World Semantics for First Order LP Melvin Fitting Follow this and additional
More informationNotes from How to Prove it: A Structured Approach by Daniel J. Velleman
Notes from How to Prove it: A Structured Approach by Daniel J. Velleman DeMorgan s laws: (P Q) is equivalent to P Q) (P Q) is equivalent to P Q) Commutative laws: (P Q) is equivalent to (Q P ) (P Q) is
More informationFormal (natural) deduction in propositional logic
Formal (natural) deduction in propositional logic Lila Kari University of Waterloo Formal (natural) deduction in propositional logic CS245, Logic and Computation 1 / 67 I know what you re thinking about,
More informationA Way of Getting Rid of Things:
A Way of Getting Rid of Things: Higher-order Langauges, Priorian Nominalism, and Nihilism: Cian Dorr Rutgers Workshop on Structural Realism and the Metaphysics of Science 1. Higher-order quantification
More informationP, NP, NP-Complete. Ruth Anderson
P, NP, NP-Complete Ruth Anderson A Few Problems: Euler Circuits Hamiltonian Circuits Intractability: P and NP NP-Complete What now? Today s Agenda 2 Try it! Which of these can you draw (trace all edges)
More informationTruth-Functional Logic
Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence
More informationCanonical models for normal logics (Completeness via canonicity)
499 Modal and Temporal Logic Canonical models for normal logics (Completeness via canonicity) Marek Sergot Department of Computing Imperial College, London Autumn 2008 Further reading: B.F. Chellas, Modal
More informationProbability, Statistics, and Bayes Theorem Session 3
Probability, Statistics, and Bayes Theorem Session 3 1 Introduction Now that we know what Bayes Theorem is, we want to explore some of the ways that it can be used in real-life situations. Often the results
More informationModal Logic XX. Yanjing Wang
Modal Logic XX Yanjing Wang Department of Philosophy, Peking University May 6th, 2016 Advanced Modal Logic (2016 Spring) 1 Completeness A traditional view of Logic A logic Λ is a collection of formulas
More informationSeminar in Semantics: Gradation & Modality Winter 2014
1 Subject matter Seminar in Semantics: Gradation & Modality Winter 2014 Dan Lassiter 1/8/14 Handout: Basic Modal Logic and Kratzer (1977) [M]odality is the linguistic phenomenon whereby grammar allows
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationMATH 22 INFERENCE & QUANTIFICATION. Lecture F: 9/18/2003
MATH 22 Lecture F: 9/18/2003 INFERENCE & QUANTIFICATION Sixty men can do a piece of work sixty times as quickly as one man. One man can dig a post-hole in sixty seconds. Therefore, sixty men can dig a
More informationLecture 4: Constructing the Integers, Rationals and Reals
Math/CS 20: Intro. to Math Professor: Padraic Bartlett Lecture 4: Constructing the Integers, Rationals and Reals Week 5 UCSB 204 The Integers Normally, using the natural numbers, you can easily define
More informationReferences A CONSTRUCTIVE INTRODUCTION TO FIRST ORDER LOGIC. The Starting Point. Goals of foundational programmes for logic:
A CONSTRUCTIVE INTRODUCTION TO FIRST ORDER LOGIC Goals of foundational programmes for logic: Supply an operational semantic basis for extant logic calculi (ex post) Rational reconstruction of the practice
More informationModal Dependence Logic
Modal Dependence Logic Jouko Väänänen Institute for Logic, Language and Computation Universiteit van Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam, The Netherlands J.A.Vaananen@uva.nl Abstract We
More informationKRIPKE S THEORY OF TRUTH 1. INTRODUCTION
KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed
More informationKB Agents and Propositional Logic
Plan Knowledge-Based Agents Logics Propositional Logic KB Agents and Propositional Logic Announcements Assignment2 mailed out last week. Questions? Knowledge-Based Agents So far, what we ve done is look
More informationCHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC
1 CHAPTER 6 - THINKING ABOUT AND PRACTICING PROPOSITIONAL LOGIC Here, you ll learn: what it means for a logic system to be finished some strategies for constructing proofs Congratulations! Our system of
More informationA Quick Lesson on Negation
A Quick Lesson on Negation Several of the argument forms we have looked at (modus tollens and disjunctive syllogism, for valid forms; denying the antecedent for invalid) involve a type of statement which
More informationMetaphysics of Modality
Metaphysics of Modality Lecture 3: Abstract Modal Realism/Actualism Daisy Dixon dd426 1. Introduction Possible worlds are abstract and actual 1. Introduction Possible worlds are abstract and actual There
More information