MODELING COUNTERFACTUALS USING LOGIC PROGRAMMING
|
|
- Cameron Powell
- 6 years ago
- Views:
Transcription
1 MODELING COUNTERFACTUALS USING LOGIC PROGRAMMING Katrin Schulz ILLC, Amsterdam
2 1. INTRODUCTION 1.1 OUTLINE Logic Programming
3 1. INTRODUCTION 1.1 OUTLINE Logic Programming Counterfactuals Causality Philosophy
4 1. INTRODUCTION 1.1 OUTLINE Logic Programming NOT: Reasoning with conditionals Cognitive Sciences
5 1. INTRODUCTION 1.1 OUTLINE 1.If she has an essay to write she will study late in the library. 2.She has an essay to write. C.She will work late in the library. NOT: Reasoning with conditionals Cognitive Sciences
6 1. INTRODUCTION 1.1 OUTLINE 1.If she has an essay to write she will study late in the library. 2.She has an essay to write. 3.If the library is open she will study late in the library. C.She will work late in the library. NOT: Reasoning with conditionals Cognitive Sciences
7 1. INTRODUCTION 1.1 OUTLINE (1)If I had struck that match, it would have lit. Counterfactuals Causality Philosophy
8 1. INTRODUCTION 1.1 OUTLINE Logic Programming Counterfactuals Causality Philosophy
9 1. INTRODUCTION 1.1 OUTLINE Goals of this talk: 1. Show you that there are interesting applications of Computational Sciences tools outside of the Computational Sciences. 2.Show you that working on these applications can bring about new perspectives on these tools.
10 1. INTRODUCTION 1.1 OUTLINE How will we proceed: 1. introduce counterfactual conditionals and how they are normally treated in the philosophical literature; 2.convince you that in order to account for the meaning of counterfactuals we need to take into account causal dependence; 3.do so using logic programming; 4.link this to the standard philosophical approaches
11 2. PHILOSOPHICAL APPROACHES 2.1 WHAT IS A COUNTERFACTUAL? (1)If I had struck that match, it would have lit. definition by meaning: counterfactuals = conditionals with false antecedents
12 2. PHILOSOPHICAL APPROACHES 2.2 THE MEANING OF COUNTERFACTUALS Define the meaning of a binary sentence connective > (1)If I had struck that match, it would have lit. A > C Antecedent Consequent Truth Conditions M, w 0 = A > C iff...
13 2. PHILOSOPHICAL APPROACHES 2.3 MATERIAL IMPLICATION Truth Conditions: M, w 0 = A > C iff M, w 0 = A or M, w 0 = C / A C w1 0 0 w2 0 1 w3 1 0 w4 1 1 Problem: no relation between antecedent and consequent counterfactuals are trivially true (3) If Amsterdam was a river, I would be wearing a blue hat today. (4) If I had dropped this glass, it would have grown wings and flown away.
14 2. PHILOSOPHICAL APPROACHES 2.4 STRICT CONDITIONALS
15 2. PHILOSOPHICAL APPROACHES 2.4 STRICT CONDITIONALS Truth Conditions: M, w 0 = A > C iff [[A]] M [[C]] M M C A Problem: too strong; not all A worlds should be considered (1)If I had struck that match, it would have lit. > don t consider worlds where the match is wet or broken.
16 2. PHILOSOPHICAL APPROACHES 2.5 SIMILARITY APPROACH
17 2. PHILOSOPHICAL APPROACHES 2.5 SIMILARITY APPROACH Truth conditions: M,w 0 = A > C iff Min( M,w0, [[A]] M ) [[C]] M M,w0 M A C w 0
18 2. PHILOSOPHICAL APPROACHES 2.6 PREMISE SEMANTICS A counterfactual conditional If A then C is true iff: A L C
19 2. PHILOSOPHICAL APPROACHES 2.6 PREMISE SEMANTICS A counterfactual conditional If A then C is true iff: A + Facts of w 0 L C maximal consistent subset premise set P(w0) general laws special case of the similarity approach: w 1 w 2 iff {p P(w 0 ) w 1 = p} {p P(w 0 ) w 2 = p}
20 2. PHILOSOPHICAL APPROACHES 2.7 SUMMARY Two main approaches to the semantics of counterfactuals A sentence of the form A > C is true in a world w 0 given model M iff (a) C is true in all possible worlds in which A is true, and which in other respects differ minimally from w 0. (b) C follows from A, the laws L and all maximal subset of the premisses P(w 0 ) consistent with the antecedent.
21 NIXON, LIGHT SWITCHES AND KING LUDWIG OF BAVARIA How to model similarity Katrin Schulz ILLC/UvA
22 3. HOW TO MODEL SIMILARITY 3.1 FINE S NIXON CASE The counterfactual (1)If Nixon had pressed the button there would have been a nuclear holocaust. is true or can be imagined to be so. Now suppose that there never will be a nuclear holocaust. Then that counterfactual is, on Lewis' analysis, very likely false. For given any world in which the antecedent and consequent are both true it will be easy to imagine a closer world in which the antecedent is true and the consequent false. For we need only imagine a change that prevents the holocaust but that does not require such a great divergence from reality." (Fine 1975: 452) C A w0
23 3. HOW TO MODEL SIMILARITY 3.2 REACTION Stalnaker:...the relevant conception of minimal difference needs to be spelled out with care."
24 3. HOW TO MODEL SIMILARITY 3.1 FINE S NIXON CASE The counterfactual (1)If Nixon had pressed the button there would have been a nuclear holocaust. is true or can be imagined to be so. Now suppose that there never will be a nuclear holocaust. Then that counterfactual is, on Lewis' analysis, very likely false. For given any world in which the antecedent and consequent are both true it will be easy to imagine a closer world in which the antecedent is true and the consequent false. For we need only imagine a change that prevents the holocaust but that does not require such a great divergence from reality." (Fine 1975: 452) C A w0
25 3. HOW TO MODEL SIMILARITY 3.3 OTHER CASES A coin is going to be flipped and you bet on tails. Unfortunately, heads comes up and you lose. Now you can say: (1)If I had bet on heads, I would have won. betting flipping losing/winning antecedent consequent w0
26 3. HOW TO MODEL SIMILARITY 3.3 OTHER CASES Consider a man - call him Jones who is possessed of the following disposition as regards wearing his hat. If the man on the news predicts bad weather, Mr Jones invariably wears his hat the next day. A weather forecast in favor of fine weather, on the other hand, affects him neither way: in this case he puts his hat on or leaves it on the peg, completely at random. Suppose, moreover, that yesterday bad weather was prognosed, so Jones is wearing his hat. In this case,.... (1)If the weather forecast had been in favor of fine weather, Jones would have been wearing his hat." [Tichy (1976)]
27 3. HOW TO MODEL SIMILARITY 3.3 OTHER CASES Suppose that Jones always flips a coin before he opens the curtains to see what the weather is like. `Heads' means he is going to wear his hat in case the weather is fine, whereas `tails' means he is not going to wear his hat in that case. Like before, bad weather invariably makes him wear his hat. Now suppose that today heads came up when he flipped the coin, and that it is raining. So, again, Jones is wearing his hat. Would you accept the statement: (4)If the weather had been fine, Jones would have been wearing his hat.
28 3. HOW TO MODEL SIMILARITY 3.4 VELTMAN S PREMISE SEMANTICS A conditional sentence If A then C is true iff: A + Facts of w 0 L C maximal consistent subset premise set P(w0) general laws
29 3. HOW TO MODEL SIMILARITY 3.4 VELTMAN S PREMISE SEMANTICS A conditional sentence If A then C is true iff: A + Facts of w 0 L C maximal consistent subset basis B(w0) general laws Basis(w 0 ) = minimal set of primitive facts of w 0 from which, given L, all other facts of w 0 can be derived. Particular variant of Premise Semantics
30 3. HOW TO MODEL SIMILARITY 3.4 VELTMAN S PREMISE SEMANTICS Consider a man - call him Jones who is possessed of the following disposition as regards wearing his hat. If the man on the news predicts bad weather, Mr Jones invariably wears his hat the next day. A weather forecast in favor of fine weather, on the other hand, affects him neither way: in this case he puts his hat on or leaves it on the peg, completely at random. Suppose, moreover, that yesterday bad weather was prognosed, so Jones is wearing his hat. In this case,.... (1)If the weather forecast had been in favor of fine weather, Jones would have been wearing his hat." [Tichy (1976)] Laws: bad hat A + Facts of w 0 L C Basis(w 0 ): bad
31 3. HOW TO MODEL SIMILARITY 3.4 VELTMAN S PREMISE SEMANTICS Consider a man - call him Jones who is possessed of the following disposition as regards wearing his hat. If the man on the news predicts bad weather, Mr Jones invariably wears his hat the next day. A weather forecast in favor of fine weather, on the other hand, affects him neither way: in this case he puts his hat on or leaves it on the peg, completely at random. Suppose, moreover, that yesterday bad weather was prognosed, so Jones is wearing his hat. In this case,.... (1)If the weather forecast had been in favor of fine weather, Jones would have been wearing his hat." [Tichy (1976)] Laws: bad hat bad + Facts of w 0 L hat Basis(w 0 ): bad
32 3. HOW TO MODEL SIMILARITY 3.4 VELTMAN S PREMISE SEMANTICS Consider a man - call him Jones who is possessed of the following disposition as regards wearing his hat. If the man on the news predicts bad weather, Mr Jones invariably wears his hat the next day. A weather forecast in favor of fine weather, on the other hand, affects him neither way: in this case he puts his hat on or leaves it on the peg, completely at random. Suppose, moreover, that yesterday bad weather was prognosed, so Jones is wearing his hat. In this case,.... (1)If the weather forecast had been in favor of fine weather, Jones would have been wearing his hat." [Tichy (1976)] Laws: bad hat bad + Basis(w 0 ) L hat Basis(w 0 ): bad
33 3. HOW TO MODEL SIMILARITY 3.4 VELTMAN S PREMISE SEMANTICS Consider a man - call him Jones who is possessed of the following disposition as regards wearing his hat. If the man on the news predicts bad weather, Mr Jones invariably wears his hat the next day. A weather forecast in favor of fine weather, on the other hand, affects him neither way: in this case he puts his hat on or leaves it on the peg, completely at random. Suppose, moreover, that yesterday bad weather was prognosed, so Jones is wearing his hat. In this case,.... (1)If the weather forecast had been in favor of fine weather, Jones would have been wearing his hat." [Tichy (1976)] Laws: bad hat bad + bad L hat Basis(w 0 ): bad
34 3. HOW TO MODEL SIMILARITY 3.4 VELTMAN S PREMISE SEMANTICS Consider a man - call him Jones who is possessed of the following disposition as regards wearing his hat. If the man on the news predicts bad weather, Mr Jones invariably wears his hat the next day. A weather forecast in favor of fine weather, on the other hand, affects him neither way: in this case he puts his hat on or leaves it on the peg, completely at random. Suppose, moreover, that yesterday bad weather was prognosed, so Jones is wearing his hat. In this case,.... (1)If the weather forecast had been in favor of fine weather, Jones would have been wearing his hat." [Tichy (1976)] Laws: bad hat bad + bad bad hat hat Basis(w 0 ): bad
35 3. HOW TO MODEL SIMILARITY 3.4 VELTMAN S PREMISE SEMANTICS Consider a man - call him Jones who is possessed of the following disposition as regards wearing his hat. If the man on the news predicts bad weather, Mr Jones invariably wears his hat the next day. A weather forecast in favor of fine weather, on the other hand, affects him neither way: in this case he puts his hat on or leaves it on the peg, completely at random. Suppose, moreover, that yesterday bad weather was prognosed, so Jones is wearing his hat. In this case,.... (1)If the weather forecast had been in favor of fine weather, Jones would have been wearing his hat." [Tichy (1976)] Laws: bad hat bad bad hat hat Basis(w 0 ): bad
36 3. HOW TO MODEL SIMILARITY 3.4 VELTMAN S PREMISE SEMANTICS Suppose that Jones always flips a coin before he opens the curtains to see what the weather is like. `Heads' means he is going to wear his hat in case the weather is fine, whereas `tails' means he is not going to wear his hat in that case. Like before, bad weather invariably makes him wear his hat. Now suppose that today heads came up when he flipped the coin, and that it is raining. So, again, Jones is wearing his hat. Would you accept the statement: (4)If the weather had been fine, Jones would have been wearing his hat. Laws: bad hat, heads hat Basis(w 0 ): bad, heads bad + Facts of w 0 L hat
37 3. HOW TO MODEL SIMILARITY 3.4 VELTMAN S PREMISE SEMANTICS Suppose that Jones always flips a coin before he opens the curtains to see what the weather is like. `Heads' means he is going to wear his hat in case the weather is fine, whereas `tails' means he is not going to wear his hat in that case. Like before, bad weather invariably makes him wear his hat. Now suppose that today heads came up when he flipped the coin, and that it is raining. So, again, Jones is wearing his hat. Would you accept the statement: (4)If the weather had been fine, Jones would have been wearing his hat. Laws: bad hat, heads hat Basis(w 0 ): bad, heads bad + bad, heads L hat
38 3. HOW TO MODEL SIMILARITY 3.4 VELTMAN S PREMISE SEMANTICS Suppose that Jones always flips a coin before he opens the curtains to see what the weather is like. `Heads' means he is going to wear his hat in case the weather is fine, whereas `tails' means he is not going to wear his hat in that case. Like before, bad weather invariably makes him wear his hat. Now suppose that today heads came up when he flipped the coin, and that it is raining. So, again, Jones is wearing his hat. Would you accept the statement: (4)If the weather had been fine, Jones would have been wearing his hat. Laws: bad hat, heads hat Basis(w 0 ): bad, heads bad, heads L hat
39 3. HOW TO MODEL SIMILARITY 3.6 CAUSALITY MATTERS Lifschitzʼs Circuit Example Suppose there is a circuit such that the light is on (L) exactly when both switches are in the same position (up or not up). At the moment switch 1 is down ( S1), switch two is up (S2) and the lamp is out ( L). (1) If switch 1 had been up, the lamp would have been on. (S1 > L) Laws: (S1 S2) L Basis(w 0 ): { S1, S2}, { S1, L}, {S2, L} A + Facts of w 0 L C
40 3. HOW TO MODEL SIMILARITY 3.6 CAUSALITY MATTERS Lifschitzʼs Circuit Example Suppose there is a circuit such that the light is on (L) exactly when both switches are in the same position (up or not up). At the moment switch 1 is down ( S1), switch two is up (S2) and the lamp is out ( L). (1) If switch 1 had been up, the lamp would have been on. (S1 > L) Laws: (S1 S2) L Basis(w 0 ): { S1, S2}, { S1, L}, {S2, L} S1 + Facts of w 0 L L
41 3. HOW TO MODEL SIMILARITY 3.6 CAUSALITY MATTERS Lifschitzʼs Circuit Example Suppose there is a circuit such that the light is on (L) exactly when both switches are in the same position (up or not up). At the moment switch 1 is down ( S1), switch two is up (S2) and the lamp is out ( L). (1) If switch 1 had been up, the lamp would have been on. (S1 > L) Laws: (S1 S2) L Basis(w 0 ): { S1, S2}, { S1, L}, {S2, L} S1 + Basis(w 0 ) (S1 S2) L L
42 3. HOW TO MODEL SIMILARITY 3.6 CAUSALITY MATTERS The basis B of the evaluation world w0 is the set of primitive facts (literals) of w) from which, given the rules R, all other facts of w0 can be derived. Not: epistemic derivation But: causal derivation A + Basis(w 0 ) L C
43 3. HOW TO MODEL SIMILARITY 3.6 CAUSALITY MATTERS We need a causal notion of consequence: reasoning from cause to effect.
44 MODELING CAUSAL REASONING WITH LOGIC PROGRAMMING Katrin Schulz ILLC/UvA
45 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS We need a causal notion of consequence: reasoning from cause to effect. we want: take A and take causally independent facts of w 0 and calculate the effects the causal notion of consequence should be assymmetric Logic Programming
46 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS Logic Programming A + Basis(w 0 ) L C sentence (partial) model program τ L ((partial) model)
47 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS Standard definition The operator τ P associated to a program P is a function on the set of three valued models. For every propositionletter p the value τ P (M)(p) is defined as follows. 1. τ P (M)(p) = 1 if there is a clause p Φ in P such that M(Φ) = τ P (M)(p) = 0 if for all clauses p Φ in P it holds M (Φ) = τ P (M)(p) = u, otherwise.
48 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS Logic Programming A + Basis(w 0 ) L C sentence (partial) model program τ L ((partial) model)
49 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS Logic Programming A + Basis(w 0 ) L C sentence (partial) model program τ L1 ((partial) model)
50 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS Logic Programming A + Basis(w 0 ) L C sentence (partial) model program τ L2 ((partial) model)
51 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS Logic Programming A + Basis(w 0 ) L C sentence (partial) model program τ L3 ((partial) model )
52 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS Logic Programming A + Basis(w 0 ) L C sentence (partial) model program τ L* ((partial) model ) = C iterated fixed point as designated model to define causal inference
53 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS Logic Programming A + Basis(w 0 ) L C sentence (partial) model program τ L* ((partial) model ) = C iterated fixed point as designated model to define causal inference Laws: A B, C A Conditional: A > C B A C w0
54 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS Logic Programming A + Basis(w 0 ) L C sentence (partial) model program τ L* ((partial) model ) = C iterated fixed point as designated model to define causal inference Laws: A B, C A Conditional: A > C B w0
55 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS Logic Programming A + Basis(w 0 ) L C sentence (partial) model program τ L* ((partial) model ) = C iterated fixed point as designated model to define causal inference Laws: A B, C A B A w0 Conditional: A > C
56 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS Logic Programming A + Basis(w 0 ) L C sentence (partial) model program τ L* ((partial) model ) = C iterated fixed point as designated model to define causal inference Laws: A B, C A Conditional: A > C B A C w0
57 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS Logic Programming A + Basis(w 0 ) L C sentence (partial) model program τ L* ((partial) model ) = C iterated fixed point as designated model to define causal inference Laws: A B, C A Conditional: A > C B A C w0
58 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS What s the problem? the program will overwrite the antecedent because it goes against the laws!
59 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS What s causing the problem? program explanation of the mechanics of reality (partial) model (observed) facts your explanation of the world shouldn t be able to wipe out your observations observations always take priority! This goes against all standard work in logic programming
60 4. A CAUSAL NOTION OF CONSEQUENCE 4.1 INGREDIENTS Two ways to deal with this revise the program to incorporate the new observations as laws change the way programs are applied to models Pearl 00 Schulz 11
61 4. A CAUSAL NOTION OF CONSEQUENCE 4.2 SEMANTIC OPERATORS Standard definition The operator τ P associated to a program P is a function on the set of three valued models. For every propositionletter p the value τ P (M)(p) is defined as follows. 1. τ P (M(p) = 1 if there is a clause p Φ in P such that M(Φ) = τ P (M)(p) = 0 if for all clauses p Φ in P it holds M (Φ) = τ P (M)(p) = u, otherwise.
62 4. A CAUSAL NOTION OF CONSEQUENCE 4.2 SEMANTIC OPERATORS Stenning & van Lambalgen The operator τ P associated to a program P is a function on the set of three valued models. For every propositionletter p the value τ P (M)(p) is defined as follows. 1. τ P (M(p) = 1 if there is a clause p Φ in P such that M(Φ) = τ P (M)(p) = 0 if there is a clause p Φ in P and for all such clauses M (Φ) = τ P (M)(p) = u, otherwise.
63 4. A CAUSAL NOTION OF CONSEQUENCE 4.2 SEMANTIC OPERATORS The new definition The operator τ P associated to a program P is a function on the set of three valued models. For every propositionletter p the value τ P (M)(p) is defined as follows. 1. If M(p) u, then τ P (M)(p) = M(p). 2. If M(p) = u, then a. τ P (M)(p) = 1 if there is a clause p Φ in P such that M(Φ) = 1. b. τ P (M)(p) = 0 if there is a clause p Φ in P and for all such clauses M (Φ) = 0.
64 4. A CAUSAL NOTION OF CONSEQUENCE 4.2 SEMANTIC OPERATORS Results: Program: 1.The operation τ P is monotone w.r.t. the order on models 2.τ P has fixed points and the least fixed point can be reached in finitely many steps. p q p q M1 M2, but τ P (M1) τ P (M2) M1 1 u M2 1 0 τ P (M1) 1 1 τ P (M2) 1 0
65 4. A CAUSAL NOTION OF CONSEQUENCE 4.2 SEMANTIC OPERATORS Results: 1.For all M we have M τ P (M). 2.The iterative application of τ P to a model terminates in a fixed point of τ P after finitely many steps. Definition: For a set of literals Σ (the facts), Σ P C iff C is true on the fixed point τ P* (Σ) of τ P reached by iterating τ P starting from Σ. A + Basis(w 0 ) L C
66 4. A CAUSAL NOTION OF CONSEQUENCE 4.2 SEMANTIC OPERATORS Results: 1.For all M we have M τ P (M). 2.The iterative application of τ P to a model terminates in a fixed point of τ P after finitely many steps. Definition: For a set of literals Σ (the facts), Σ P C iff C is true on the fixed point τ P* (Σ) of τ P reached by iterating τ P starting from Σ. A + Basis(w 0 ) P C
67 BACK TO THE SIMILARITY APPROACH Katrin Schulz ILLC/UvA
68 3. BACK TO SIMILARITY 3.1 THE BASIC CASE Question: Is this notion of inference still modeling reasoning with minimal models? all models Answer: Σ P C iff Min (Σ,P) = C YES!... in a way... How?: Iterated order: you minimize stepwise differences from τ P* (Σ). Σ complete models Min (Σ,P) complete Σ models
69 3. BACK TO SIMILARITY 3.1 THE BASIC CASE Question: Is this notion of inference still modeling reasoning with minimal models? Program: Σ P C iff Min (Σ,P) = C Answer: YES!... in a way... ( )p 1 ( )p 2 q 1 p2 ( )p 3 ( )p 4 q 3 q2 ( )q 1 ( )q 2 ( )q 2 r 1 How?: Iterated order: you minimize stepwise differences from τ P* (Σ). p 1 p 2 q 1 p 3 q 3 q 2 r 1 p 4 which one comes closest to τ P* (Σ)
70 3. BACK TO SIMILARITY 3.1 THE BASIC CASE Question: Is this notion of inference still modeling reasoning with minimal models? Program: Σ P C iff Min (Σ,P) = C Answer: YES!... in a way... ( )p 1 ( )p 2 q 1 p2 ( )p 3 ( )p 4 q 3 q2 ( )q 1 ( )q 2 ( )q 2 r 1 How?: Iterated order: you minimize stepwise differences from τ P* (Σ). p 1 p 2 q 1 p 3 q 3 q 2 r 1 p 4 which one comes closest to τ P* (Σ)
71 3. BACK TO SIMILARITY 3.1 THE BASIC CASE Question: Is this notion of inference still modeling reasoning with minimal models? Program: Σ P C iff Min (Σ,P) = C Answer: YES!... in a way... ( )p 1 ( )p 2 q 1 p2 ( )p 3 ( )p 4 q 3 q2 ( )q 1 ( )q 2 ( )q 2 r 1 How?: Iterated order: you minimize stepwise differences from τ P* (Σ). p 1 p 2 q 1 p 3 q 3 q 2 r 1 p 4 which one comes closest to τ P* (Σ)
72 3. BACK TO SIMILARITY 3.1 THE BASIC CASE Question: Is this notion of inference still modeling reasoning with minimal models? Program: Σ P C iff Min (Σ,P) = C Answer: YES!... in a way... ( )p 1 ( )p 2 q 1 p2 ( )p 3 ( )p 4 q 3 q2 ( )q 1 ( )q 2 ( )q 2 r 1 How?: Iterated order: you minimize stepwise differences from τ P* (Σ). p 1 p 2 q 1 p 3 q 3 q 2 r 1 p 4 which one comes closest to τ P* (Σ)
73 3. BACK TO SIMILARITY 3.2 CONDITIONALS A conditional sentence If A then C is true iff: A + Facts of w 0 P C maximal consistent subset causal notion of basis causal notion of consequence general laws Basis(w 0 ) = minimal set of primitive facts of w 0 from which, given L, all other facts of w 0 can be causally derived. Particular variant of Premise Semantics but based on a different logic!
74 3. BACK TO SIMILARITY 3.2 CONDITIONALS Question: Is this version of premise semantics still a special case of minimal world reasoning? Can we recast this approach in terms of the Lewis/ Stalnaker similarity approach? Answer: YES!
75 CONCLUSIONS Katrin Schulz ILLC/UvA
76 4. CONCLUSIONS 4.1 THE RESULTS with simple tools from logic programming we can account for many central examples in the literature on counterfactuals no open technical questions for this static system but what about updating with counterfactuals? and many open philosophical issues relation counterfactuals causality taking a particular stance towards causality (interventionalist approach)
77 4. CONCLUSIONS 4.2 IS THIS REALLY ABOUT CAUSALITY? conditionals exploit certain invariant relationships, certain asymmetric dependencies what unifies these relationships is that the expressed dependency is one of manipulation and control: A stands in this relation to B if manipulating A will change B in a systematic way; by manipulating A one can control B an invariant relationship with these properties I call a causal relation
78 4. CONCLUSIONS 4.2 IS THIS REALLY ABOUT CAUSALITY? King Ludwig of Bavaria likes to spend his weekends at Leoni Castle. Whenever the Royal Bavarian flag is up and the lights are on, the King is in the Castle. At the moment the lights are on, the flag is down, and the King is away. Suppose now counterfactually that the flag were up. Well, then the King would be in the castle and the lights would still be on. But why wouldn't the lights be out and the King still be away? Kratzer, Lumps of Thought, p. 640
79 4. CONCLUSIONS 4.2 IS THIS REALLY ABOUT CAUSALITY? It is a simple fact of basic math that if you add two natural numbers that are both even or uneven, the sum will be even, but if one of the numbers is even and the other uneven the sum is uneven. Suppose you re explaining this fact to some school kids and you have on the board = 7. You say... (11) If the first number had been even, the result would have been even. (12) If the result had been even, the first number would have been even.
80 4. CONCLUSIONS 4.2 IS THIS REALLY ABOUT CAUSALITY? Beth 55: in everyday usage of causality we make no difference between conventional rules and `real causality.
81 4. CONCLUSIONS 4.3 WHAT IS CAUSALITY? Beth 55: in everyday usage of causality we make no difference between conventional rules and `real causality.
82 4. CONCLUSIONS 4.3 WHAT IS CAUSALITY? Beth, Algemeene Beschouwingen over causaliteit: So beschouwd, is het causaliteitsbeginsel dus geen principe a priori; maar het is ook geen natuurwet en zeker geen conventie. We kunnen misschien het beste zeggen, dat het causaliteitsbeginsel op een mede door historische factoren bepaalde wijze uitdrukking geeft aan een algemeenmenselijke neiging, op grond van spontaan geäpperciëerde causale (en andere) verbanden een meer, en zo mogelijk alles, omvattende causale structuur op te bouwen, die ons in staat stelt het universum waarin wij leven als een kosmos te begrijpen
83 4. CONCLUSIONS 4.3 WHAT IS CAUSALITY? Beth, Algemeene Beschouwingen over causaliteit: From this perspective, the principle of causality is not a principle a priori; but it is also not a law of nature and certainly not a convention. Maybe, the best we can say is that the principle of causality expresses, partly determined by historical factors, a human tendency to build, based on spontaneously experienced causal (and other) relations, a more, and, if possible, all, including causal structure, which enables us to understand the universe we live in.
84 MINIMAL MODELS WITH THREE-VALUED LOGIC Katrin Schulz ILLC, Amsterdam
Minimal models with three-valued logic: The case of counterfactual conditionals
Minimal models with three-valued logic: The case of counterfactual conditionals 1. Introduction This paper is about non-monotonic logic and its applications. I will try to bring together two different
More informationAntecedents of counterfactuals violate de Morgan s law
Antecedents of counterfactuals violate de Morgan s law Lucas Champollion champollion@nyu.edu Joint work with Ivano Ciardelli and Linmin Zhang Fourth Workshop on Natural Language and Computer Science (NLCS
More informationIf you d wiggled A, then B would ve changed Causality and counterfactual conditionals
If you d wiggled A, then B would ve changed Causality and counterfactual conditionals Katrin Schulz ILLC University of Amsterdam k.schulz@uva.nl 1. Introduction (1) a. If you had practiced more, you would
More informationFake Tense! in structural models. Katrin Schulz! ILLC, University of Amsterdam
Fake Tense! in structural models Katrin Schulz! ILLC, University of Amsterdam 1 The Problem Fake Tense In English subjunctive conditionals the Simple Past, and also the Past Perfect appear not to be interpreted
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 informationMaking Counterfactual Assumptions
Making Counterfactual Assumptions Frank Veltman Institute for Logic, Language and Computation University of Amsterdam Abstract This paper provides an update semantics for counterfactual conditionals. It
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 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 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 informationStructured Possible Worlds
Structured Possible Worlds Will Starr Cornell University will.starr@cornell.edu :: http://williamstarr.net May 15, 2014...................................................................................
More informationBreaking de Morgan s law in counterfactual antecedents
Breaking de Morgan s law in counterfactual antecedents Lucas Champollion New York University champollion@nyu.edu Ivano Ciardelli University of Amsterdam i.a.ciardelli@uva.nl Linmin Zhang New York University
More informationAdvanced Topics in LP and FP
Lecture 1: Prolog and Summary of this lecture 1 Introduction to Prolog 2 3 Truth value evaluation 4 Prolog Logic programming language Introduction to Prolog Introduced in the 1970s Program = collection
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 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 informationWeak Completion Semantics
Weak Completion Semantics International Center for Computational Logic Technische Universität Dresden Germany Some Human Reasoning Tasks Logic Programs Non-Monotonicity Łukasiewicz Logic Least Models Weak
More informationSIMILARITY IS A BAD GUIDE TO COUNTERFACTUAL TRUTH. The Lewis-Stalnaker logic systems [2] account for a wide range of intuitions about
SIMILARITY IS A BAD GUIDE TO COUNTERFACTUAL TRUTH ABSTRACT. The most popular theory of how to evaluate counterfactuals is to use the Lewis- Stalnaker logic together with some reasonably tractable refinement
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 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 informationMaking Counterfactual Assumptions
Journal of Semantics 22: 159 180 doi:10.1093/jos/ffh022 Making Counterfactual Assumptions FRANK VELTMAN Institute for Logic, Language and Computation, University of Amsterdam Abstract This paper provides
More informationThe Ontology of Counter Factual Causality and Conditional
Philosophy Study, ISSN 2159-5313 July 2014, Vol. 4, No. 7, 492-496. doi: 10.17265/2159-5313/2014.07.005 D DAVID PUBLISHING The Ontology of Counter Factual Causality and Conditional Maduabuchi Dukor Nnamdi
More informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationConditionals. Ray Briggs Stanford University
Conditionals Ray Briggs Stanford University Example Conditionals 1. If the Axiom of Choice is true, then every set can be well ordered. 2. You will probably get lung cancer if you smoke. 3. If the syrup
More informationSocial Science Counterfactuals. Julian Reiss, Durham University
Social Science Counterfactuals Julian Reiss, Durham University Social Science Counterfactuals Julian Reiss, Durham University Counterfactuals in Social Science Stand-ins for causal claims about singular
More informationMaryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules Math. of1101 Inference 1 / 13
Maryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules 151 - Math. of1101 Inference 1 / 13 Maryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules 151 - Math.
More informationHolding on and letting go: Facts, counterfactuals, and before
Holding on and letting go: Facts, counterfactuals, and before Cleo Condoravdi PARC and Stanford University Stefan Kaufmann Northwestern University Tenth Stanford Semantics Fest March 14, 2009 Goals of
More informationFor all For every For each For any There exists at least one There exists There is Some
Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following
More informationLogic and Philosophical Logic. 1 Inferentialism. Inferentialism and Meaning Underdetermination
Logic and Philosophical Logic Inferentialism and Meaning Underdetermination AC Paseau alexanderpaseau@philosophyoxacuk 28 January 2019 In the rst half of today's class, we looked at Tarski's account of
More informationPrécis of Modality and Explanatory Reasoning
Précis of Modality and Explanatory Reasoning The aim of Modality and Explanatory Reasoning (MER) is to shed light on metaphysical necessity and the broader class of modal properties to which it belongs.
More informationTense and Mood in conditional sentences. Katrin Schulz ILLC/University of Amsterdam
Tense and Mood in conditional sentences Katrin Schulz ILLC/University of Amsterdam K.Schulz@uva.nl 1 1. Introduction 2 1. Introduction Aim of the research: 3 1. Introduction Aim of the research: A compositional
More informationFrom Causal Models To Counterfactual Structures
From Causal Models To Counterfactual Structures Joseph Y. Halpern Cornell University halpern@cs.cornell.edu June 14, 2011 Abstract Galles and Pearl [1998] claimed that for recursive models, the causal
More informationSkeptical Abduction: A Connectionist Network
Skeptical Abduction: A Connectionist Network Technische Universität Dresden Luis Palacios Medinacelli Supervisors: Prof. Steffen Hölldobler Emmanuelle-Anna Dietz 1 To my family. Abstract A key research
More informationInstructor: Sudeepa Roy
CompSci 590.6 Understanding Data: Theory and Applications Lecture 15 Causality in AI Instructor: Sudeepa Roy Email: sudeepa@cs.duke.edu 1 Today s Reading 1. Causes and Explanations: A Structural- Model
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 informationCS 2740 Knowledge Representation. Lecture 4. Propositional logic. CS 2740 Knowledge Representation. Administration
Lecture 4 Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square dministration Homework assignment 1 is out Due next week on Wednesday, September 17 Problems: LISP programming a PL
More informationLOCAL AND GLOBAL INTERPRETATIONS OF CONDITIONALS STEFAN KAUFMANN ERICA WINSTON DEBORAH ZUTTY
LOCAL AND GLOBAL INTERPRETATIONS OF CONDITIONALS STEFAN KAUFMANN ERICA WINSTON DEBORAH ZUTTY Department of Linguistics Northwestern University {kaufmann, e-winston, d-zutty}@northwestern.edu The unified
More informationTooley on backward causation
Tooley on backward causation Paul Noordhof Michael Tooley has argued that, if backward causation (of a certain kind) is possible, then a Stalnaker-Lewis account of the truth conditions of counterfactuals
More informationAppendix A Lewis s Counterfactuals
Appendix A Lewis s Counterfactuals I will briefly describe David Lewis s possible world semantics of counterfactual conditionals (1973, p. 13). Let us understand a possible world simply as a way things
More informationThe Importance of Being Formal. Martin Henz. February 5, Propositional Logic
The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets
More informationLecture 3: Semantics of Propositional Logic
Lecture 3: Semantics of Propositional Logic 1 Semantics of Propositional Logic Every language has two aspects: syntax and semantics. While syntax deals with the form or structure of the language, it is
More informationAgainst the F-score. Adam Yedidia. December 8, This essay explains why the F-score is a poor metric for the success of a statistical prediction.
Against the F-score Adam Yedidia December 8, 2016 This essay explains why the F-score is a poor metric for the success of a statistical prediction. 1 What is the F-score? From Wikipedia: In statistical
More information03 Propositional Logic II
Martin Henz February 12, 2014 Generated on Wednesday 12 th February, 2014, 09:49 1 Review: Syntax and Semantics of Propositional Logic 2 3 Propositional Atoms and Propositions Semantics of Formulas Validity,
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 informationIn Newcomb s problem, an agent is faced with a choice between acts that
Aporia vol. 23 no. 2 2013 Counterfactuals and Causal Decision Theory Kevin Dorst In Newcomb s problem, an agent is faced with a choice between acts that are highly correlated with certain outcomes, but
More informationTutorial: Nonmonotonic Logic
Tutorial: Nonmonotonic Logic PhDs in Logic (2017) Christian Straßer May 2, 2017 Outline Defeasible Reasoning Scratching the Surface of Nonmonotonic Logic 1/52 Defeasible Reasoning What is defeasible reasoning?
More informationIntroduction Propositional Logic. Discrete Mathematics Andrei Bulatov
Introduction Propositional Logic Discrete Mathematics Andrei Bulatov Discrete Mathematics Propositional Logic 2-2 What is Logic? Computer science is a mere continuation of logic by other means Georg Gottlob
More informationNumbers that are divisible by 2 are even. The above statement could also be written in other logically equivalent ways, such as:
3.4 THE CONDITIONAL & BICONDITIONAL Definition. Any statement that can be put in the form If p, then q, where p and q are basic statements, is called a conditional statement and is written symbolically
More informationUsing Counterfactuals in Knowledge-Based Programming
Using Counterfactuals in Knowledge-Based Programming Joseph Y. Halpern Cornell University Dept. of Computer Science Ithaca, NY 14853 halpern@cs.cornell.edu http://www.cs.cornell.edu/home/halpern Yoram
More informationAn Inquisitive Formalization of Interrogative Inquiry
An Inquisitive Formalization of Interrogative Inquiry Yacin Hamami 1 Introduction and motivation The notion of interrogative inquiry refers to the process of knowledge-seeking by questioning [5, 6]. As
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
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 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 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 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 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 informationLogic, Human Logic, and Propositional Logic. Human Logic. Fragments of Information. Conclusions. Foundations of Semantics LING 130 James Pustejovsky
Logic, Human Logic, and Propositional Logic Foundations of Semantics LING 3 James Pustejovsky Human Logic Thanks to Michael Genesereth of Stanford for use of some slides Fragments of Information Conclusions
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 informationKLEENE LOGIC AND INFERENCE
Bulletin of the Section of Logic Volume 4:1/2 (2014), pp. 4 2 Grzegorz Malinowski KLEENE LOGIC AND INFERENCE Abstract In the paper a distinguished three-valued construction by Kleene [2] is analyzed. 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 informationOn updates with integrity constraints
On updates with integrity constraints Andreas Herzig IRIT-CNRS mailto:andreas.herzig@irit.fr http://www.irit.fr/ Andreas.Herzig August 8, 2005 Abstract In his paper Making Counterfactual Assumptions Frank
More informationLewis Counterfactual Theory of Causation
Lewis Counterfactual Theory of Causation Summary An account only of deterministic, token causation. Causation = counterfactual dependence + right semantics for counterfactuals + transitivity E depends
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 informationPropositional Logic: Models and Proofs
Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505
More informationComputational Logic Lecture 3. Logical Entailment. Michael Genesereth Autumn Logical Reasoning
Computational Logic Lecture 3 Logical Entailment Michael Genesereth Autumn 2010 Logical Reasoning Logical Reasoning relates premises and conclusion does not say whether conclusion is true in general says
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 informationLimits to Approximability: When Algorithms Won't Help You. Note: Contents of today s lecture won t be on the exam
Limits to Approximability: When Algorithms Won't Help You Note: Contents of today s lecture won t be on the exam Outline Limits to Approximability: basic results Detour: Provers, verifiers, and NP Graph
More informationThe paradox of knowability, the knower, and the believer
The paradox of knowability, the knower, and the believer Last time, when discussing the surprise exam paradox, we discussed the possibility that some claims could be true, but not knowable by certain individuals
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 informationGender in conditionals
Gender in conditionals Fabio Del Prete 1 Sandro Zucchi 2 1 CLLE-ERSS (CNRS, Toulouse), 2 Università degli Studi di Milano 9 November 2017 The University of Sheffield, Department of Philosophy Indexical
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationDiscrete Structures of Computer Science Propositional Logic I
Discrete Structures of Computer Science Propositional Logic I Gazihan Alankuş (Based on original slides by Brahim Hnich) July 26, 2012 1 Use of Logic 2 Statements 3 Logic Connectives 4 Truth Tables Use
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 informationirst we need to know that there are many ways to indicate multiplication; for example the product of 5 and 7 can be written in a variety of ways:
CH 2 VARIABLES INTRODUCTION F irst we need to know that there are many ways to indicate multiplication; for example the product of 5 and 7 can be written in a variety of ways: 5 7 5 7 5(7) (5)7 (5)(7)
More informationTRUTH TABLES LOGIC (CONTINUED) Philosophical Methods
TRUTH TABLES LOGIC (CONTINUED) Philosophical Methods Here s some Vocabulary we will be talking about in this PowerPoint. Atomic Sentences: Statements which express one proposition Connectives: These are
More informationCS280, Spring 2004: Final
CS280, Spring 2004: Final 1. [4 points] Which of the following relations on {0, 1, 2, 3} is an equivalence relation. (If it is, explain why. If it isn t, explain why not.) Just saying Yes or No with no
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 informationLogical reasoning - Can we formalise our thought processes?
Logical reasoning - Can we formalise our thought processes? Why study (mathematical) logic? Logic: the science or method of reasoning Logical: able to reason correctly Human reasoning poorly understood,
More informationlogic is everywhere Logik ist überall Hikmat har Jaga Hai Mantık her yerde la logica è dappertutto lógica está em toda parte
Steffen Hölldobler logika je všude logic is everywhere la lógica está por todas partes Logika ada di mana-mana lógica está em toda parte la logique est partout Hikmat har Jaga Hai Human Reasoning, Logic
More informationCAUSATION. Chapter 5. Humean Reductionism - Counterfactual Approaches
CAUSATION Chapter 5 Humean Reductionism - Counterfactual Approaches A second important reductionist approach attempts to analyze causation in terms of counterfactuals. Such approaches come in different
More informationCausation and probability in indicative and counterfactual conditionals
Causation and probability in indicative and counterfactual conditionals Daniel Lassiter Stanford University Draft as of August 14, 2018. Comments, criticisms, suggestions, and questions very welcome: danlassiter@stanford.edu.
More informationGlossary of Logical Terms
Math 304 Spring 2007 Glossary of Logical Terms The following glossary briefly describes some of the major technical logical terms used in this course. The glossary should be read through at the beginning
More informationWhat if Every "If Only" Statement Were True?: The Logic of Counterfactuals
Michigan State University College of Law Digital Commons at Michigan State University College of Law Faculty Publications 1-1-2008 What if Every "If Only" Statement Were True?: The Logic of Counterfactuals
More informationApproaching the Logic of Conversational Implicatures
Approaching the Logic of Conversational Implicatures Robert van Rooy & Katrin Schulz ILLC/University of Amsterdam R.A.M.vanRooij/K.Schulz@uva.nl 1. Introduction 1.1 Aim of the Research Describe the logic
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 informationUnit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9
Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Typeset September 23, 2005 1 Statements or propositions Defn: A statement is an assertion
More informationLogic. Propositional Logic: Syntax. Wffs
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 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 informationLearning to Act: Qualitative Learning of Deterministic Action Models
Learning to Act: Qualitative Learning of Deterministic Action Models Thomas Bolander Nina Gierasimczuk October 8, 2017 Abstract In this paper we study learnability of fully observable, universally applicable
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 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 informationRelations. Carl Pollard. October 11, Department of Linguistics Ohio State University
Department of Linguistics Ohio State University October 11, 2011 (Intuitive Idea) Intuitively, a relation is the kind of thing that either holds or doesn t hold between certain things. Examples: Being
More informationWhy Care About Counterfactual Support? The Cognitive Uses of Causal Order Lecture 2
Why Care About Counterfactual Support? The Cognitive Uses of Causal Order Lecture 2 You Do Care About Counterfactual Support Two Regularities All uranium spheres are less than a mile in diameter All gold
More informationMcTaggart s Argument for the Unreality of Time:
McTaggart s Argument for the Unreality of Time: A Temporal Logical Analysis Hunan Rostomyan In this paper I want to examine McTaggart s [1908] argument for the unreality of time. McTaggart starts with
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 informationPropositional Logic: Review
Propositional Logic: Review Propositional logic Logical constants: true, false Propositional symbols: P, Q, S,... (atomic sentences) Wrapping parentheses: ( ) Sentences are combined by connectives:...and...or
More information22c:145 Artificial Intelligence
22c:145 Artificial Intelligence Fall 2005 Propositional Logic Cesare Tinelli The University of Iowa Copyright 2001-05 Cesare Tinelli and Hantao Zhang. a a These notes are copyrighted material and may not
More informationPropositional Logic: Syntax
Logic Logic is a tool for formalizing reasoning. There are lots of different logics: probabilistic logic: for reasoning about probability temporal logic: for reasoning about time (and programs) epistemic
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 informationPropositional Logic Truth-functionality Definitions Soundness Completeness Inferences. Modal Logic. Daniel Bonevac.
January 22, 2013 Modal logic is, among other things, the logic of possibility and necessity. Its history goes back at least to Aristotle s discussion of modal syllogisms in the Prior Analytics. But modern
More informationYou may not start to read the questions printed on the subsequent pages of this question paper until instructed that you may do so by the Invigilator
PHT0/3 PHILOSOPHY TRIPOS Part IA TUESDAY 29 May 2018 09.00 12.00 Paper 3 LOGIC Answer three questions only; at least one from each of sections A and B. Write the number of the question at the beginning
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 information