Generalized Conditionalization and the Sleeping Beauty Problem

Erkenntnis 78 (2):333-351 (2013)
  Copy   BIBTEX

Abstract

We present a new argument for the claim that in the Sleeping Beauty problem, the probability that the coin comes up heads is 1/3. Our argument depends on a principle for the updating of probabilities that we call ‘generalized conditionalization’, and on a species of generalized conditionalization we call ‘synchronic conditionalization on old information’. We set forth a rationale for the legitimacy of generalized conditionalization, and we explain why our new argument for thirdism is immune to two attacks that Pust (Synthese 160:97–101, 2008) has leveled at other arguments for thirdism

Other Versions

No versions found

Analytics

Added to PP
2011-08-13

Downloads
394 (#122,655)

6 months
67 (#144,233)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Terry Horgan
University of Arizona
Anna Mahtani
London School of Economics

References found in this work

Theory and Evidence.Clark N. Glymour - 1980 - Princeton University Press.
What conditional probability could not be.Alan Hájek - 2003 - Synthese 137 (3):273--323.
Sleeping beauty: Reply to Elga.David Lewis - 2001 - Analysis 61 (3):171–76.
Some Problems for Conditionalization and Reflection.Frank Arntzenius - 2003 - Journal of Philosophy 100 (7):356-370.

View all 23 references / Add more references