Huimin Dong Norbert Gratzl Open Reading for Free Choice Permission A Perspective from Substructural Logics Colloquium Logicum 2016, Universität Hamburg September 12th 2016, Hamburg
Outlines Motivations Open Reading Substructural Logics An Example Conclusions Huimin Dong, Norbert Gratzl September 12th 2016, Hamburg 2 / 18
History Canonical Form of FCP: September 12th 2016, Hamburg Huimin Dong, Norbert Gratzl Studia Logica, 1996. F. Dignum, J.-J. Ch. Meyer, and R.J. Wieringa. Free choice and contextually permitted actions . G.H. von Wright. An essay in deontic logic and the general theory of action . 1968. 3 / 18 Dynamic approach of free choice permission: choice permission (FCP), open reading, etc. strong/weak permission, explicit/implied/tacit permission, free Many faces of permissions: Standard Deontic Logic: Permission = df the dual of Obligation O ( A ∧ B ) ⊂⊃ OA ∧ OB P ( A ∨ B ) ⊂⊃ PA ∨ PB P ( A ) = [ A ] ¬ Violation P ( A ∨ B ) ⊃ PA ∧ PB
History Canonical Form of FCP: September 12th 2016, Hamburg Huimin Dong, Norbert Gratzl Studia Logica, 1996. F. Dignum, J.-J. Ch. Meyer, and R.J. Wieringa. Free choice and contextually permitted actions . G.H. von Wright. An essay in deontic logic and the general theory of action . 1968. 3 / 18 Dynamic approach of free choice permission: choice permission (FCP), open reading, etc. strong/weak permission, explicit/implied/tacit permission, free Many faces of permissions: Standard Deontic Logic: Permission = df the dual of Obligation O ( A ∧ B ) ⊂⊃ OA ∧ OB P ( A ∨ B ) ⊂⊃ PA ∨ PB P ( A ) = [ A ] ¬ Violation P ( A ∨ B ) ⊃ PA ∧ PB
History Canonical Form of FCP: September 12th 2016, Hamburg Huimin Dong, Norbert Gratzl Studia Logica, 1996. F. Dignum, J.-J. Ch. Meyer, and R.J. Wieringa. Free choice and contextually permitted actions . G.H. von Wright. An essay in deontic logic and the general theory of action . 1968. 3 / 18 Dynamic approach of free choice permission: choice permission (FCP), open reading, etc. strong/weak permission, explicit/implied/tacit permission, free Many faces of permissions: Standard Deontic Logic: Permission = df the dual of Obligation O ( A ∧ B ) ⊂⊃ OA ∧ OB P ( A ∨ B ) ⊂⊃ PA ∨ PB P ( A ) = [ A ] ¬ Violation P ( A ∨ B ) ⊃ PA ∧ PB
History Canonical Form of FCP: September 12th 2016, Hamburg Huimin Dong, Norbert Gratzl Studia Logica, 1996. F. Dignum, J.-J. Ch. Meyer, and R.J. Wieringa. Free choice and contextually permitted actions . G.H. von Wright. An essay in deontic logic and the general theory of action . 1968. 3 / 18 Dynamic approach of free choice permission: choice permission (FCP), open reading, etc. strong/weak permission, explicit/implied/tacit permission, free Many faces of permissions: Standard Deontic Logic: Permission = df the dual of Obligation O ( A ∧ B ) ⊂⊃ OA ∧ OB P ( A ∨ B ) ⊂⊃ PA ∨ PB P ( A ) = [ A ] ¬ Violation P ( A ∨ B ) ⊃ PA ∧ PB
History Canonical Form of FCP: September 12th 2016, Hamburg Huimin Dong, Norbert Gratzl Studia Logica, 1996. F. Dignum, J.-J. Ch. Meyer, and R.J. Wieringa. Free choice and contextually permitted actions . G.H. von Wright. An essay in deontic logic and the general theory of action . 1968. 3 / 18 Dynamic approach of free choice permission: choice permission (FCP), open reading, etc. strong/weak permission, explicit/implied/tacit permission, free Many faces of permissions: Standard Deontic Logic: Permission = df the dual of Obligation O ( A ∧ B ) ⊂⊃ OA ∧ OB P ( A ∨ B ) ⊂⊃ PA ∨ PB P ( A ) = [ A ] ¬ Violation P ( A ∨ B ) ⊃ PA ∧ PB
History Canonical Form of FCP: September 12th 2016, Hamburg Huimin Dong, Norbert Gratzl Studia Logica, 1996. F. Dignum, J.-J. Ch. Meyer, and R.J. Wieringa. Free choice and contextually permitted actions . G.H. von Wright. An essay in deontic logic and the general theory of action . 1968. 3 / 18 Dynamic approach of free choice permission: choice permission (FCP), open reading, etc. strong/weak permission, explicit/implied/tacit permission, free Many faces of permissions: Standard Deontic Logic: Permission = df the dual of Obligation O ( A ∧ B ) ⊂⊃ OA ∧ OB P ( A ∨ B ) ⊂⊃ PA ∨ PB P ( A ) = [ A ] ¬ Violation P ( A ∨ B ) ⊃ PA ∧ PB
Problems of FCP Monotonic case: Vegetarian free lunch Resource insensitive case: Irrelevant case: Sven Ove Hansson. The varieties of permissions . Handbook of Deontic Logic and Normative Systems, volume 1. 2013. Huimin Dong, Norbert Gratzl September 12th 2016, Hamburg 4 / 18 1 PA ⊃ P ( A ∧ B ) P ( Order ) ⊃ P ( Order ∧ not Pay ) P ( Eat a cookie ) ⊃ P ( Eat a cookie ∧ Eat a cookie ) 2 P ( A ∨ ∼ A ) ⊃ PB P ( Open Window ∨ not Open Window ) ⊂⊃ P ( Sell House ∨ not Sell House ) ⊃ P ( Sell House )
Problems of FCP Monotonic case: Vegetarian free lunch Resource insensitive case: Irrelevant case: Sven Ove Hansson. The varieties of permissions . Handbook of Deontic Logic and Normative Systems, volume 1. 2013. Huimin Dong, Norbert Gratzl September 12th 2016, Hamburg 4 / 18 1 PA ⊃ P ( A ∧ B ) P ( Order ) ⊃ P ( Order ∧ not Pay ) P ( Eat a cookie ) ⊃ P ( Eat a cookie ∧ Eat a cookie ) 2 P ( A ∨ ∼ A ) ⊃ PB P ( Open Window ∨ not Open Window ) ⊂⊃ P ( Sell House ∨ not Sell House ) ⊃ P ( Sell House )
Problems of FCP Monotonic case: Vegetarian free lunch Resource insensitive case: Irrelevant case: Sven Ove Hansson. The varieties of permissions . Handbook of Deontic Logic and Normative Systems, volume 1. 2013. Huimin Dong, Norbert Gratzl September 12th 2016, Hamburg 4 / 18 1 PA ⊃ P ( A ∧ B ) P ( Order ) ⊃ P ( Order ∧ not Pay ) P ( Eat a cookie ) ⊃ P ( Eat a cookie ∧ Eat a cookie ) 2 P ( A ∨ ∼ A ) ⊃ PB P ( Open Window ∨ not Open Window ) ⊂⊃ P ( Sell House ∨ not Sell House ) ⊃ P ( Sell House )
Problems of FCP Monotonic case: Vegetarian free lunch Resource insensitive case: Irrelevant case: Sven Ove Hansson. The varieties of permissions . Handbook of Deontic Logic and Normative Systems, volume 1. 2013. Huimin Dong, Norbert Gratzl September 12th 2016, Hamburg 4 / 18 1 PA ⊃ P ( A ∧ B ) P ( Order ) ⊃ P ( Order ∧ not Pay ) P ( Eat a cookie ) ⊃ P ( Eat a cookie ∧ Eat a cookie ) 2 P ( A ∨ ∼ A ) ⊃ PB P ( Open Window ∨ not Open Window ) ⊂⊃ P ( Sell House ∨ not Sell House ) ⊃ P ( Sell House )
Possible Solutions Resource Sensitivity Chris Barker. Freechoicepermissionasresource-sensitivereasoning . Semantics and Pragmat- ics, 2010. Negation Sun Xin and H. Dong. The deontic dilemma of action negation, and its solution . LOFT 2014. Three Difgiculties in FCP AlbertJ.J.Anglberger, H.Dong, andOlivierRoy. Openreadingwithoutfreechoice . DEON2014. and so on... Huimin Dong, Norbert Gratzl September 12th 2016, Hamburg 5 / 18
Our Strategy 1 Open Reading (OR): An action type A is permitted ifg each token of A is normatively OK. 2 FCP inference 3 Our two-fold strategy: 2 To save the plausible case: AlbertJ.J.Anglberger, H.Dong, andOlivierRoy. Openreadingwithoutfreechoice . DEON2014. Huimin Dong, Norbert Gratzl September 12th 2016, Hamburg 6 / 18 A ⊸ B ⊢ PB ⊃ PA 1 To avoid the problems: ( A ∧ B ) ⊸ A , ( A ∧ ⋯ ∧ A ) ⊸ A , and ( A ∨ ∼ A ) ⧟ ( B ∨ ∼ B ) ( Order ∧ Pay ) ⊸ Order ⊢ P ( Order ) ⊃ P ( Order ∧ Pay ) 4 A ⊸ B : “If A , normally , then B .”
Our Strategy 1 Open Reading (OR): An action type A is permitted ifg each token of A is normatively OK. 2 FCP inference 3 Our two-fold strategy: 2 To save the plausible case: AlbertJ.J.Anglberger, H.Dong, andOlivierRoy. Openreadingwithoutfreechoice . DEON2014. Huimin Dong, Norbert Gratzl September 12th 2016, Hamburg 6 / 18 A ⊸ B ⊢ PB ⊃ PA 1 To avoid the problems: ( A ∧ B ) ⊸ A , ( A ∧ ⋯ ∧ A ) ⊸ A , and ( A ∨ ∼ A ) ⧟ ( B ∨ ∼ B ) ( Order ∧ Pay ) ⊸ Order ⊢ P ( Order ) ⊃ P ( Order ∧ Pay ) 4 A ⊸ B : “If A , normally , then B .”
Our Strategy 1 Open Reading (OR): An action type A is permitted ifg each token of A is normatively OK. 2 FCP inference 3 Our two-fold strategy: 2 To save the plausible case: AlbertJ.J.Anglberger, H.Dong, andOlivierRoy. Openreadingwithoutfreechoice . DEON2014. Huimin Dong, Norbert Gratzl September 12th 2016, Hamburg 6 / 18 A ⊸ B ⊢ PB ⊃ PA 1 To avoid the problems: ( A ∧ B ) ⊸ A , ( A ∧ ⋯ ∧ A ) ⊸ A , and ( A ∨ ∼ A ) ⧟ ( B ∨ ∼ B ) ( Order ∧ Pay ) ⊸ Order ⊢ P ( Order ) ⊃ P ( Order ∧ Pay ) 4 A ⊸ B : “If A , normally , then B .”
Our Strategy 1 Open Reading (OR): An action type A is permitted ifg each token of A is normatively OK. 2 FCP inference 3 Our two-fold strategy: 2 To save the plausible case: AlbertJ.J.Anglberger, H.Dong, andOlivierRoy. Openreadingwithoutfreechoice . DEON2014. Huimin Dong, Norbert Gratzl September 12th 2016, Hamburg 6 / 18 A ⊸ B ⊢ PB ⊃ PA 1 To avoid the problems: ( A ∧ B ) ⊸ A , ( A ∧ ⋯ ∧ A ) ⊸ A , and ( A ∨ ∼ A ) ⧟ ( B ∨ ∼ B ) ( Order ∧ Pay ) ⊸ Order ⊢ P ( Order ) ⊃ P ( Order ∧ Pay ) 4 A ⊸ B : “If A , normally , then B .”
Recommend
More recommend