Alan Hajek

“Pascal's Wager” is the name given to an argument due to Blaise Pascal for believing, or for at least taking steps to believe, in God. The name is somewhat misleading, for in a single paragraph of his Pensées, Pascal apparently presents at least three such arguments, each of which might be called a ‘wager’ — it is only the final of these that is traditionally referred to as “Pascal's Wager”. We find in it the extraordinary confluence of several important strands of thought: the justification of theism; probability theory and decision theory, used here for almost the first time in history; pragmatism; voluntarism (the thesis that belief is a matter of the will); and the use of the concept of infinity

Counterfactuals are a species of conditionals. They are propositions or sentences, expressed by or equivalent to subjunctive conditionals of the form 'if it were the case that A, then it would be the case that B', or 'if it had been the case that A, then it would have been the case that B'; A is called the antecedent, and B the consequent. Counterfactual reasoning typically involves the entertaining of hypothetical states of affairs: the antecedent is believed or presumed to be false, or contrary-to-the-fact, but its truth is imagined or supposed. Counterfactual reasoning is thus a form of modal reasoning, kindred to reasoning about necessity or possibility, and in contrast to reasoning about the way things actually are. The philosophical study of conditionals goes back at least as far as the Stoics of ancient Greece, although their systems of logic apparently did not accord the counterfactual any emphasis. The rise in interest in counterfactuals has been a rather recent phenomenon, as it started to become clear to philosophers that counterfactuals are implicated in a host of other important concepts—laws of nature, confirmation, causation, scientific explanation, knowledge, perception, dispositions, free action, etc. The significance of counterfactuals has also become increasingly appreciated in the..

The thesis that probabilities of conditionals are conditional probabilities has putatively been refuted many times by so-called ‘triviality results’, although it has also enjoyed a number of resurrections. In this paper I assault it yet again with a new such result. I begin by motivating the thesis and discussing some of the philosophical ramifications of its fluctuating fortunes. I will canvas various reasons, old and new, why the thesis seems plausible, and why we should care about its fate. I will look at some objections to Lewis’s famous triviality results, and thus some reasons for the pursuit of further triviality results. I will generalize Lewis’s results in ways that meet the objections. I will conclude with some reflections on the demise of the thesis—or otherwise

This paper is a response to Paul Bartha’s ‘Making Do Without Expectations’. We provide an assessment of the strengths and limitations of two notable extensions of standard decision theory: relative expectation theory and Paul Bartha’s relative utility theory. These extensions are designed to provide intuitive answers to some well-known problems in decision theory involving gaps in expectations. We argue that both RET and RUT go some way towards providing solutions to the problems in question but neither extension solves all the relevant problems.

This paper revisits the Pasadena game (Nover and Háyek 2004), a St Petersburg-like game whose expectation is undefined. We discuss serveral respects in which the Pasadena game is even more troublesome for decision theory than the St Petersburg game. Colyvan (2006) argues that the decision problem of whether or not to play the Pasadena game is ‘ill-posed’. He goes on to advocate a ‘pluralism’ regarding decision rules, which embraces dominance reasoning as well as maximizing expected utility. We rebut Colyvan’s argument, offering several considerations in favour of the Pasadena decision problem being well posed. To be sure, current decision theory, which is underpinned by various preference axioms, leaves indeterminate how one should value the Pasadena game. But we suggest that determinacy might be achieved by adding further preference axioms. We conclude by opening the door to a far greater plurality of decision rules. We suggest how the goal of unifying these rules might guide future research.

I came to philosophy as a refugee from mathematics and statistics. I was impressed by their power at codifying and precisifying antecedently understood but rather nebulous concepts, and at clarifying and exploring their interrelations. I enjoyed learning many of the great theorems of probability theory—equations rich in ‘P’s of this and of that. But I wondered what is this ‘P’? What do statements of probability mean? When I asked one of my professors, he looked at me like I needed medication. That medication was provided by philosophy, and I found it first during my Masters at the University of Western Ontario, working with Bill Harper, and then during my Ph.D. at Princeton, working with Bas van Fraassen, David Lewis, and Richard Jeffrey—all deft practitioners of formal methods. I found that philosophers had been asking my question about ‘P’ since about 1650, but they were still struggling to find definitive answers. I was also introduced to a host of other philosophical problems, and it became clear to me within nanoseconds of arriving at U.W.O. that I wanted to spend my life pursuing some of them. But I kept being drawn back to the formal methods of mathematics, and in particular of probability theory. It may be worthwhile to pause for a moment and to ask “What are formal methods?” Of course, it’s easy to come up with examples: the use of various logical systems, computational algorithms, causal graphs, information theory, probability theory and mathematics more generally. What do they have in common? They are all abstract representational systems. Sometimes the systems are studied in their own..