Epistemic closure has been a central issue in epistemology over the last forty years. According to versions of the relevant alternatives and subjunctivist theories of knowledge, epistemic closure can fail: an agent who knows some propositions can fail to know a logical consequence of those propositions, even if the agent explicitly believes the consequence (having “competently deduced” it from the known propositions). In this sense, the claim that epistemic closure can fail must be distinguished from the fact that agents do (...) not always believe, let alone know, the consequences of what they know—a fact that raises the “problem of logical omniscience” that has been central in epistemic logic. This paper, part I of II, is a study of epistemic closure from the perspective of epistemic logic. First, I introduce models for epistemic logic, based on Lewis’s models for counterfactuals, that correspond closely to the pictures of the relevant alternatives and subjunctivist theories of knowledge in epistemology. Second, I give an exact characterization of the closure properties of knowledge according to these theories, as formalized. Finally, I consider the relation between closure and higher-order knowledge. The philosophical repercussions of these results and results from part II, which prompt a reassessment of the issue of closure in epistemology, are discussed further in companion papers. As a contribution to modal logic, this paper demonstrates an alternative approach to proving modal completeness theorems, without the standard canonical model construction. By “modal decomposition” I obtain completeness and other results for two non-normal modal logics with respect to new semantics. One of these logics, dubbed the logic of ranked relevant alternatives, appears not to have been previously identified in the modal logic literature. More broadly, the paper presents epistemology as a rich area for logical study. (shrink)

This paper surveys attempts in the recent literature to offer a modal condition on knowledge as a way of resolving the problem of scepticism. In particular, safety-based and sensitivity-based theories of knowledge are considered in detail, along with the anti-sceptical prospects of an explicitly anti-luck epistemology.

Definitional and axiomatic theories of truth -- Objects of truth -- Tarski -- Truth and set theory -- Technical preliminaries -- Comparing axiomatic theories of truth -- Disquotation -- Classical compositional truth -- Hierarchies -- Typed and type-free theories of truth -- Reasons against typing -- Axioms and rules -- Axioms for type-free truth -- Classical symmetric truth -- Kripke-Feferman -- Axiomatizing Kripke's theory in partial logic -- Grounded truth -- Alternative evaluation schemata -- Disquotation -- Classical logic -- Deflationism (...) -- Reflection -- Ontological reduction -- Applying theories of truth. (shrink)

In this paper, I do three things. First, I offer an overview of an anti- luck epistemology, as set out in my book, Epistemic Luck. Second, I attempt to meet some of the main criticisms that one might level against the key theses that I propose in this work. And finally, third, I sketch some of the ways in which the strategy of anti- luck epistemology can be developed in new directions.

David Lewis (1941-2001) was Class of 1943 University Professor of Philosophy at Princeton University. His contributions spanned philosophical logic, philosophy of language, philosophy of mind, philosophy of science, metaphysics, and epistemology. In On the Plurality of Worlds, he defended his challenging metaphysical position, "modal realism." He was also the author of the books Convention, Counterfactuals, Parts of Classes, and several volumes of collected papers.

This paper propounds a systematic examination of the link between the Knower Paradox and provability interpretations of modal logic. The aim of the paper is threefold: to give a streamlined presentation of the Knower Paradox and related results; to clarify the notion of a syntactical treatment of modalities; finally, to discuss the kind of solution that modal provability logic provides to the Paradox. I discuss the respective strength of different versions of the Knower Paradox, both in the framework of first-order (...) arithmetic and in that of modal logic with fixed point operators. It is shown that the notion of a syntactical treatment of modalities is ambiguous between a self-referential treatment and a metalinguistic treatment of modalities, and that these two notions are independent. I survey and compare the provability interpretations of modality respectively given by Skyrms, B. (1978, The Journal of Philosophy 75: 368–387) Anderson, C.A. (1983, The Journal of Philosophy 80: 338–355) and Solovay, R. (1976, Israel Journal of Mathematics 25: 287–304). I examine how these interpretations enable us to bypass the limitations imposed by the Knower Paradox while preserving the laws of classical logic, each time by appeal to a distinct form of hierarchy. (shrink)

Starting with Jaakko Hintikka’s seminal work, epistemic logic has now grown up to a huge academic industry. When we look back to its history, however, there is a practical paradox. While Hintikka’s original purpose was to facilitate epistemological discussion, most subsequent work of epistemic logic has been done outside of philosophy, and has been ignored by most mainstream epistemologists. At the current point, one might naturally wonder, does epistemic logic still have something to do with epistemology? Along with Hintikka and (...) a growing number of formal epistemologists, we believe the answer is “yes”. Contemporary epistemology has largely focused on the goal of providing an analysis of knowledge and an answer to skepticism. To avoid skepticism, many epistemologists prefer to define knowledge in terms of evidence and relevant alternatives. A typical saying is that “in order to know that p, one only needs evidence to eliminate all relevant alternatives, rather than all alternatives”. We see such a project as perfectly congenial to the spirit of Hintikka’s epistemic logic. In this paper, we propose an epistemic logic to deal with evidence and relevant alternatives explicitly, and extend EREL to its dynamic version to investigate how different notions of knowledge behavior with the decrease and increase of relevant alternatives. To illustrate its philosophical application, we provide a new formalization of the so called factivity problem of epistemic contextualism. We conclude with some remarks on further developments of our framework. (shrink)

The Knower Paradox has had a brief but eventful history, and principles of epistemic closure (which say that a subject automatically knows any proposition she knows to be materially implied, or logically entailed, by a proposition she already knows) have been the subject of tremendous debate in epistemic logic and epistemology more generally, especially because the fate of standard arguments for and against skepticism seems to turn on the fate of closure. As far as I can tell, however, no one (...) working in either area has emphasized the result I emphasize in this paper: the Knower Paradox just falsifies even the most widely accepted general principles of epistemic closure. After establishing that result, I discuss five of its more important consequences. (shrink)

In this essay I present a new version of the Paradox of the Knower and show that this new paradox vitiates a certain argument against epistemic closure. I then prove a theorem that relates the new paradox to epistemological scepticism. I conclude by assessing the use of the Knower in arguments against syntactical treatments of knowledge.

In philosophical logic necessity is usually conceived as a sentential operator rather than as a predicate. An intensional sentential operator does not allow one to express quantified statements such as 'There are necessary a posteriori propositions' or 'All laws of physics are necessary' in first-order logic in a straightforward way, while they are readily formalized if necessity is formalized by a predicate. Replacing the operator conception of necessity by the predicate conception, however, causes various problems and forces one to reject (...) many philosophical accounts involving necessity that are based on the use of operator modal logic. We argue that the expressive power of the predicate account can be restored if a truth predicate is added to the language of first-order modal logic, because the predicate 'is necessary' can then be replaced by 'is necessarily true'. We prove a result showing that this substitution is technically feasible. To this end we provide partial possible-worlds semantics for the language with a predicate of necessity and perform the reduction of necessities to necessary truths. The technique applies also to many other intensional notions that have been analysed by means of modal operators. (shrink)

What are the objects of knowledge, belief, probability, apriority or analyticity? For at least some of these properties, it seems plausible that the objects are sentences, or sentence-like entities. However, results from mathematical logic indicate that sentential properties are subject to severe formal limitations. After surveying these results, I argue that they are more problematic than often assumed, that they can be avoided by taking the objects of the relevant property to be coarse-grained (“sets of worlds”) propositions, and that all (...) this has little to do with the choice between operators and predicates. (shrink)

This essay corrects an error in the presentation of the Paradox of the Knowledge-Plus Knower, which is the variant of Kaplan and Montague’s Knower Paradox presented in C. Cross 2001: ‘The Paradox of the Knower without Epistemic Closure,’ MIND, 110, pp. 319–33. The correction adds a universally quantified transitivity principle for derivability as an additional assumption leading to paradox. This correction does not affect the status of the Knowledge-Plus paradox as a rebuttal to an argument against epistemic closure, since the (...) quantified transitivity principle is true in the standard model of arithmetic and therefore innocuous. (shrink)