论文信息 - Two Attempts to Formalize Counterpossible Reasoning in Deterministic Settings

Two Attempts to Formalize Counterpossible Reasoning in Deterministic Settings

This paper motivates the study of counterpossibles logically impossible counterfactuals as necessary for developing a decision theory suitable for generally intelligent agents embedded within their environments. We discuss two attempts to formalize a decision theory using counterpossibles, one based on graphical models and another based on proof search.

Benja Fallenstein | Nate Soares | Benja Fallenstein | N. Soares

[1] E. Rowland. Theory of Games and Economic Behavior , 1946, Nature.

[2] M. Bar-Hillel,et al. Newcomb's Paradox Revisited , 1972, The British Journal for the Philosophy of Science.

[3] Daniel Cohen,et al. On What Cannot Be , 1990 .

[4] R. Jeffrey. The Logic of Decision , 1984 .

[5] Robert Nozick,et al. Newcomb’s Problem and Two Principles of Choice , 1969 .

[6] C. Aitken,et al. The logic of decision , 2014 .

[7] Illtyd Trethowan. Causality , 1938 .

[8] David Lewis,et al. Causal decision theory , 1981 .

[9] J. M. Dunn,et al. Truth or consequences : essays in honor of Nuel Belnap , 1993 .

[10] D. Lewis. Papers in Ethics and Social Philosophy: Why ain'cha rich? , 1981 .

[11] Tsvi Benson-Tilsen,et al. UDT WITH KNOWN SEARCH ORDER , 2014 .

[12] E. Lehmann. Some Principles of the Theory of Testing Hypotheses , 1950 .

[13] J. Pearl. Causality: Models, Reasoning and Inference , 2000 .

[14] S. Brams,et al. Prisoners' Dilemma is a Newcomb Problem , 2013 .

[15] William Harper,et al. Counterfactuals and Two Kinds of Expected Utility , 1978 .