Daniel Berntson

Can we do science without numbers? How much contingency is there? These seemingly unrelated questions--one in the philosophy of math and science and the other in metaphysics--share an unexpectedly close connection. For as it turns out, a radical answer to the second leads to a breakthrough on the first. The radical answer is new view about modality called compossible immutabilism. The breakthrough is a new strategy for doing science without numbers. One of the chief benefits of the new strategy is that, unlike the existing substantialism approach from Field (1980), the new strategy naturally generalizes to theories formulated in terms of state space.

Counterfactuals are somewhat tolerant. Had Socrates been at least six feet tall, he need not have been exactly six feet tall. He might have been a little taller—he might have been six one or six two. But while he might have been a little taller, there are limits to how tall he would have been. Had he been at least six feet tall, he would not have been more than a hundred feet tall, for example. Counterfactuals are not just tolerant, then, but bounded. This paper presents a surprising paradox: If counterfactuals are tolerant and bounded, then we can prove a flat contradiction using natural rules of inference. Something has to go then. But what?

This paper presents a new system of conditional logic B2, which is strictly intermediate in strength between the existing systems B1 and B3 from John Burgess (1981) and David Lewis (1973a). After presenting and motivating the new system, we will show that it is characterized by a natural class of frames. These frames correspond to the idea that conditionals are about which worlds are nearly closest, rather than which worlds are closest. Along the way, we will also give new characterization results for B1 and B3, along with two other new systems B1.1 and B1.2.

How should the opinion of a group be related to the opinions of the group members? In this article, we will defend a package of four norms – coherence, locality, anonymity and unanimity. Existing results show that there is no tenable procedure for aggregating outright beliefs or for aggregating credences that meet these criteria. In response, we consider the prospects for aggregating credal pairs – pairs of prior probabilities and evidence. We show that there is a method of aggregating credal pairs that possesses all four virtues.