Recently, Yalcin (Epistemic modals. Mind, 116 , 983–1026, 2007) put forward a novel account of epistemic modals. It is based on the observation that sentences of the form ‘ & Might ’ do not embed under ‘suppose’ and ‘if’. Yalcin concludes that such sentences must be contradictory and develops a notion of informational consequence which validates this idea. I will show that informational consequence is inadequate as an account of the logic of epistemic modals: it cannot deal with reasoning from (...) uncertain premises. Finally, I offer an alternative way of explaining the relevant linguistic data. (shrink)

Epistemic modal operators give rise to something very like, but also very unlike, Moore's paradox. I set out the puzzling phenomena, explain why a standard relational semantics for these operators cannot handle them, and recommend an alternative semantics. A pragmatics appropriate to the semantics is developed and interactions between the semantics, the pragmatics, and the definition of consequence are investigated. The semantics is then extended to probability operators. Some problems and prospects for probabilistic representations of content and context are explored.

The aim of this paper is twofold: (i) to introduce the framework of update semantics and to explain what kind of semantic phenomena may successfully be analysed in it: (ii) to give a detailed analysis of one such phenomenon: default reasoning.

Do logically valid arguments necessarily preserve truth? Certain inferences involving informational modal operators and indicative conditionals suggest that truth preservation and good deductive argument come apart. Given this split, I recommend an alternative to the standard truth preservation view of logic on which validity and good deductive argument coincide: logic is a descriptive science that is fundamentally concerned not with the preservation of truth, but with the preservation of structural features of information. Along the way, I defend modus ponens for (...) the indicative against an attack by Kolodny and MacFarlane, and I present a new proof system, Info, appropriate to this informational view. (shrink)

Is modus ponens valid for the indicative conditional? McGee [1985] famously presents several alleged counterexamples to this inference rule. More recently, Kolodny and MacFarlane [2010] and Willer [2010] argue that modus ponens is unreliable in certain hypothetical contexts. However, none of these attacks undermines an informational conception of logic on which modus ponens is valid.

This is a first course in propositional modal logic, suitable for mathematicians, computer scientists and philosophers. Emphasis is placed on semantic aspects, in the form of labelled transition structures, rather than on proof theory. The book covers all the basic material - propositional languages, semantics and correspondence results, proof systems and completeness results - as well as some topics not usually covered in a modal logic course. It is written from a mathematical standpoint. To help the reader, the material is (...) covered in short chapters, each concentrating on one topic. These are arranged into five parts, each with a common theme. An important feature of the book is the many exercises and an extensive set of solutions is provided. (shrink)

Draws attention to some unexpected consequences of using a zero-ary connective in modal propositional logic.

This paper investigates the link between informational consequence and credence. I first suggest a natural constraint, namely that informational consequence should preserve certainty: on any rational credence distribution, when the premises of an informational inferences have credence 1, the conclusion also has credence 1. Then I show that the certainty‐preserving constraint leads to triviality. In particular, the following three claims are incompatible: (i) informational consequence is extensionally distinct from classical consequence; (ii) informational inferences preserve certainty; (iii) credences obey (a subset (...) of) classical Bayesian constraints. The proof is straightforward, but the theoretical implications are substantial. Informational theorists need to either give up the idea that credence applies to epistemic discourse, or develop a nonclassical theory of credence and credal update. Moreover, the result also suggests that there is a connection between informational consequence and triviality results, including classical triviality results like Lewis's. (shrink)

Various sources in the literature claim that the deduction theorem does not hold for normal modal or epistemic logic, whereas others present versions of the deduction theorem for several normal modal systems. It is shown here that the apparent problem arises from an objectionable notion of derivability from assumptions in an axiomatic system. When a traditional Hilbert-type system of axiomatic logic is generalized into a system for derivations from assumptions, the necessitation rule has to be modified in a way that (...) restricts its use to cases in which the premiss does not depend on assumptions. This restriction is entirely analogous to the restriction of the rule of universal generalization of first-order logic. A necessitation rule with this restriction permits a proof of the deduction theorem in its usual formulation. Other suggestions presented in the literature to deal with the problem are reviewed, and the present solution is argued to be preferable to the other alternatives. A contraction-and cut-free sequent calculus equivalent to the Hubert system for basic modal logic shows the standard failure argument untenable by proving the underivability of DA from A. (shrink)