Bounded Modality

What does 'might' mean? One hypothesis is that 'It might be raining' is essentially an avowal of ignorance like 'For all I know, it's raining'. But it turns out these two constructions embed in different ways, in particular as parts of larger constructions like Wittgenstein's 'It might be raining and it's not' and Moore's 'It's raining and I don't know it', respectively. A variety of approaches have been developed to account for those differences. All approaches agree that both Moore sentences and Wittgenstein sentences are classically consistent. In this paper I argue against this consensus. I adduce a variety of new data which I argue can best be accounted for if we treat Wittgenstein sentences as being classically inconsistent. This creates a puzzle, since there is decisive reason to think that 'Might p' is classically consistent with 'Not p'. How can it also be that 'Might p and not p' and 'Not p and might p' are classically inconsistent? To make sense of this situation, I propose a new theory of epistemic modals and their interaction with embedding operators. This account makes sense of the subtle embedding behavior of epistemic modals, shedding new light on their meaning and, more broadly, the dynamics of information in natural language

Toward an Energy Efficient Language and Compiler for (Partially) Reversible Algorithms

We introduce a new programming language for expressing reversibility, Energy-Efficient Language (Eel), geared toward algorithm design and implementation. Eel is the first language to take advantage of a partially reversible computation model, where programs can be composed of both reversible and irreversible operations. In this model, irreversible operations cost energy for every bit of information created or destroyed. To handle programs of varying degrees of reversibility, Eel supports a log stack to automatically trade energy costs for space costs, and introduces many powerful control logic operators including protected conditional, general conditional, protected loops, and general loops. In this paper, we present the design and compiler for the three language levels of Eel along with an interpreter to simulate and annotate incurred energy costs of a program.Comment: 17 pages, 0 additional figures, pre-print to be published in The 8th Conference on Reversible Computing (RC2016

Ceteris Paribus Laws

Laws of nature take center stage in philosophy of science. Laws are usually believed to stand in a tight conceptual relation to many important key concepts such as causation, explanation, confirmation, determinism, counterfactuals etc. Traditionally, philosophers of science have focused on physical laws, which were taken to be at least true, universal statements that support counterfactual claims. But, although this claim about laws might be true with respect to physics, laws in the special sciences (such as biology, psychology, economics etc.) appear to have—maybe not surprisingly—different features than the laws of physics. Special science laws—for instance, the economic law “Under the condition of perfect competition, an increase of demand of a commodity leads to an increase of price, given that the quantity of the supplied commodity remains constant” and, in biology, Mendel's Laws—are usually taken to “have exceptions”, to be “non-universal” or “to be ceteris paribus laws”. How and whether the laws of physics and the laws of the special sciences differ is one of the crucial questions motivating the debate on ceteris paribus laws. Another major, controversial question concerns the determination of the precise meaning of “ceteris paribus”. Philosophers have attempted to explicate the meaning of ceteris paribus clauses in different ways. The question of meaning is connected to the problem of empirical content, i.e., the question whether ceteris paribus laws have non-trivial and empirically testable content. Since many philosophers have argued that ceteris paribus laws lack empirically testable content, this problem constitutes a major challenge to a theory of ceteris paribus laws

Two Ways to Want?

I present unexplored and unaccounted for uses of 'wants'. I call them advisory uses, on which information inaccessible to the desirer herself helps determine what she wants. I show that extant theories by Stalnaker, Heim, and Levinson fail to predict these uses. They also fail to predict true indicative conditionals with 'wants' in the consequent. These problems are related: intuitively valid reasoning with modus ponens on the basis of the conditionals in question results in unembedded advisory uses. I consider two fixes, and end up endorsing a relativist semantics, according to which desire attributions express information-neutral propositions. On this view, 'wants' functions as a precisification of 'ought', which exhibits similar unembedded and compositional behavior. I conclude by sketching a pragmatic account of the purpose of desire attributions that explains why it made sense for them to evolve in this way

Probability, Evidential Support, and the Logic of Conditionals

Once upon a time, some thought that indicative conditionals could be effectively analyzed as material conditionals. Later on, an alternative theoretical construct has prevailed and received wide acceptance, namely, the conditional probability of the consequent given the antecedent. Partly following critical remarks recently ap- peared in the literature, we suggest that evidential support—rather than conditional probability alone—is key to understand indicative conditionals. There have been motivated concerns that a theory of evidential conditionals (unlike their more tra- ditional counterparts) cannot generate a sufficiently interesting logical system. Here, we will describe results dispelling these worries. Happily, and perhaps surprisingly, appropriate technical variations of Ernst Adams’s classical approach allow for the construction of a logic of evidential conditionals with distinctive fea- tures, which is also well-behaved and reasonably strong

A conciliatory answer to the paradox of the ravens

In the Paradox of the Ravens, a set of otherwise intuitive claims about evidence seems to be inconsistent. Most attempts at answering the paradox involve rejecting a member of the set, which seems to require a conflict either with commonsense intuitions or with some of our best confirmation theories. In contrast, I argue that the appearance of an inconsistency is misleading: ‘confirms’ and cognate terms feature a significant ambiguity when applied to universal generalisations. In particular, the claim that some evidence confirms a universal generalisation ordinarily suggests, in part, that the evidence confirms the reliability of predicting that something which satisfies the antecedent will also satisfy the consequent. I distinguish between the familiar relation of confirmation simpliciter and what I shall call ‘predictive confirmation’. I use them to formulate my answer, illustrate it in a very simple probabilistic model, and defend it against objections. I conclude that, once our evidential concepts are sufficiently clarified, there is no sense in which the initial claims are both plausible and inconsistent