This paper introduces a novel strategy for responding to skeptical arguments based on the epistemic possibility of error or lack of certainty. I show that a nonclassical logic motivated by recent work on epistemic modals can be used to render such skeptical arguments invalid. That is, one can grant that knowledge is incompatible with the possibility of error and grant that error is possible, all while avoiding the skeptic’s conclusion that we lack knowledge.

Deflationists about truth hold that the function of the truth predicate is to enable us to make certain assertions we could not otherwise make. Pragmatists claim that the utility of negation lies in its role in registering incompatibility. The pragmatist insight about negation has been successfully incorporated into bilateral theories of content, which take the meaning of negation to be inferentially explained in terms of the speech act of rejection. We implement the deflationist insight in a bilateral theory by taking (...) the meaning of the truth predicate to be explained by its inferential relation to assertion. We combine this account of the meaning of the truth predicate with a new diagnosis of the Liar Paradox: its derivation requires the truth rules to preserve evidence, but these rules only preserve commitment. The result is a novel inferential deflationist theory of truth, which solves the Liar Paradox in a principled manner. We end by showing that our theory and simple extensions thereof have the resources to axiomatize the internal logic of several supervaluational hierarchies, including Cantini’s. This solves open problems of Halbach (2011) and Horsten (2011). (shrink)

Possibility semantics offers an elegant framework for a semantic analysis of modal logic that does not recruit fully determinate entities such as possible worlds. The present papers considers the application of possibility semantics to the modeling of the indeterminacy of the future. Interesting theoretical problems arise in connection to the addition of object-language determinacy operator. We argue that adding a two-dimensional layer to possibility semantics can help solve these problems. The resulting system assigns to the two-dimensional determinacy operator a well-known (...) logic (coinciding with the logic of universal modalities under global consequence). The paper concludes with some preliminary inroads into the question of how to distinguish two-dimensional possibility semantics from the more established branching framework. (shrink)

Data involving epistemic modals suggest that some classically valid argument forms, such as _reductio_, are invalid in natural language reasoning as they lead to modal collapses. We adduce further data showing that the classical argument forms governing the existential quantifier are similarly defective, as they lead to a _de re–de dicto_ collapse. We observe a similar problem for disjunction. But if the classical argument forms for negation, disjunction and existential quantification are invalid, what are the correct forms that govern the (...) use of these items? Our diagnosis is that epistemic modals interfere with hypothetical reasoning. We present a modal first-order logic and model theory that characterizes hypothetical reasoning with epistemic modals in a principled manner. One upshot is a sound and complete natural deduction system for reasoning with epistemic modals in first-order logic. (shrink)

This paper presents a recent formalization of a Henkin-style completeness proof for the propositional modal logic S5 using the Lean theorem prover. The proof formalized is close to that of Hughes and Cresswell, but the system, based on a different choice of axioms, is better described as a Mendelson system augmented with axiom schemes for K, T, S4, and B, and the necessitation rule as a rule of inference. The language has the false and implication as the only primitive logical (...) connectives and necessity as the only primitive modal operator. The full source code is available online and has been typechecked with Lean 3.4.2. (shrink)

We present epistemic multilateral logic, a general logical framework for reasoning involving epistemic modality. Standard bilateral systems use propositional formulae marked with signs for assertion and rejection. Epistemic multilateral logic extends standard bilateral systems with a sign for the speech act of weak assertion (Incurvati and Schlöder 2019) and an operator for epistemic modality. We prove that epistemic multilateral logic is sound and complete with respect to the modal logic S5 modulo an appropriate translation. The logical framework developed provides the (...) basis for a novel, proof-theoretic approach to the study of epistemic modality. To demonstrate the fruitfulness of the approach, we show how the framework allows us to reconcile classical logic with the contradictoriness of so-called Yalcin sentences and to distinguish between various inference patterns on the basis of the epistemic properties they preserve. (shrink)

When embedding data are used to argue against semantic theory A and in favor of semantic theory B, it is important to ask whether A could make sense of those data. It is possible to ask that question on a case-by-case basis. But suppose we could show that A can make sense of all the embedding data which B can possibly make sense of. This would, on the one hand, undermine arguments in favor of B over A on the basis (...) of embedding data. And, provided that the converse does not hold—that is, that A can make sense of strictly more embedding data than B can—it would also show that there is a precise sense in which B is more constrained than A, yielding a pro tanto simplicity-based consideration in favor of B. In this paper I develop tools which allow us to make comparisons of this kind, which I call comparisons of potential expressive power. I motivate the development of these tools by way of exploration of the recent debate about epistemic modals. Prominent theories which have been developed in response to embedding data turn out to be strictly less expressive than the standard relational theory, a fact which necessitates a reorientation in how to think about the choice between these theories. (shrink)

Many recent theories of epistemic discourse exploit an informational notion of consequence, i.e. a notion that defines entailment as preservation of support by an information state. This paper investigates how informational consequence fits with probabilistic reasoning. I raise two problems. First, all informational inferences that are not also classical inferences are, intuitively, probabilistically invalid. Second, all these inferences can be exploited, in a systematic way, to generate triviality results. The informational theorist is left with two options, both of them radical: (...) they can either deny that epistemic modal claims have probability at all, or they can move to a nonstandard probability theory. (shrink)

What is it to believe something might be the case? We develop a puzzle that creates difficulties for standard answers to this question. We go on to propose our own solution, which integrates a Bayesian approach to belief with a dynamic semantics for epistemic modals. After showing how our account solves the puzzle, we explore a surprising consequence: virtually all of our beliefs about what might be the case provide counterexamples to the view that rational belief is closed under logical (...) implication. (shrink)

Recent ideas about epistemic modals and indicative conditionals in formal semantics have significant overlap with ideas in modal logic and dynamic epistemic logic. The purpose of this paper is to show how greater interaction between formal semantics and dynamic epistemic logic in this area can be of mutual benefit. In one direction, we show how concepts and tools from modal logic and dynamic epistemic logic can be used to give a simple, complete axiomatization of Yalcin's [16] semantic consequence relation for (...) a language with epistemic modals and indicative conditionals. In the other direction, the formal semantics for indicative conditionals due to Kolodny and MacFarlane [9] gives rise to a new dynamic operator that is very natural from the point of view of dynamic epistemic logic, allowing succinct expression of dependence (as in dependence logic) or supervenience statements. We prove decidability for the logic with epistemic modals and Kolodny and MacFarlane's indicative conditional via a full and faithful computable translation from their logic to the modal logic K45. (shrink)

Kolodny and MacFarlane have made a pioneering contribution to our understanding of how the interpretation of deontic modals can be sensitive to evidence and information. But integrating the discussion of information-sensitivity into the standard Kratzerian framework for modals suggests ways of capturing the relevant data without treating deontic modals as “informational modals” in their sense. I show that though one such way of capturing the data within the standard semantics fails, an alternative does not. Nevertheless I argue that we have (...) good reasons to adopt an information-sensitive semantics of the general type Kolodny and MacFarlane describe. Contrary to the standard semantics, relative deontic value between possibilities sometimes depends on which possibilities are live. I develop an ordering semantics for deontic modals that captures this point and addresses various complications introduced by integrating the discussion of information-sensitivity into the standard semantic framework. By attending to these complexities, we can also illuminate various roles that information and evidence play in logical arguments, discourse, and deliberation. (shrink)

When are you in a position to rely on p in practical reasoning? Existing accounts say that you must know that p, or be in a position to know that p, or be justified in believing that p, or be in a position to justifiably believe it, and so on. This paper argues that all of these proposals face important problems, which I call the Problems of Negative Bootstrapping and of Level Confusions. I offer a diagnosis of these problems, and (...) I argue that an adequate epistemic norm must be transparent in the following sense: According to the correct epistemic norm, a consideration counts in favor of (or against) relying on p in practical reasoning iff, and to the extent that, this consideration also counts in favor of (or against) p being true. I introduce a candidate epistemic norm that satisfies this condition. According to this norm, one should rely on p in practical reasoning only if it must be that p. If we adopt a non-factualist account of “must”, this amounts to a novel and attractive proposal, a proposal that satisfies the transparency condition. (shrink)

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)

I propose an account of indicative conditionals that combines features of minimal change semantics and information semantics. As in information semantics, conditionals are interpreted relative to an information state in accordance with the Ramsey test idea: “if p then q” is supported at a state s iff q is supported at the hypothetical state s[p] obtained by restricting s to the p-worlds. However, information states are not modeled as simple sets of worlds, but by means of a Lewisian system of (...) spheres. Worlds in the inner sphere are considered possible; worlds outside of it are ruled out, but to different degrees. In this way, even when a state supports “not p”, it is still possible to suppose p consistently. I argue that this account does better than its predecessors with respect to a set of desiderata concerning inferences with conditionals. In particular, it captures three important facts: that a conditional is logically independent from its antecedent; that a sequence of antecedents behaves like a single conjunctive antecedent ; and that conditionals restrict the quantification domain of epistemic modals. I also discuss two ways to construe the role of a premise, and propose a generalized notion of entailment that keeps the two apart. (shrink)

Deflationists about truth hold that the function of the truth predicate is to enable us to make certain assertions we could not otherwise make. Pragmatists claim that the utility of negation lies in its role in registering incompatibility. The pragmatist insight about negation has been successfully incorporated into bilateral theories of content, which take the meaning of negation to be inferentially explained in terms of the speech act of rejection. We implement the deflationist insight in a bilateral theory by taking (...) the meaning of the truth predicate to be explained by its inferential relation to assertion. We combine this account of the meaning of the truth predicate with a new diagnosis of the liar paradox: its derivation requires the truth rules to preserve evidence, but these rules only preserve commitment. The result is a novel inferential deflationist theory of truth, which solves the liar paradox in a principled manner. We end by showing that our theory and simple extensions thereof have the resources to axiomatize the internal logic of several supervaluational hierarchies, including Cantini’s. This solves open problems of Halbach (2011) and Horsten (2011). (shrink)