Generality & Existence II
|
|
- Agatha Spencer
- 5 years ago
- Views:
Transcription
1 Generality & Existence II Modality & Quantifiers Greg Restall arché, st andrews 2 december 2015
2 My Aim To analyse the quantifiers Greg Restall Generality & Existence II 2 of 60
3 My Aim To analyse the quantifiers (including their interactions with modals) Greg Restall Generality & Existence II 2 of 60
4 My Aim To analyse the quantifiers (including their interactions with modals) using the tools of proof theory Greg Restall Generality & Existence II 2 of 60
5 My Aim To analyse the quantifiers (including their interactions with modals) using the tools of proof theory in order to better understand quantification, existence and identity. Greg Restall Generality & Existence II 2 of 60
6 My Aim for This Talk Understanding the interactions between quantifiers and modal operators. Greg Restall Generality & Existence II 3 of 60
7 Today's Plan Sequents & Defining Rules Hypersequents & Defining Rules Quantification & the Barcan Formula Positions & Models Consequences & Questions Greg Restall Generality & Existence II 4 of 60
8 sequents & defining rules
9 Sequents Γ Don t assert each element of Γ and deny each element of. Greg Restall Generality & Existence II 6 of 60
10 Structural Rules Identity: A A Greg Restall Generality & Existence II 7 of 60
11 Structural Rules Identity: Weakening: A A Γ Γ, A Γ Γ A, Greg Restall Generality & Existence II 7 of 60
12 Structural Rules Identity: Weakening: A A Γ Γ, A Γ Γ A, Contraction: Γ, A, A Γ, A Γ A, A, Γ A, Greg Restall Generality & Existence II 7 of 60
13 Structural Rules Identity: Weakening: A A Γ Γ, A Γ Γ A, Contraction: Γ, A, A Γ, A Γ A, A, Γ A, Cut: Γ A, Γ, A Γ Greg Restall Generality & Existence II 7 of 60
14 Structural Rules Identity: Weakening: A A Γ Γ, A Γ Γ A, Contraction: Γ, A, A Γ, A Γ A, A, Γ A, Γ A, Γ, A Cut: Γ Structural rules govern declarative sentences as such. Greg Restall Generality & Existence II 7 of 60
15 Giving the Meaning of a Logical Constant With Left/Right rules? Γ, A, B [ L] Γ, A B Γ A, Γ B, [ R] Γ A B, Greg Restall Generality & Existence II 8 of 60
16 Giving the Meaning of a Logical Constant With Left/Right rules? Γ, A, B [ L] Γ, A B Γ A, Γ B, [ R] Γ A B, Γ, B Γ, A tonk B [tonkl] Γ A, Γ A tonk B, [tonkr] Greg Restall Generality & Existence II 8 of 60
17 What is involved in going from L to L? Use L to define L. Greg Restall Generality & Existence II 9 of 60
18 What is involved in going from L to L? Use L to define L. Desideratum #1: L is conservative: ( L ) L is L. Greg Restall Generality & Existence II 9 of 60
19 What is involved in going from L to L? Use L to define L. Desideratum #1: L is conservative: ( L ) L is L. Desideratum #2: Concepts are defined uniquely. Greg Restall Generality & Existence II 9 of 60
20 A Defining Rule Γ, A, B ========== [ Df ] Γ, A B Greg Restall Generality & Existence II 10 of 60
21 A Defining Rule Γ, A, B ========== [ Df ] Γ, A B Fully specifies norms governing conjunctions on the left in terms of simpler vocabulary. Greg Restall Generality & Existence II 10 of 60
22 A Defining Rule Γ, A, B ========== [ Df ] Γ, A B Fully specifies norms governing conjunctions on the left in terms of simpler vocabulary. Identity and Cut determine the behaviour of conjunctions on the right. Greg Restall Generality & Existence II 10 of 60
23 From [ Df] to [ L/R] [Id] A B A B [ Df ] Γ B, A, B A B [Cut] Γ A, Γ, A A B, [Cut] Γ A B, Greg Restall Generality & Existence II 11 of 60
24 From [ Df] to [ L/R] [Id] A B A B [ Df ] Γ B, A, B A B [Cut] Γ A, Γ, A A B, [Cut] Γ A B, Greg Restall Generality & Existence II 11 of 60
25 From [ Df] to [ L/R] [Id] A B A B [ Df ] Γ B, A, B A B [Cut] Γ A, Γ, A A B, [Cut] Γ A B, Greg Restall Generality & Existence II 11 of 60
26 From [ Df] to [ L/R] [Id] A B A B [ Df ] Γ B, A, B A B [Cut] Γ A, Γ, A A B, [Cut] Γ A B, Greg Restall Generality & Existence II 11 of 60
27 From [ Df] to [ L/R] [Id] A B A B [ Df ] Γ B, A, B A B [Cut] Γ A, Γ, A A B, [Cut] Γ A B, Γ A, Γ B, [ R] Γ A B, Greg Restall Generality & Existence II 11 of 60
28 And Back A A B B [ R] A, B A B Γ, A B [Cut] Γ, A, B Greg Restall Generality & Existence II 12 of 60
29 This works for more than the classical logical constants I want to see how this works for modal operators, and examine their interaction with the quantifiers. Greg Restall Generality & Existence II 13 of 60
30 Why this is important Explaining why the modal operators have the logical properties they exhibit is an open question. Greg Restall Generality & Existence II 14 of 60
31 possible worlds, in the sense of possible states of affairs are not really individuals (just as numbers are not really individuals). To say that a state of affairs obtains is just to say that something is the case; to say that something is a possible state of affairs is just to say that something could be the case; and to say that something is the case in a possible state of affairs is just to say that the thing in question would necessarily be the case if that state of affairs obtained, i.e. if something else were the case We understand truth in states of affairs because we understand necessarily ; not vice versa. Worlds, Times and Selves (1969)
32 I agree with Prior but a Priorean about possibility and worlds must address these issues: Greg Restall Generality & Existence II 16 of 60
33 I agree with Prior but a Priorean about possibility and worlds must address these issues: Why is it that modal concepts (which are conceptually prior to worlds) have a structure that fits possible worlds models? Greg Restall Generality & Existence II 16 of 60
34 I agree with Prior but a Priorean about possibility and worlds must address these issues: Why is it that modal concepts (which are conceptually prior to worlds) have a structure that fits possible worlds models? (Why does possibility distribute of disjunction, necessity over disjunction? Why do the modalities work like normal modal logics?) Greg Restall Generality & Existence II 16 of 60
35 I agree with Prior but a Priorean about possibility and worlds must address these issues: Why is it that modal concepts (which are conceptually prior to worlds) have a structure that fits possible worlds models? (Why does possibility distribute of disjunction, necessity over disjunction? Why do the modalities work like normal modal logics?) If modality is primitive we have no explanation. Greg Restall Generality & Existence II 16 of 60
36 I agree with Prior but a Priorean about possibility and worlds must address these issues: Why is it that modal concepts (which are conceptually prior to worlds) have a structure that fits possible worlds models? (Why does possibility distribute of disjunction, necessity over disjunction? Why do the modalities work like normal modal logics?) If modality is primitive we have no explanation. If modality is governed by the rules introduced here, then we can see why possible worlds are useful, and model the behaviour of modal concepts. Greg Restall Generality & Existence II 16 of 60
37 hypersequents & defining rules
38 Modal Reasoning involves Shifts Suppose it s necessary that p and necessary that q. Greg Restall Generality & Existence II 18 of 60
39 Modal Reasoning involves Shifts Suppose it s necessary that p and necessary that q. Is it necessary that both p and q? Greg Restall Generality & Existence II 18 of 60
40 Modal Reasoning involves Shifts Suppose it s necessary that p and necessary that q. Is it necessary that both p and q? Could we avoid p and q? Greg Restall Generality & Existence II 18 of 60
41 Modal Reasoning involves Shifts Suppose it s necessary that p and necessary that q. Is it necessary that both p and q? Could we avoid p and q? Consider any way it could go: Greg Restall Generality & Existence II 18 of 60
42 Modal Reasoning involves Shifts Suppose it s necessary that p and necessary that q. Is it necessary that both p and q? Could we avoid p and q? Consider any way it could go: Since it s necessary that p, here we have p. Greg Restall Generality & Existence II 18 of 60
43 Modal Reasoning involves Shifts Suppose it s necessary that p and necessary that q. Is it necessary that both p and q? Could we avoid p and q? Consider any way it could go: Since it s necessary that p, here we have p. Since it s necessary that q, here we have q. Greg Restall Generality & Existence II 18 of 60
44 Modal Reasoning involves Shifts Suppose it s necessary that p and necessary that q. Is it necessary that both p and q? Could we avoid p and q? Consider any way it could go: Since it s necessary that p, here we have p. Since it s necessary that q, here we have q. So, we have both p and q. Greg Restall Generality & Existence II 18 of 60
45 Modal Reasoning involves Shifts Suppose it s necessary that p and necessary that q. Is it necessary that both p and q? Could we avoid p and q? Consider any way it could go: Since it s necessary that p, here we have p. Since it s necessary that q, here we have q. So, we have both p and q. So, no matter how things go, we have p and q. Greg Restall Generality & Existence II 18 of 60
46 Modal Reasoning involves Shifts Suppose it s necessary that p and necessary that q. Is it necessary that both p and q? Could we avoid p and q? Consider any way it could go: Since it s necessary that p, here we have p. Since it s necessary that q, here we have q. So, we have both p and q. So, no matter how things go, we have p and q. So the conjunction p and q is necessary. Greg Restall Generality & Existence II 18 of 60
47 Exposing the Structure of that Deduction p, q p p, q q [ Df ] [ Df ] p, q p p, q q [ R] p, q p q [ Df ] p, q (p q) [ Df ] p q (p q) Greg Restall Generality & Existence II 19 of 60
48 Exposing the Structure of that Deduction p, q p p, q q [ Df ] [ Df ] p, q p p, q q [ R] p, q p q [ Df ] p, q (p q) [ Df ] p q (p q) Greg Restall Generality & Existence II 19 of 60
49 Exposing the Structure of that Deduction p, q p p, q q [ Df ] [ Df ] p, q p p, q q [ R] p, q p q [ Df ] p, q (p q) [ Df ] p q (p q) Greg Restall Generality & Existence II 19 of 60
50 Exposing the Structure of that Deduction p, q p p, q q [ Df ] [ Df ] p, q p p, q q [ R] p, q p q [ Df ] p, q (p q) [ Df ] p q (p q) Greg Restall Generality & Existence II 19 of 60
51 Exposing the Structure of that Deduction p, q p p, q q [ Df ] [ Df ] p, q p p, q q [ R] p, q p q [ Df ] p, q (p q) [ Df ] p q (p q) Greg Restall Generality & Existence II 19 of 60
52 Exposing the Structure of that Deduction p, q p p, q q [ Df ] [ Df ] p, q p p, q q [ R] p, q p q [ Df ] p, q (p q) [ Df ] p q (p q) Greg Restall Generality & Existence II 19 of 60
53 Exposing the Structure of that Deduction p, q p p, q q [ Df ] [ Df ] p, q p p, q q [ R] p, q p q [ Df ] p, q (p q) [ Df ] p q (p q) Greg Restall Generality & Existence II 19 of 60
54 Exposing the Structure of that Deduction p, q p p, q q [ Df ] [ Df ] p, q p p, q q [ R] p, q p q [ Df ] p, q (p q) [ Df ] p q (p q) Greg Restall Generality & Existence II 19 of 60
55 Hypersequents p, q p q Don t assert p and q in one zone and deny p q in another. Greg Restall Generality & Existence II 20 of 60
56 Hypersequents Γ Γ Don t assert each member of Γ and deny each member of in one zone and assert each member of Γ and deny each member of in another. Greg Restall Generality & Existence II 20 of 60
57 Two Kinds of Zone Shift indicative: suppose I m wrong and that... subjunctive: suppose things go differently. or had gone differently. Greg Restall Generality & Existence II 21 of 60
58 Two Kinds of Zone Shift Greg Restall Generality & Existence II 22 of 60
59 Two Kinds of Zone Shift Suppose Oswald didn t shoot JFK. Greg Restall Generality & Existence II 22 of 60
60 Two Kinds of Zone Shift Suppose Oswald didn t shoot JFK. Suppose Oswald hadn t shot JFK. Greg Restall Generality & Existence II 22 of 60
61 Philosophers Imprint,. STEREOSCOPIC VISION: Persons, Freedom, and Two Spaces of Material Inference Mark Lance Georgetown University W. Heath White University of North Carolina at Wilmington Mark Lance & W. Heath White < /> W Freedom, oh freedom, well that s just some people talkin. The Eagles, as opposed to a non-person? One might begin to address the question by appealing to a second distinction: between agents, characterized by the ability to act freely and intentionally, and mere patients, caught up in events but in no sense authors of the happenings involving them. An alternative way to address the question appeals to a third distinction: between subjects bearers of rights and responsibilities, commitments and entitlements, makers of claims, thinkers of thoughts, issuers of orders, and posers of questions and mere objects, graspable or evaluable by subjects but not themselves graspers or evaluators. We take it as a methodological point of departure that these three distinctions are largely coextensive, indeed coextensive in conceptually central cases. Granted, these distinctions can come apart. One might think that person applies to anything that is worthy of a distinctive sort of moral respect and think this applicable to some fetuses or the deeply infirm elderly. Even if the particular respect due such beings is importantly di erent from what we owe each other, such respect could still be thought to be of the kind distinctively due people, and think this even while holding that such people lack agentive or subjective capacity. Similarly, one might think dogs or various severely impaired humans to be attenuated subjects but not agents. Without taking any particular stand on such examples, our methodological hypothesis is that such cases, if they exist, are understood as persons (agents, subjects) essentially by reference to paradigm cases and, indeed, to a single paradigm within which person/non-person, subject/object, and agent/patient are conceptually connected. Stated. For one detailed development of this sort of paradigm-ri structure, and a defense of the possibility of concepts essentially governed by such a structure, see Lance and Little ( ). Discussions with Hilda Lindeman have helped
62 We are social creatures, who act on the basis of views disagreement: We disagree. We have reason to come to shared positions. Greg Restall Generality & Existence II 24 of 60
63 We are social creatures, who act on the basis of views disagreement: We disagree. We have reason to come to shared positions. planning: We plan. We have reason to consider options (prospectively) or replay scenarios (retrospectively). Greg Restall Generality & Existence II 24 of 60
64 We are social creatures, who act on the basis of views disagreement: We disagree. We have reason to come to shared positions. planning: We plan. We have reason to consider options (prospectively) or replay scenarios (retrospectively). We do many different and strange things in our messy zone-shifting practices, but we can isolate a particular convention or practice, idealise it, to see what we could do following those rules. Greg Restall Generality & Existence II 24 of 60
65 We are social creatures, who act on the basis of views disagreement: We disagree. We have reason to come to shared positions. planning: We plan. We have reason to consider options (prospectively) or replay scenarios (retrospectively). We do many different and strange things in our messy zone-shifting practices, but we can isolate a particular convention or practice, idealise it, to see what we could do following those rules. (Analogies: x from first order logic and natural language s all. Frictionless planes. etc.) Greg Restall Generality & Existence II 24 of 60
66 Example Subjunctive Shifts Oswald did shoot JFK, but suppose he hadn t? How would history have gone differently then? Greg Restall Generality & Existence II 25 of 60
67 Example Subjunctive Shifts Oswald did shoot JFK, but suppose he hadn t? How would history have gone differently then? [osk : [@osk : osk] Greg Restall Generality & Existence II 25 of 60
68 Example Subjunctive Shifts Oswald did shoot JFK, but suppose he hadn t? How would history have gone differently then? [osk : [@osk : osk] We open up a zone for consideration, in which we deny osk, while keeping track of the initial zone where we assert it. (And if we like, we can in the zone under the counterfactual supposition.) Greg Restall Generality & Existence II 25 of 60
69 Disagreement and Indicative Shifting I think that Oswald shot JFK, but you don t. I consider what it would mean for you to be right. If you re right, Oswald actually didn t shoot JFK. Greg Restall Generality & Existence II 26 of 60
70 Disagreement and Indicative Shifting I think that Oswald shot JFK, but you don t. I consider what it would mean for you to be right. If you re right, Oswald actually didn t shoot JFK. Epistemic alternatives interact differently with actuality. Greg Restall Generality & Existence II 26 of 60
71 Disagreement and Indicative Shifting I think that Oswald shot JFK, but you don t. I consider what it would mean for you to be right. If you re right, Oswald actually didn t shoot JFK. Epistemic alternatives interact differently with actuality. [osk : [ : Greg Restall Generality & Existence II 26 of 60
72 Indicative Shifting I think that Hesperus is Phosphorous, but I recognise that you don t. I don t take you to be inconsistent or misusing names. Greg Restall Generality & Existence II 27 of 60
73 Indicative Shifting I think that Hesperus is Phosphorous, but I recognise that you don t. I don t take you to be inconsistent or misusing names. We don t have this: a = b Fa Fb It s coherent for you to assert Fa and deny Fb even if I take it that a = b, and it s coherent for me to consider an alternative in which a b even if I don t agree. Greg Restall Generality & Existence II 27 of 60
74 Idealised Indicative Shifts Let s take any zone found by indicatively shifting from here (or from anywhere from here, etc.) to be an alternative indicative context from any other context indicatively shifted from here. Greg Restall Generality & Existence II 28 of 60
75 Idealised Indicative Shifts Let s take any zone found by indicatively shifting from here (or from anywhere from here, etc.) to be an alternative indicative context from any other context indicatively shifted from here. (And each are actual zones.) Greg Restall Generality & Existence II 28 of 60
76 Idealised Indicative Shifts Let s take any zone found by indicatively shifting from here (or from anywhere from here, etc.) to be an alternative indicative context from any other context indicatively shifted from here. (And each are actual zones.) This is as liberal as possible about what counts as an alternative from any alternative zone. Greg Restall Generality & Existence II 28 of 60
77 Idealised Indicative Shifts Let s take any zone found by indicatively shifting from here (or from anywhere from here, etc.) to be an alternative indicative context from any other context indicatively shifted from here. (And each are actual zones.) This is as liberal as possible about what counts as an alternative from any alternative zone. This gives us a motivation for a richer family of hypersequents. Greg Restall Generality & Existence II 28 of 60
78 Two Dimensional Hypersequents X 1 Y 1 1 X 1 2 Y1 2 X1 m 1 Y 1 m 1 X 2 Y 2 1 X 2 2 Y2 2 X2 m 2 Y 2 m 2... X n Y n 1 X n 2 Yn 2 X n m n Y n m n Greg Restall Generality & Existence II 29 of 60
79 Two Dimensional Hypersequents X 1 Y 1 1 X 1 2 Y1 2 X1 m 1 Y 1 m 1 X 2 Y 2 1 X 2 2 Y2 2 X2 m 2 Y 2 m 2... X n Y n 1 X n 2 Yn 2 X n m n Y n m n Think of these as scorecards, keeping track of assertions and denials. Greg Restall Generality & Existence II 29 of 60
80 Notation H[Γ ] Greg Restall Generality & Existence II 30 of 60
81 Notation H[Γ ] Greg Restall Generality & Existence II 30 of 60
82 Notation H[Γ ] H[Γ Γ ] Greg Restall Generality & Existence II 30 of 60
83 Notation H[Γ ] H[Γ Γ ] H[Γ Γ ] Greg Restall Generality & Existence II 30 of 60
84 Defining Rule for H[Γ A] ============== [ Df ] H[Γ A, ] Greg Restall Generality & Existence II 31 of 60
85 Defining Rule H[Γ, Γ ] ==================== [@Df ] ] Greg Restall Generality & Existence II 32 of 60
86 Defining Rule for [e] A] =============== [[e]df ] H[Γ [e]a, ] Greg Restall Generality & Existence II 33 of 60
87 Example Derivation [e]a [e]a [[e]df ] A [@Df [[e]df ] [e]a [e]@a [ Df ] [e]a [e]@a [ Df ] ([e]a [e]@a) Greg Restall Generality & Existence II 34 of 60
88 quantification & the barcan formula
89 The Standard Quantifier Rules Γ A(n), ============= [ Df ] Γ ( x)a(x), Γ, A(n) ============ [ Df ] Γ, ( x)a(x) Greg Restall Generality & Existence II 36 of 60
90 Deriving the Barcan Formula ( x) Fx ( x) Fx [ Df ] ( x) Fx Fn [ Df ] ( x) Fx Fn [ Df ] ( x) Fx ( x)fx [ Df ] ( x) Fx ( x)fx [ Df ] ( x) Fx ( x)fx Greg Restall Generality & Existence II 37 of 60
91 Where the derivation breaks down ( x) Fx ( x) Fx [ Df ] ( x) Fx Fn [ Df ] ( x) Fx Fn [ Df ] ( x) Fx ( x)fx [ Df ] ( x) Fx ( x)fx [ Df ] ( x) Fx ( x)fx Greg Restall Generality & Existence II 38 of 60
92 Where the derivation breaks down ( x) Fx ( x) Fx [ Df ] ( x) Fx Fn [ Df ] ( x) Fx Fn [ Df ] ( x) Fx ( x)fx [ Df ] ( x) Fx ( x)fx [ Df ] ( x) Fx ( x)fx Greg Restall Generality & Existence II 38 of 60
93 Where the derivation breaks down ( x) Fx ( x) Fx [ Df ] ( x) Fx Fn [ Df ] ( x) Fx Fn [ Df ] ( x) Fx ( x)fx [ Df ] ( x) Fx ( x)fx [ Df ] ( x) Fx ( x)fx Greg Restall Generality & Existence II 38 of 60
94 Pro and Con attitudes to Terms To rule a term in is to take it as suitable to substitute into a quantifier, i.e., to take the term to denote. To rule a term out is to take it as unsuitable to substitute into a quantifier, i.e., to take the term to not denote. Greg Restall Generality & Existence II 39 of 60
95 Pro and Con attitudes to Terms To rule a term in is to take it as suitable to substitute into a quantifier, i.e., to take the term to denote. To rule a term out is to take it as unsuitable to substitute into a quantifier, i.e., to take the term to not denote. We add terms to the lhs and rhs of sequents Γ. Greg Restall Generality & Existence II 39 of 60
96 Structural Rules remain as before Identity: Weakening: X X H[Γ ] H[Γ, X ] H[Γ ] H[Γ X, ] Contraction: H[Γ, X, X ] H[Γ, X ] H[Γ X, X, ] H[Γ X, ] Cut: H[Γ X, ] H[Γ, X ] H[Γ ] Here X is either a sentence or a term. Greg Restall Generality & Existence II 40 of 60
97 and there are some more Ext. Weak.: Ext. Contr.: H[Γ ] H[Γ Γ ] H[Γ Γ ] H[Γ ] H[Γ ] H[Γ Γ ] H[S S] H[S] Greg Restall Generality & Existence II 41 of 60
98 Quantifier Rules, allowing for non-denoting terms H[Γ, n A(n), ] =============== [ Df ] H[Γ ( x)a(x), ] H[Γ, n, A(n) ] =============== [ Df ] H[Γ, ( x)a(x) ] Greg Restall Generality & Existence II 42 of 60
99 Now you can't derive the Barcan Formula ( x) Fx ( x)fx Greg Restall Generality & Existence II 43 of 60
100 Now you can't derive the Barcan Formula ( x) Fx ( x)fx ( x)fx Greg Restall Generality & Existence II 43 of 60
101 Now you can't derive the Barcan Formula ( x) Fx ( x)fx b Fb, ( x)fx Greg Restall Generality & Existence II 43 of 60
102 Now you can't derive the Barcan Formula ( x) Fx b, Fb, ( x)fx b Fb, ( x)fx Greg Restall Generality & Existence II 43 of 60
103 Now you can't derive the Barcan Formula a, ( x) Fx b, Fb, ( x)fx a, b Fb, ( x)fx Greg Restall Generality & Existence II 43 of 60
104 Now you can't derive the Barcan Formula a, Fa, ( x) Fx b, Fb, ( x)fx a, b Fb, ( x)fx Greg Restall Generality & Existence II 43 of 60
105 Now you can't derive the Barcan Formula a, Fa, Fa, ( x) Fx b, Fb, ( x)fx a, b, Fa Fb, ( x)fx Greg Restall Generality & Existence II 43 of 60
106 Now you can't derive the Barcan Formula a, Fa, Fa, ( x) Fx b, Fb, ( x)fx a, b, Fa Fb, ( x)fx Greg Restall Generality & Existence II 43 of 60
107 Now you can't derive the Barcan Formula a, Fa, Fa, ( x) Fx b, Fb, ( x)fx a, b, Fa Fb, ( x)fx This hypersequent is underivable Greg Restall Generality & Existence II 43 of 60
108 Now you can't derive the Barcan Formula a, Fa, Fa, ( x) Fx b, Fb, ( x)fx a, b, Fa Fb, ( x)fx This hypersequent is underivable and it s fully refined. Greg Restall Generality & Existence II 43 of 60
109 Epistemic Barcan Formula ( x)[e]fx [e]( x)fx Greg Restall Generality & Existence II 44 of 60
110 Epistemic Barcan Formula ( x)[e]fx [e]( x)fx e ( x)fx ( x) e Fx Greg Restall Generality & Existence II 44 of 60
111 Morning Star and Evening Star Suppose e ( x)( y)(mx & Ey & x y). Greg Restall Generality & Existence II 45 of 60
112 Morning Star and Evening Star Suppose e ( x)( y)(mx & Ey & x y). Do we have ( x) e (( y)(mx & Ey & x y)? Greg Restall Generality & Existence II 45 of 60
113 Morning Star and Evening Star Suppose e ( x)( y)(mx & Ey & x y). Do we have ( x) e (( y)(mx & Ey & x y)? And ( x)( y) e (Mx & Ey & x y)? Greg Restall Generality & Existence II 45 of 60
114 Morning Star and Evening Star Suppose e ( x)( y)(mx & Ey & x y). Do we have ( x) e (( y)(mx & Ey & x y)? And ( x)( y) e (Mx & Ey & x y)? What could such x and y be? Greg Restall Generality & Existence II 45 of 60
115 positions & models
116 Positions A finite position is an underivable hypersequent. Greg Restall Generality & Existence II 47 of 60
117 Positions A finite position is an underivable hypersequent. An arbitrary position is a set (indicative alternatives) of sets (subjunctive alternatives) of pairs of sets of formulas or terms (components), where one component in each indicative alternative is marked with Greg Restall Generality & Existence II 47 of 60
118 Fully Refined Positions A position fully refined if it is closed downard under the evaluation conditions for the connectives and modal operators. Greg Restall Generality & Existence II 48 of 60
119 Fully Refined Positions A position fully refined if it is closed downard under the evaluation conditions for the connectives and modal operators. For example: If A B is in the lhs of a component, so are A and B. Greg Restall Generality & Existence II 48 of 60
120 Fully Refined Positions A position fully refined if it is closed downard under the evaluation conditions for the connectives and modal operators. For example: If A B is in the lhs of a component, so are A and B. If A B is in the rhs of a component, so is one of A and B. Greg Restall Generality & Existence II 48 of 60
121 Fully Refined Positions A position fully refined if it is closed downard under the evaluation conditions for the connectives and modal operators. For example: If A B is in the lhs of a component, so are A and B. If A B is in the rhs of a component, so is one of A and B. If ( x)a(x) is in the lhs of a component, so is A(t) for every term t in the lhs of that component. Greg Restall Generality & Existence II 48 of 60
122 Fully Refined Positions A position fully refined if it is closed downard under the evaluation conditions for the connectives and modal operators. For example: If A B is in the lhs of a component, so are A and B. If A B is in the rhs of a component, so is one of A and B. If ( x)a(x) is in the lhs of a component, so is A(t) for every term t in the lhs of that component. If ( x)a(x) is in the rhs of a component, so is A(t) for some term t in the lhs of that component. Greg Restall Generality & Existence II 48 of 60
123 Fully Refined Positions A position fully refined if it is closed downard under the evaluation conditions for the connectives and modal operators. For example: If A B is in the lhs of a component, so are A and B. If A B is in the rhs of a component, so is one of A and B. If ( x)a(x) is in the lhs of a component, so is A(t) for every term t in the lhs of that component. If ( x)a(x) is in the rhs of a component, so is A(t) for some term t in the lhs of that component. If A is in the lhs of a component, A is in the lhs of every subjunctive alternative of that component. Greg Restall Generality & Existence II 48 of 60
124 Fully Refined Positions A position fully refined if it is closed downard under the evaluation conditions for the connectives and modal operators. For example: If A B is in the lhs of a component, so are A and B. If A B is in the rhs of a component, so is one of A and B. If ( x)a(x) is in the lhs of a component, so is A(t) for every term t in the lhs of that component. If ( x)a(x) is in the rhs of a component, so is A(t) for some term t in the lhs of that component. If A is in the lhs of a component, A is in the lhs of every subjunctive alternative of that component. If A is in the rhs of a component, A is in the rhs of some subjunctive alternative of that component. Greg Restall Generality & Existence II 48 of 60
125 Models Fully refinied positions are examples of models, with variable domains and the expected truth conditions for the connectives, quantifiers and modal operators. Greg Restall Generality & Existence II 49 of 60
126 Soundness and Completeness Any derivable hypersequent (using Cut) holds in all models. Greg Restall Generality & Existence II 50 of 60
127 Soundness and Completeness Any derivable hypersequent (using Cut) holds in all models. Any hypersequent that cannot be derived (without Cut) can be extended into a fully refined position. Greg Restall Generality & Existence II 50 of 60
128 Soundness and Completeness Any derivable hypersequent (using Cut) holds in all models. Any hypersequent that cannot be derived (without Cut) can be extended into a fully refined position. That fully refined position determines a model in which the hypersequent does not hold. Greg Restall Generality & Existence II 50 of 60
129 Soundness and Completeness Any derivable hypersequent (using Cut) holds in all models. Any hypersequent that cannot be derived (without Cut) can be extended into a fully refined position. That fully refined position determines a model in which the hypersequent does not hold. So the models are adequate for the logic. Greg Restall Generality & Existence II 50 of 60
130 Soundness and Completeness Any derivable hypersequent (using Cut) holds in all models. Any hypersequent that cannot be derived (without Cut) can be extended into a fully refined position. That fully refined position determines a model in which the hypersequent does not hold. So the models are adequate for the logic. And in the logic, the cut rule is admissible in the cut-free system. Greg Restall Generality & Existence II 50 of 60
131 consequences & questions
132 Principled, Motivated Ersatzism The structure of modal concepts is explained in terms of the rules for their use. Greg Restall Generality & Existence II 52 of 60
133 Principled, Motivated Ersatzism The structure of modal concepts is explained in terms of the rules for their use. Worlds (and their domains) are idealised positions. Greg Restall Generality & Existence II 52 of 60
134 Coherent, Well Behaved Contingentism Greg Restall Generality & Existence II 53 of 60
135 Inner and Outer Quantification Outer quantification is an issue for contingentism. On most approaches to contingentism, it can be defined. Greg Restall Generality & Existence II 54 of 60
136 Inner and Outer Quantification Outer quantification is an issue for contingentism. On most approaches to contingentism, it can be defined. This proof theoretical semantics is no different in that regard. Greg Restall Generality & Existence II 54 of 60
137 We have Outer Quantification H(n Γ A(n), ) ================== [ Df ] H(Γ ( x)a(x), ) H(n Γ, A(n) ) ================== [ Df ] H(Γ, ( x)a(x) ) for which the substituted term need be defined in some zone. Greg Restall Generality & Existence II 55 of 60
138 The Barcan Formula is Derivable ( x) A(x) ( x) A(x) [ Df ] n ( x) A(x) A(n) [ Df ] n ( x) A(x) A(n) [ Df ] ( x) A(x) ( x)a(x) [ Df ] ( x) A(x) ( x)a(x) Greg Restall Generality & Existence II 56 of 60
139 But we also have Way Out Quantification H(Γ A(n), ) ================ [ΠDf ] H(Γ (Πx)A(x), ) H(Γ, A(n) ) ================ [ΣDf ] H(Γ, (Σx)A(x) ) for which the term need not be defined anywhere. Greg Restall Generality & Existence II 57 of 60
140 Higher Order Contingentism? X ϕ(x) Xϕ(X) Greg Restall Generality & Existence II 58 of 60
141 Higher Order Contingentism? X ϕ(x) Xϕ(X) What could it mean to rule a predicate in or out? Greg Restall Generality & Existence II 58 of 60
142 Next Talk Identity! Greg Restall Generality & Existence II 59 of 60
143 thank you! on Twitter
Logical Constants, Sequent Structures and Speech Acts
Logical Constants, Sequent Structures and Speech Acts the case of modal operators Greg Restall logical constants workshop esslli 2011 ljubljana logical constants defining rules making it explicit easy
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 informationgenerality and existence i: quantification and free logic
generality and existence i: quantification and free logic Greg Restall * Philosophy Department The University of Melbourne restall@unimelb.edu.au july 24, 2018 Version. Abstract: In this paper, I motivate
More informationTruth, Subderivations and the Liar. Why Should I Care about the Liar Sentence? Uses of the Truth Concept - (i) Disquotation.
Outline 1 2 3 4 5 1 / 41 2 / 41 The Liar Sentence Let L be the sentence: This sentence is false This sentence causes trouble If it is true, then it is false So it can t be true Thus, it is false If it
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 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 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 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 informationConditionals. Daniel Bonevac. February 12, 2013
Neighborhood February 12, 2013 Neighborhood are sentences formed, in English, with the particle if. Some are indicative; some are subjunctive. They are not equivalent, as this pair seems to show: 1. If
More informationThe Foundations of Mathematics. Frege s Logicism
The Foundations of Mathematics Lecture One Frege s Logicism Rob Trueman rob.trueman@york.ac.uk University of York Preliminaries Frege s Logicism Preliminaries Mathematics versus Logic Hume s Principle
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 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 informationCHAPTER 0: BACKGROUND (SPRING 2009 DRAFT)
CHAPTER 0: BACKGROUND (SPRING 2009 DRAFT) MATH 378, CSUSM. SPRING 2009. AITKEN This chapter reviews some of the background concepts needed for Math 378. This chapter is new to the course (added Spring
More informationBarriers to Inference
Barriers to Inference Greg Restall University of Melbourne restall@unimelb.edu.au Page 0 of 53 Gillian Russell Washington University in St Louis grussell@artsci.wustl.edu 27th May, FEW 2005 Hume s Law
More information1 FUNDAMENTALS OF LOGIC NO.1 WHAT IS LOGIC Tatsuya Hagino hagino@sfc.keio.ac.jp lecture URL https://vu5.sfc.keio.ac.jp/slide/ 2 Course Summary What is the correct deduction? Since A, therefore B. It is
More informationKing s College London
King s College London This paper is part of an examination of the College counting towards the award of a degree. Examinations are governed by the College Regulations under the authority of the Academic
More informationThis is logically equivalent to the conjunction of the positive assertion Minimal Arithmetic and Representability
16.2. MINIMAL ARITHMETIC AND REPRESENTABILITY 207 If T is a consistent theory in the language of arithmetic, we say a set S is defined in T by D(x) if for all n, if n is in S, then D(n) is a theorem of
More informationabout conditionals. It is a good example of what might be called systematic ordinary
Wheeler: Lycan s Real Conditionals page 1 William Lycan s Real Conditionals (Oxford University Press 2001; isbn 0-19-924207-0; 223 pp.) Real Conditionals is the result of a couple of decades of William
More informationSYMBOLIC LOGIC UNIT 10: SINGULAR SENTENCES
SYMBOLIC LOGIC UNIT 10: SINGULAR SENTENCES Singular Sentences name Paris is beautiful (monadic) predicate (monadic) predicate letter Bp individual constant Singular Sentences Bp These are our new simple
More informationpluralism and proofs
pluralism and proofs Greg Restall Philosophy Department, The University of Melbourne restall@unimelb.edu.au August 2011 Abstract Beall and Restall s Logical Pluralism [2] characterises pluralism about
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 informationTemporal Logic - Soundness and Completeness of L
Temporal Logic - Soundness and Completeness of L CS402, Spring 2018 Soundness Theorem 1 (14.12) Let A be an LTL formula. If L A, then A. Proof. We need to prove the axioms and two inference rules to be
More informationLogic for Computer Science - Week 4 Natural Deduction
Logic for Computer Science - Week 4 Natural Deduction 1 Introduction In the previous lecture we have discussed some important notions about the semantics of propositional logic. 1. the truth value of a
More informationExpressive Power, Mood, and Actuality
Expressive Power, Mood, and Actuality Rohan French Abstract In Wehmeier (2004) we are presented with the subjunctive modal language, a way of dealing with the expressive inadequacy of modal logic by marking
More information(1) If Bush had not won the last election, then Nader would have won it.
24.221 Metaphysics Counterfactuals When the truth functional material conditional (or ) is introduced, it is normally glossed with the English expression If..., then.... However, if this is the correct
More informationcis32-ai lecture # 18 mon-3-apr-2006
cis32-ai lecture # 18 mon-3-apr-2006 today s topics: propositional logic cis32-spring2006-sklar-lec18 1 Introduction Weak (search-based) problem-solving does not scale to real problems. To succeed, problem
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 information5. And. 5.1 The conjunction
5. And 5.1 The conjunction To make our logical language more easy and intuitive to use, we can now add to it elements that make it able to express the equivalents of other sentences from a natural language
More informationSecond-Order Modal Logic
University of Connecticut DigitalCommons@UConn Doctoral Dissertations University of Connecticut Graduate School 3-24-2017 Second-Order Modal Logic Andrew Parisi University of Connecticut - Storrs, andrew.parisi@uconn.edu
More informationConceivability and Modal Knowledge
1 3 Conceivability and Modal Knowledge Christopher Hill ( 2006 ) provides an account of modal knowledge that is set in a broader context of arguing against the view that conceivability provides epistemic
More informationHPS 1653 / PHIL 1610 Introduction to the Philosophy of Science
HPS 1653 / PHIL 1610 Introduction to the Philosophy of Science Laws of Nature Adam Caulton adam.caulton@gmail.com Wednesday 19 November 2014 Recommended reading Chalmers (2013), What is this thing called
More informationIn Defence of a Naïve Conditional Epistemology
In Defence of a Naïve Conditional Epistemology Andrew Bacon 28th June 2013 1 The data You pick a card at random from a standard deck of cards. How confident should I be about asserting the following sentences?
More informationYork University. Faculty of Science and Engineering MATH 1090, Section M Final Examination, April NAME (print, in ink): Instructions, remarks:
York University Faculty of Science and Engineering MATH 1090, Section M ination, NAME (print, in ink): (Family name) (Given name) Instructions, remarks: 1. In general, carefully read all instructions in
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 informationWilliamson s Modal Logic as Metaphysics
Williamson s Modal Logic as Metaphysics Ted Sider Modality seminar 1. Methodology The title of this book may sound to some readers like Good as Evil, or perhaps Cabbages as Kings. If logic and metaphysics
More informationBarriers to Implication
Barriers to Implication Greg Restall Philosophy Department The University of Melbourne restall@unimelb.edu.au Gillian Russell Philosophy Department Washington University in St Louis grussell@princeton.edu
More information5. And. 5.1 The conjunction
5. And 5.1 The conjunction To make our logical language more easy and intuitive to use, we can now add to it elements that make it able to express the equivalents of other sentences from a natural language
More informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
More informationSo, what are special sciences? ones that are particularly dear to the author? ( Oh dear. I am touched. Psychology is just, so, well, special!
Jerry Fodor and his Special Sciences So, what are special sciences? ones that are particularly dear to the author? ( Oh dear. I am touched. Psychology is just, so, well, special! ) The use of special in
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationMeaning and Reference INTENSIONAL AND MODAL LOGIC. Intensional Logic. Frege: Predicators (general terms) have
INTENSIONAL AND MODAL LOGIC Meaning and Reference Why do we consider extensions to the standard logical language(s)? Requirements of knowledge representation / domain modelling Intensional expressions:
More informationKripke on Frege on Sense and Reference. David Chalmers
Kripke on Frege on Sense and Reference David Chalmers Kripke s Frege Kripke s Frege Theory of Sense and Reference: Some Exegetical Notes Focuses on Frege on the hierarchy of senses and on the senses of
More informationPredicates, Quantifiers and Nested Quantifiers
Predicates, Quantifiers and Nested Quantifiers Predicates Recall the example of a non-proposition in our first presentation: 2x=1. Let us call this expression P(x). P(x) is not a proposition because x
More informationLecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem. Michael Beeson
Lecture 14 Rosser s Theorem, the length of proofs, Robinson s Arithmetic, and Church s theorem Michael Beeson The hypotheses needed to prove incompleteness The question immediate arises whether the incompleteness
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 informationDavid Lewis. Void and Object
David Lewis Void and Object Menzies Theory of Causation Causal relation is an intrinsic relation between two events -- it is logically determined by the natural properties and relations of the events.
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
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 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 informationPropositional Logic Arguments (5A) Young W. Lim 11/8/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationManual of Logical Style
Manual of Logical Style Dr. Holmes January 9, 2015 Contents 1 Introduction 2 2 Conjunction 3 2.1 Proving a conjunction...................... 3 2.2 Using a conjunction........................ 3 3 Implication
More informationP Q (P Q) (P Q) (P Q) (P % Q) T T T T T T T F F T F F F T F T T T F F F F T T
Logic and Reasoning Final Exam Practice Fall 2017 Name Section Number The final examination is worth 100 points. 1. (10 points) What is an argument? Explain what is meant when one says that logic is the
More informationLecture Notes on Certifying Theorem Provers
Lecture Notes on Certifying Theorem Provers 15-317: Constructive Logic Frank Pfenning Lecture 13 October 17, 2017 1 Introduction How do we trust a theorem prover or decision procedure for a logic? Ideally,
More informationLecture 11: Measuring the Complexity of Proofs
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 11: Measuring the Complexity of Proofs David Mix Barrington and Alexis Maciel July
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 informationTruthmaker Maximalism defended again. Eduardo Barrio and Gonzalo Rodriguez-Pereyra
1 Truthmaker Maximalism defended again 1 Eduardo Barrio and Gonzalo Rodriguez-Pereyra 1. Truthmaker Maximalism is the thesis that every truth has a truthmaker. Milne (2005) attempts to refute it using
More informationMath 144 Summer 2012 (UCR) Pro-Notes June 24, / 15
Before we start, I want to point out that these notes are not checked for typos. There are prbally many typeos in them and if you find any, please let me know as it s extremely difficult to find them all
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 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 informationSets and Functions. (As we will see, in describing a set the order in which elements are listed is irrelevant).
Sets and Functions 1. The language of sets Informally, a set is any collection of objects. The objects may be mathematical objects such as numbers, functions and even sets, or letters or symbols of any
More informationSeminaar Abstrakte Wiskunde Seminar in Abstract Mathematics Lecture notes in progress (27 March 2010)
http://math.sun.ac.za/amsc/sam Seminaar Abstrakte Wiskunde Seminar in Abstract Mathematics 2009-2010 Lecture notes in progress (27 March 2010) Contents 2009 Semester I: Elements 5 1. Cartesian product
More informationLogic. Quantifiers. (real numbers understood). x [x is rotten in Denmark]. x<x+x 2 +1
Logic One reason for studying logic is that we need a better notation than ordinary English for expressing relationships among various assertions or hypothetical states of affairs. A solid grounding in
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 informationOverview of Today s Lecture
Branden Fitelson Philosophy 4515 (Advanced Logic) Notes 1 Overview of Today s Lecture Administrative Stuff HW #1 grades and solutions have been posted Please make sure to work through the solutions HW
More informationCritical Notice: Bas van Fraassen, Scientific Representation: Paradoxes of Perspective Oxford University Press, 2008, xiv pages
Critical Notice: Bas van Fraassen, Scientific Representation: Paradoxes of Perspective Oxford University Press, 2008, xiv + 408 pages by Bradley Monton June 24, 2009 It probably goes without saying that
More information6. Conditional derivations
6. Conditional derivations 6.1 An argument from Hobbes In his great work, Leviathan, the philosopher Thomas Hobbes (1588-1679) gives an important argument for government. Hobbes begins by claiming that
More informationModule 5 K and Equivalent Systems
Module 5 K and Equivalent Systems G. J. Mattey July 8, 2010 Contents 1 The Semantical System KI 2 1.1 Specification of KI....................................... 2 1.2 Semantical Properties and Relations
More informationChapter 1 Review of Equations and Inequalities
Chapter 1 Review of Equations and Inequalities Part I Review of Basic Equations Recall that an equation is an expression with an equal sign in the middle. Also recall that, if a question asks you to solve
More informationMODAL LOGIC WITH SUBJUNCTIVE MARKERS: A NEW PERSPECTIVE ON RIGID DESIGNATION
MODAL LOGIC WITH SUBJUNCTIVE MARKERS: A NEW PERSPECTIVE ON RIGID DESIGNATION Helge Rückert Department of Philosophy University of Saarbrücken, Germany Abstract: According to Kripke
More informationPhilosophy of Mathematics Structuralism
Philosophy of Mathematics Structuralism Owen Griffiths oeg21@cam.ac.uk St John s College, Cambridge 17/11/15 Neo-Fregeanism Last week, we considered recent attempts to revive Fregean logicism. Analytic
More information15414/614 Optional Lecture 1: Propositional Logic
15414/614 Optional Lecture 1: Propositional Logic Qinsi Wang Logic is the study of information encoded in the form of logical sentences. We use the language of Logic to state observations, to define concepts,
More information240 Metaphysics. Frege s Puzzle. Chapter 26
240 Metaphysics Frege s Puzzle Frege s Puzzle 241 Frege s Puzzle In his 1879 Begriffsschrift (or Concept-Writing ), Gottlob Frege developed a propositional calculus to determine the truth values of propositions
More informationOverview. Knowledge-Based Agents. Introduction. COMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR Last time Expert Systems and Ontologies oday Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof theory Natural
More informationA Modal View of the Semantics of Theoretical Sentences
A Modal View of the Semantics of Theoretical Sentences Holger Andreas Institute for Philosophy, Logic, and Theory of Science - LMU Munich May 3, 2009 Abstract Modal logic has been applied in many different
More informationProof. Theorems. Theorems. Example. Example. Example. Part 4. The Big Bang Theory
Proof Theorems Part 4 The Big Bang Theory Theorems A theorem is a statement we intend to prove using existing known facts (called axioms or lemmas) Used extensively in all mathematical proofs which should
More informationFirst-Order Logic. 1 Syntax. Domain of Discourse. FO Vocabulary. Terms
First-Order Logic 1 Syntax Domain of Discourse The domain of discourse for first order logic is FO structures or models. A FO structure contains Relations Functions Constants (functions of arity 0) FO
More informationPrefixed Tableaus and Nested Sequents
Prefixed Tableaus and Nested Sequents Melvin Fitting Dept. Mathematics and Computer Science Lehman College (CUNY), 250 Bedford Park Boulevard West Bronx, NY 10468-1589 e-mail: melvin.fitting@lehman.cuny.edu
More informationWhat are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos
What are the recursion theoretic properties of a set of axioms? Understanding a paper by William Craig Armando B. Matos armandobcm@yahoo.com February 5, 2014 Abstract This note is for personal use. It
More informationPredicate Logic. Predicates. Math 173 February 9, 2010
Math 173 February 9, 2010 Predicate Logic We have now seen two ways to translate English sentences into mathematical symbols. We can capture the logical form of a sentence using propositional logic: variables
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 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 informationLogic for Computer Science - Week 5 Natural Deduction
Logic for Computer Science - Week 5 Natural Deduction Ștefan Ciobâcă November 30, 2017 1 An Alternative View of Implication and Double Implication So far, we have understood as a shorthand of However,
More informationThe two-dimensionalism of The Conscious Mind
The two-dimensionalism of The Conscious Mind phil 93515 Jeff Speaks February 5, 2007 1 Primary and secondary intension........................ 1 2 Indexicality and intensions............................
More informationLecture 12: Arguments for the absolutist and relationist views of space
12.1 432018 PHILOSOPHY OF PHYSICS (Spring 2002) Lecture 12: Arguments for the absolutist and relationist views of space Preliminary reading: Sklar, pp. 19-25. Now that we have seen Newton s and Leibniz
More informationCOMP219: Artificial Intelligence. Lecture 19: Logic for KR
COMP219: Artificial Intelligence Lecture 19: Logic for KR 1 Overview Last time Expert Systems and Ontologies Today Logic as a knowledge representation scheme Propositional Logic Syntax Semantics Proof
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 informationPropositional Logic Arguments (5A) Young W. Lim 11/29/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
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 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 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 informationIntroduction to Metalogic
Introduction to Metalogic Hans Halvorson September 21, 2016 Logical grammar Definition. A propositional signature Σ is a collection of items, which we call propositional constants. Sometimes these propositional
More informationAI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic
AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate
More informationModel Theory in the Univalent Foundations
Model Theory in the Univalent Foundations Dimitris Tsementzis January 11, 2017 1 Introduction 2 Homotopy Types and -Groupoids 3 FOL = 4 Prospects Section 1 Introduction Old and new Foundations (A) (B)
More information(Refer Slide Time: 02:20)
Discrete Mathematical Structures Dr. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology, Madras Lecture - 5 Logical Inference In the last class we saw about
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 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 informationOverview of Logic and Computation: Notes
Overview of Logic and Computation: Notes John Slaney March 14, 2007 1 To begin at the beginning We study formal logic as a mathematical tool for reasoning and as a medium for knowledge representation The
More informationManual of Logical Style (fresh version 2018)
Manual of Logical Style (fresh version 2018) Randall Holmes 9/5/2018 1 Introduction This is a fresh version of a document I have been working on with my classes at various levels for years. The idea that
More informationIntermediate Logic. First-Order Logic
Intermediate Logic Lecture Four First-Order Logic Rob Trueman rob.trueman@york.ac.uk University of York Introducing First-Order Logic First-Order Logic Introducing First-Order Logic Names Predicates Quantifiers
More informationArtificial Intelligence Knowledge Representation I
Artificial Intelligence Knowledge Representation I Agents that reason logically knowledge-based approach implement agents that know about their world and reason about possible courses of action needs to
More information