Katrin Schulz
Nixon, Light Switches and King Ludwig of Bavaria: How to Model Counterfactual Reasoning
dinsdag, 27 september 2011
Nixon, Light Switches and King Ludwig of Bavaria: How to Model - - PowerPoint PPT Presentation
Nixon, Light Switches and King Ludwig of Bavaria: How to Model Counterfactual Reasoning Katrin Schulz dinsdag, 27 september 2011 1 Conditionals between disciplines Conditionals Linguistics Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
2
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 3
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 4
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 5
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 6
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 7
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 8
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 9
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 10
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 11
dinsdag, 27 september 2011
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
13
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
14
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
15
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
16
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
17
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
18
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
19
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
20
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 31
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
32
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
33
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 34
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 35
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 36
dinsdag, 27 september 2011
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
BL(w0) = RevL(B, ¬ bad ) = Basis of w0 relevant facts of w0 Antecedent + RevL(BL(w0),A) ⇒L Consequent { bad } ∅
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
BL(w0) = RevL(B, ¬ bad ) = Basis of w0 relevant facts of w0 { bad } ∅
✔ ¬ bad + ∅ ⇒bad → hat hat
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
Back to Lifschitz’s Circuit Example Rule: (S1 ↔ S2) ↔ L world w0: ¬S1, S2, ¬L Conditional: S1 > L BR(w0) = RevR(B1, S1) = {S2} RevR(B2, S1) = {¬ L} RevR(B3, S1) = {S2} 4, {¬ L} relevant facts
B1 B2 B3 {¬ S1, ¬ L}, {{¬ S1, S2}, {S2, ¬ L}}
dinsdag, 27 september 2011
RevR(B1, S1) = {S2} RevR(B2, S1) = {¬ L} RevR(B3, S1) = {S2} 4, {¬ L}
Institute for Logic, Language and Computation (ILLC)
Back to Lifschitz’s Circuit Example Rule: (S1 ↔ S2) ↔ L world w0: ¬S1, S2, ¬L Conditional: S1 > L S1 + ⇒ (S1↔S2)↔ L L ¬ L
✔ ✔
✘
✘ ✘
relevant facts
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
BASISR(w0) = { {¬ S1, S2}, {¬ S1, ¬ L}, {S2, ¬ L}} Back to Lifschitz’s Circuit Example Rule: (S1 ↔ S2) ↔ L world w0: ¬S1, S2, ¬L Conditional: S1 > L RevR(B1, S1) = {S2} RevR(B2, S1) = {¬ L} RevR(B3, S1) = {S2} 4, {¬ L} B1 B2 B3 Basis
causally indep. facts
relevant facts
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 50
dinsdag, 27 september 2011
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 52
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 53
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
54
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
55
D ???
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
56
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
57
Veltman ’05
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
58
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
59
court (C)
signals rifleman shoots (R) prisoner dies (P) C↔O O↔R R↔P
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
60
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 61
dinsdag, 27 september 2011
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
63
Approach makes the correct predictions for the
backtracking complex dependencies (circuit example) Approach can account for critical data beyond
Kit Fine’s Nixon example Lewis’ problem of over-minimalization:
(A ∨ B) > C entails A > C, B > C
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
64
BUT: the predictions made depend on the
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 65
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
66
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC) 67
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
68
dinsdag, 27 september 2011
Institute for Logic, Language and Computation (ILLC)
69
dinsdag, 27 september 2011