My dissertation explores the ways in which Rudolf Carnap sought to make philosophy scientific by further developing recent interpretive efforts to explain Carnap’s mature philosophical work as a form of engineering. It does this by looking in detail at his philosophical practice in his most sustained mature project, his work on pure and applied inductive logic. I, first, specify the sort of engineering Carnap is engaged in as involving an engineering design problem and then draw out the complications of design (...) problems from current work in history of engineering and technology studies. I then model Carnap’s practice based on those lessons and uncover ways in which Carnap’s technical work in inductive logic takes some of these lessons on board. This shows ways in which Carnap’s philosophical project subtly changes right through his late work on induction, providing an important corrective to interpretations that ignore the work on inductive logic. Specifically, I show that paying attention to the historical details of Carnap’s attempt to apply his work in inductive logic to decision theory and theoretical statistics in the 1950s and 1960s helps us understand how Carnap develops and rearticulates the philosophical point of the practical/theoretical distinction in his late work, offering thus a new interpretation of Carnap’s technical work within the broader context of philosophy of science and analytical philosophy in general. (shrink)

This paper evaluates a recent method proposed by Jeremy Gwiazda for calculating the value of gambles that fail to have expected values in the standard sense. I show that Gwiazda’s method fails to give answers for many gambles that do have standardly defined expected values. However, a slight modification of his method (based on the mathematical notion of the ‘Cauchy principal value’ of an integral), is in fact a proper extension of both his method and the method of ‘weak expectations’. (...) I show that this method gives an appropriate value when the ‘tails’ of the gambles that are eliminated in the truncation are ‘stable’, but that the value is not appropriate when the tails are not stable. I do not attempt to give an argument for the use of this method, but just note that it is more general than Gwiazda’s method, and is mathematically quite natural. (shrink)

Fine has shown that assigning any value to the Pasadena game is consistent with a certain standard set of axioms for decision theory. However, I suggest that it might be reasonable to believe that the value of an individual game is constrained by the long-run payout of repeated plays of the game. Although there is no value that repeated plays of the Pasadena game converges to in the standard strong sense, I show that there is a weaker sort of convergence (...) it exhibits, and use this to define a notion of ‘weak expectation’ that can give values to the Pasadena game and many others, though not to all games that fail to have a strong expectation in the standard sense. CiteULike Connotea Del.icio.us What's this? (shrink)

This paper discusses how to update one’s credences based on evidence that has initial probability 0. I advance a diachronic norm, Kolmogorov Conditionalization, that governs credal reallocation in many such learning scenarios. The norm is based upon Kolmogorov’s theory of conditional probability. I prove a Dutch book theorem and converse Dutch book theorem for Kolmogorov Conditionalization. The two theorems establish Kolmogorov Conditionalization as the unique credal reallocation rule that avoids a sure loss in the relevant learning scenarios.

Must probabilities be countably additive? On the one hand, arguably, requiring countable additivity is too restrictive. As de Finetti pointed out, there are situations in which it is reasonable to use merely finitely additive probabilities. On the other hand, countable additivity is fruitful. It can be used to prove deep mathematical theorems that do not follow from finite additivity alone. One of the most philosophically important examples of such a result is the Bayesian convergence to the truth theorem, which says (...) that conditional probabilities converge to 1 for true hypotheses and to 0 for false hypotheses. In view of the long-standing debate about countable additivity, it is natural to ask in what circumstances finitely additive theories deliver the same results as the countably additive theory. This paper addresses that question and initiates a systematic study of convergence to the truth in a finitely additive setting. There is also some discussion of how the formal results can be applied to ongoing debates in epistemology and the philosophy of science. (shrink)

This contribution is part of the special series of Inaugural Articles by members of the National Academy of Sciences elected on April 27, 1999.

We use the compactness theorem of continuous logic to give a new proof that $$L^r([0,1]; {\mathbb {R}})$$ isometrically embeds into $$L^p([0,1]; {\mathbb {R}})$$ whenever $$1 \le p \le r \le 2$$. We will also give a proof for the complex case. This will involve a new characterization of complex $$L^p$$ spaces based on Banach lattices.

It is widely assumed that a literal understanding of someone’s self-deception that p yields the following contradiction. Qua self-deceiver, she does not believe that p, yet – qua self-deceived – she does believe that p. I argue that this assumption is ill-founded. Literalism about self-deception – the view that self-deceivers literally self-deceive – is not committed to this contradiction. On the contrary, properly understood, literalism excludes it.

We show that in infinite worlds the following three conditions are incompatible: The spatiotemporal ordering of individuals is morally irrelevant. All else being equal, the act of bringing about a good outcome with a high probability is better than the act of bringing about the same outcome with a low probability. One act is better than another only if there is a nonzero probability that it brings about a better outcome. The impossibility of combining these conditions shows that it is (...) more costly to endorse than has been previously acknowledged. (shrink)