The dominant response to this problem of the criterion focuses on the alleged requirement that we need to know a belief source is reliable in order for us to acquire knowledge by that source. Let us call this requirement, “The KR principle”.

I present a formal theory of the logic and aboutness of imagination. Aboutness is understood as the relation between meaningful items and what they concern, as per Yablo and Fine’s works on the notion. Imagination is understood as per Chalmers’ positive conceivability: the intentional state of a subject who conceives that p by imagining a situation—a configuration of objects and properties—verifying p. So far aboutness theory has been developed mainly for linguistic representation, but it is natural to extend it to (...) intentional states. The proposed framework combines a modal semantics with a mereology of contents: imagination operators are understood as variably strict quantifiers over worlds with a content-preservation constraint. (shrink)

This article is a response to an important objection that Sherrilyn Roush has made to the standard closure-based argument for skepticism, an argument that has been studied over the past couple of decades. If Roush's objection is on the mark, then this would be a quite significant finding. We argue that her objection fails.

Our topic is the theory of topics. My goal is to clarify and evaluate three competing traditions: what I call the way-based approach, the atom-based approach, and the subject-predicate approach. I develop criteria for adequacy using robust linguistic intuitions that feature prominently in the literature. Then I evaluate the extent to which various existing theories satisfy these constraints. I conclude that recent theories due to Parry, Perry, Lewis, and Yablo do not meet the constraints in total. I then introduce the (...) issue-based theory—a novel and natural entry in the atom-based tradition that meets our constraints. In a coda, I categorize a recent theory from Fine as atom-based, and contrast it to the issue-based theory, concluding that they are evenly matched, relative to our main criteria of adequacy. I offer tentative reasons to nevertheless favour the issue-based theory. (shrink)

Single-premise epistemic closure is the principle that: if one is in an evidential position to know that P where P entails Q, then one is in an evidential position to know that Q. In this paper, I defend the viability of opposition to closure. A key task for such an opponent is to precisely formulate a restricted closure principle that remains true to the motivations for abandoning unrestricted closure but does not endorse particularly egregious instances of closure violation. I focus (...) on two brands of epistemic theory that naturally incorporate closure restrictions. The first type holds that the truth value of a knowledge ascription is relative to a relevant question. The second holds that the truth value of a knowledge ascription is relative to a relevant topic. For each approach, I offer a formalization of a leading theory from the literature and use this formalization to evaluate the theory’s adequacy in terms of a precise set of desiderata. I conclude that neither theory succeeds in meeting these desiderata, casting doubt on the viability of the underlying approaches. Finally, I offer a novel variant of the topic-sensitive approach that fares better. (shrink)

The paper argues that knowledge is not closed under logical inference. The argument proceeds from the openness of evidential support and the dependence of empirical knowledge on evidence, to the conclusion that knowledge is open. Without attempting to provide a full-fledged theory of evidence, we show that on the modest assumption that evidence cannot support both a proposition and its negation, or, alternatively, that information that reduces the probability of a proposition cannot constitute evidence for its truth, the relation of (...) evidential support is not closed under known entailment. Therefore the evidence-for relation is deductively open regardless of whether evidence is probabilistic or not. Given even a weak dependence of empirical knowledge on evidence, we argue that empirical knowledge is also open. On this basis, we also respond to the strongest argument in support of knowledge closure. Finally, we present a number of significant benefits of our position, namely, offering a unified explanation for a range of epistemological puzzles. (shrink)

Harman and Lewis credit Kripke with having formulated a puzzle that seems to show that knowledge entails dogmatism. The puzzle is widely regarded as having been solved. In this paper we argue that this standard solution, in its various versions, addresses only a limited aspect of the puzzle and holds no promise of fully resolving it. Analyzing this failure and the proper rendering of the puzzle, it is suggested that it poses a significant challenge for the defense of epistemic closure.

How should the contrastivist formulate closure? That is, given that knowledge is a ternary contrastive state Kspq (s knows that p rather than q), how does this state extend under entailment? In what follows, I will identify adequacy conditions for closure, criticize the extant invariantist and contextualist closure schemas, and provide a contrastive schema based on the idea of extending answers. I will conclude that only the contrastivist can adequately formulate closure.

Multi-modal versions of propositional logics S5 or S4—commonly accepted as logics of knowledge—are capable of describing static states of knowledge but they do not reflect how the knowledge changes after communications among agents. In the present paper (part of broader research on logics of knowledge and communications) we define extensions of the logic S5 which can deal with public communications. The logics have natural semantics. We prove some completeness, decidability and interpretability results and formulate a general method that solves certain (...) kind of problems involving public communications—among them well known puzzles of Muddy Children and Mr. Sum & Mr. Product. As the paper gives a formal logical treatment of the operation of restriction of the universe of a Kripke model, it contributes also to investigations of semantics for modal logics. (shrink)

According to the Dogmatism Puzzle, knowledge breeds dogmatism: if a subject knows a proposition h, then she is justified in disregarding any future evidence against h, for she knows that such evidence is misleading. The standard, widely accepted, solution to the puzzle appeals to the defeasibility of knowledge. I argue that the defeat solution leaves intact a residual dogmatist puzzle. Solving this puzzle requires proponents of defeat to deny a plausible principle that the original puzzle relies on called Entitlement, a (...) principle stating roughly that knowing that a piece of evidence is misleading entitles one to disregard it. The plausibility of Entitlement should cast doubt not only on the defeat solution, but on an assumption that has often been taken for granted: the falsity of the dogmatist conclusion of the original puzzle. I conclude that we face a dilemma between giving up Entitlement and living with dogmatism. (shrink)

I propose a new semantics for intuitionistic logic, which is a cross between the construction-oriented semantics of Brouwer-Heyting-Kolmogorov and the condition-oriented semantics of Kripke. The new semantics shows how there might be a common semantical underpinning for intuitionistic and classical logic and how intuitionistic logic might thereby be tied to a realist conception of the relationship between language and the world.

I provide a truthmaker semantics for Angell’s system of analytic implication and establish completeness.

The hallmark of the deductive systems known as ‘conceptivist’ or ‘containment’ logics is that for all theorems of the form , all atomic formulae appearing in also appear in . Significantly, as a consequence, the principle of Addition fails. While often billed as a formalisation of Kantian analytic judgements, once semantics were discovered for these systems, the approach was largely discounted as merely the imposition of a syntactic filter on unrelated systems. In this paper, we examine a number of prima (...) facie unrelated deductive contexts in which Addition fails and attempt to harmonise them by developing a computational interpretation of conceptivist logics. (shrink)

Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed ...

Information is a notion of wide use and great intuitive appeal, and hence, not surprisingly, different formal paradigms claim part of it, from Shannon channel theory to Kolmogorov complexity. Information is also a widely used term in logic, but a similar diversity repeats itself: there are several competing logical accounts of this notion, ranging from semantic to syntactic. In this chapter, we will discuss three major logical accounts of information.

A well-known open problem in epistemic logic is to give a syntactic characterization of the successful formulas. Semantically, a formula is successful if and only if for any pointed model where it is true, it remains true after deleting all points where the formula was false. The classic example of a formula that is not successful in this sense is the “Moore sentence” p ∧ ¬BOXp, read as “p is true but you do not know p.” Not only is the (...) Moore sentence unsuccessful, it is self-refuting, for it never remains true as described. We show that in logics of knowledge and belief for a single agent (extended by S5), Moorean phenomena are the source of all self-refutation; moreover, in logics for an introspective agent (extending KD45), Moorean phenomena are the source of all unsuccessfulness as well. This is a distinctive feature of such logics, for with a non-introspective agent or multiple agents, non-Moorean unsuccessful formulas appear. We also consider how successful and self-refuting formulas relate to the Cartesian and learnable formulas, which have been discussed in connection with Fitch’s “paradox of knowability.” We show that the Cartesian formulas are exactly the formulas that are not eventually self-refuting and that not all learnable formulas are successful. In an appendix, we give syntactic characterizations of the successful and the self-refuting formulas. (shrink)

This chapter argues that epistemologists should replace a “standard alternatives” picture of knowledge, assumed by many fallibilist theories of knowledge, with a new “multipath” picture of knowledge. The chapter first identifies a problem for the standard picture: fallibilists working with this picture cannot maintain even the most uncontroversial epistemic closure principles without making extreme assumptions about the ability of humans to know empirical truths without empirical investigation. The chapter then shows how the multipath picture, motivated by independent arguments, saves fallibilism (...) from this problem. The multipath picture is based on taking seriously the idea that there can be multiple paths to knowing some propositions about the world. An overlooked consequence of fallibilism is that these multiple paths to knowledge may involve ruling out different sets of alternatives, which should be represented in a fallibilist picture of knowledge. The chapter concludes by considering inductive knowledge and strong epistemic closure from this multipath perspective. (shrink)