•  126
    A classification of Newcomb problems and decision theories
    Synthese 198 (Suppl 27): 6415-6434. 2019.
    Newcomb-like problems are classified by the payoff table of their act-state pairs, and the causal structure that gives rise to the act-state correlation. Decision theories are classified by the one or more points of intervention whose causal role is taken to be relevant to rationality in various problems. Some decision theories suggest an inherent conflict between different notions of rationality that are all relevant. Some issues with causal modeling raise problems for decision theories in the …Read more
  •  91
    The Concept of Rationality for a City
    Topoi 40 (2): 409-421. 2019.
    The central aim of this paper is to argue that there is a meaningful sense in which a concept of rationality can apply to a city. The idea will be that a city is rational to the extent that the collective practices of its people enable diverse inhabitants to simultaneously live the kinds of life they are each trying to live. This has significant implications for the varieties of social practices that constitute being more or less rational. Some of these implications may be welcome to a theorist …Read more
  •  102
    Infinity, Causation, and Paradox, by Alexander Pruss
    Mind 129 (516): 1287-1291. 2019.
    _ Infinity, Causation, and Paradox _, by PrussAlexander. Oxford: Oxford University Press, 2018. Pp. xiii + 207.
  •  26
    The evolution of logic
    Bulletin of Symbolic Logic 17 (4): 533-535. 2011.
  •  66
    Principal Values and Weak Expectations
    Mind 123 (490): 517-531. 2014.
    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 th…Read more
  •  346
    Interview with Kenny Easwaran
    The Reasoner 15 (2): 9-12. 2021.
    Bill D'Alessandro talks to Kenny Easwaran about fractal music, Zoom conferences, being a good referee, teaching in math and philosophy, the rationalist community and its relationship to academia, decision-theoretic pluralism, and the city of Manhattan, Kansas.
  •  48
  •  128
    Formal Epistemology
    Journal of Philosophical Logic 44 (6): 651-662. 2015.
    Doxastic TheoriesThe application of formal tools to questions related to epistemology is of course not at all new. However, there has been a surge of interest in the field now known as “formal epistemology” over the past decade, with two annual conference series and an annual summer school at Carnegie Mellon University, in addition to many one-off events devoted to the field. A glance at the programs of these series illustrates the wide-ranging set of topics that have been grouped under this nam…Read more
  •  1
    REVIEWS-WD Hart, The evolution of logic (review)
    Bulletin of Symbolic Logic 17 (4): 533. 2011.
  •  543
    Bayesianism II: Applications and Criticisms
    Philosophy Compass 6 (5): 321-332. 2011.
    In the first paper, I discussed the basic claims of Bayesianism (that degrees of belief are important, that they obey the axioms of probability theory, and that they are rationally updated by either standard or Jeffrey conditionalization) and the arguments that are often used to support them. In this paper, I will discuss some applications these ideas have had in confirmation theory, epistemol- ogy, and statistics, and criticisms of these applications.
  •  471
    Why Countable Additivity?
    Thought: A Journal of Philosophy 2 (1): 53-61. 2013.
    It is sometimes alleged that arguments that probability functions should be countably additive show too much, and that they motivate uncountable additivity as well. I show this is false by giving two naturally motivated arguments for countable additivity that do not motivate uncountable additivity