It is epistemological orthodoxy that the object of propositional knowledge is the truth of propositions. This traditional view is based on what I call the ‘KT-schema’, viz, ‘S knows that p, iff, S knows that “p” is true’. The purpose of this paper is to reject the KT-schema. By showing the paradoxical upshot of the KT-schema and providing counterexamples to the KT-schema, this paper argues that ‘knowing that p’ is more than ‘knowing that “p” is true’. Consequently, we shall rethink (...) the object problem of propositional knowledge – if knowing that p is not merely knowing that ‘p’ is true, then what is indeed the object of propositional knowledge? I will also attempt to solve this problem by proposing a complementary answer: knowing that p requires at least knowing the truth of p, plus, understanding the content of p. (shrink)

A dispute in epistemology has arisen over whether some class of things epistemic (things known or justified, for example) is closed under some operation involving the notion of what follows deductively from members of this class. Very few philosophers these days believe that if you know that p, and p entails q, then you know that q. But many philosophers think that something weaker holds, for instance that if you know that p, and p entails q, then you are in (...) a position to know that p, or if you know that p and you competently deduce p from q, then you know that q. However there are some considerations tracing back to Wittgenstein’s On Certainty and some early work by Fred Dretske that suggests even these weaker principles are false. (shrink)

The Knower paradox purports to place surprising a priori limitations on what we can know. According to orthodoxy, it shows that we need to abandon one of three plausible and widely-held ideas: that knowledge is factive, that we can know that knowledge is factive, and that we can use logical/mathematical reasoning to extend our knowledge via very weak single-premise closure principles. I argue that classical logic, not any of these epistemic principles, is the culprit. I develop a consistent theory validating (...) all these principles by combining Hartry Field's theory of truth with a modal enrichment developed for a different purpose by Michael Caie. The only casualty is classical logic: the theory avoids paradox by using a weaker-than-classical K3 logic. I then assess the philosophical merits of this approach. I argue that, unlike the traditional semantic paradoxes involving extensional notions like truth, its plausibility depends on the way in which sentences are referred to--whether in natural languages via direct sentential reference, or in mathematical theories via indirect sentential reference by Gödel coding. In particular, I argue that from the perspective of natural language, my non-classical treatment of knowledge as a predicate is plausible, while from the perspective of mathematical theories, its plausibility depends on unresolved questions about the limits of our idealized deductive capacities. (shrink)

The Paradox of the Knower was originally presented by Kaplan and Montague [26] as a puzzle about the everyday notion of knowledge in the face of self-reference. The paradox shows that any theory extending Robinson arithmetic with a predicate K satisfying the factivity axiom K → A as well as a few other epistemically plausible principles is inconsistent. After surveying the background of the paradox, we will focus on a recent debate about the role of epistemic closure principles in the (...) Knower. We will suggest this debate sheds new light on the concept of knowledge which is at issue in the paradox – i.e. is it a “thin” notion divorced from concepts such as evidence or justification, or is it a “thick” notion more closely resembling mathematical provability? We will argue that a number of features of the paradox suggest that the latter option is more plausible. Along the way, we will provide a reconstruction of the paradox using a quantified extension of Artemovʼs [2] Logic of Proofs, as well as a series of results linking the original formulation of the paradox to reflection principles for formal arithmetic. On this basis, we will argue that while the Knower can be understood to motivate a distinction between levels of knowledge, it does not provide a rationale for recognizing a uniform hierarchy of knowledge predicates in the manner suggested by Anderson. (shrink)

Predicate approaches to modality have been a topic of increased interest in recent intensional logic. Halbach and Welch :71–100, 2009) have proposed a new formal technique to reduce the necessity predicate to an operator, demonstrating that predicate and operator methods are ultimately compatible. This article concerns the question of whether Halbach and Welch’s approach can provide a uniform formal treatment for intensionality. I show that the monotonicity constraint in Halbach and Welch’s proof for necessity fails for almost all possible-worlds theories (...) of knowledge. The nonmonotonicity results demonstrate that the most obvious way of emulating Halbach and Welch’s rapprochement of the predicate and operator fails in the epistemic setting. (shrink)