This paper argues that justification is accessible in the sense that one has justification to believe a proposition if and only if one has higher-order justification to believe that one has justification to believe that proposition. I argue that the accessibility of justification is required for explaining what is wrong with believing Moorean conjunctions of the form, ‘p and I do not have justification to believe that p.’.

In ‘Syntactical Treatments of Modality, with Corollaries on Reflexion Principles and Finite Axiomatizability’, Acta Philosophica Fennica16 (1963), 153–167, Richard Montague shows that the use of a single syntactic predicate (with a context-independent semantic value) to represent modalities of alethic necessity and idealized knowledge leads to inconsistency. In ‘A Note on Syntactical Treatments of Modality’, Synthese44 (1980), 391–395, Richmond Thomason obtains a similar impossibility result for idealized belief: under a syntactical treatment of belief, the assumption that idealized belief is deductively closed, (...) together with certain other plausible conditions on idealized belief, imply that an ideal believer with consistent beliefs cannot believe the truth of Robinson's Arithmetic. In this essay I show that an impossibility result similar to Thomason's can be obtained which does not assume that belief is deductively closed or ideal in any other way. (shrink)

[IMPORTANT CORRECTION - See end of abstract.] In Syntactical Treatments of Modality, with Corollaries on Reflexion Principles and Finite Axiomatizability, Acta Philosophica Fennica 16 (1963), 153–167, Richard Montague shows that the use of a single syntactic predicate (with a context-independent semantic value) to represent modalities of alethic necessity and idealized knowledge leads to inconsistency. In A Note on Syntactical Treatments of Modality, Synthese 44 (1980), 391–395, Richmond Thomason obtains a similar impossibility result for idealized belief: under a syntactical treatment of (...) belief, the assumption that idealized belief is deductively closed, together with certain other plausible conditions on idealized belief, imply that an ideal believer with consistent beliefs cannot believe the truth of Robinson's Arithmetic. In this essay I assert an impossibility result similar to Thomason's but which does not assume that belief is deductively closed or ideal in any other way. There are technical mistakes in the formulations of Lemmas 1-4 and Theorem 2, however. Corrections can be found in the Erratum section of the author's website. (shrink)

We formulate and explore two basic axiomatic systems of type-free subjective probability. One of them explicates a notion of finitely additive probability. The other explicates a concept of infinitely additive probability. It is argued that the first of these systems is a suitable background theory for formally investigating controversial principles about type-free subjective probability.

We describe a general logical framework, Justification Logic, for reasoning about epistemic justification. Justification Logic is based on classical propositional logic augmented by justification assertions t: F that read t is a justification for F. Justification Logic absorbs basic principles originating from both mainstream epistemology and the mathematical theory of proofs. It contributes to the studies of the well-known Justified True Belief vs. Knowledge problem. We state a general Correspondence Theorem showing that behind each epistemic modal logic, there is a (...) robust system of justifications. This renders a new, evidence-based foundation for epistemic logic. As a case study, we offer a resolution of the GoldmanRed Barns in Justification Logic. Furthermore, we formalize the well-known Gettier example and reveal hidden assumptions and redundancies in Gettier’s reasoning. (shrink)

Justification as Ignorance offers an original account of epistemic justification as both non-factive and luminous, vindicating core internalist intuitions without construing justification as an internal condition knowable by reflection alone. Sven Rosenkranz conceives of justification, in its doxastic and propositional varieties, as a kind of epistemic possibility of knowing and of being in a position to know. His account contrasts with recent alternative views that characterize justification in terms of the metaphysical possibility of knowing. Instead, he develops a suitable non-normal (...) multi-modal epistemic logic for knowledge and being in a position to know that respects the finding that these notions create hyperintensional contexts. He also defends his conception of justification against well-known anti-luminosity arguments, shows that the account allows for fruitful applications and principled solutions to the lottery and preface paradoxes, and provides a metaphysics of justification and its varying degrees of strength that is compatible with core assumptions of the knowledge-first approach and disjunctivist conceptions of mental states. (shrink)

) Modern theories of formal truth have traditionally been used to analyse semantic paradoxes, but their field of application goes well beyond this field to include ontological issues, Godel′s incompleteness phenomena, and the relationship between object language, meta language and reduction. All these fields have had new light sched upon them by studies on the theories of truth. In providing a first summary of the various approaches in this field the author documents their respective advantages and areas of application. The (...) emphasis here is on the axiomatic theories of truth developed by Cantini, Feferman, Friedman and the autor himself, which over the past ten years have increasingly gained ground over the semantic theories of Kripke et al. The book describes the way in which many of the aciomatic proposals are built up and expand on semantic theories. This ist the first time that the results in this field have been made accessible to readers in their larger context. The book deals in detail with the technical aspects and so is ideal as a point of entry into the vast array of literature on the metamathematics of this field. A key objective of the book is to extablish a connection between the latest theories of truth and the older constructions elaborated by Tarski. He made a number of important findings about the formal properties of truth back in the 1930s, but some of his constructions are now considered to be obsolete. Tarski′s views appear in a new light in this book since some of his ideas have only been formulated in recent years. (shrink)

The paper critically discusses two prominent arguments against closure principles for knowledge. The first one is the “argument from aggregation”, claiming that closure under conjunction has the consequence that, if one individually knows i premises, one also knows their i-fold conjunction—yet, every one of the premises might exhibit interesting positive epistemic properties while the i-fold conjunction might fail to do so. The second one is the “argument from concatenation”, claiming that closure under entailment has the consequence that, if one knows (...) a premise, one also knows each of its remote consequences one arrives at—yet, again, the premise might exhibit interesting positive epistemic properties while some of its remote consequences might fail to do so. The paper firstly observes that the ways in which these two arguments try to establish that the relevant closure principle has the relevant problematic consequence are strikingly similar. They both crucially involve showing that, given the features of the case, the relevant closure principle acts in effect as a soritical principle, which is in turn assumed to lead validly to the relevant problematic consequence. There are however nontransitive logics of vagueness where soritical principles do not have any problematic consequence. Assuming that one of these logics is the correct logic of vagueness, the paper secondly observes that both arguments describe situations where knowledge is arguably vague in the relevant respects, so that a tolerant logic should be used in reasoning about it, with the effect that the relevant soritical principle no longer validly leads to the relevant problematic consequence. This shows an interesting respect in which the gap between validity and good inference that arguably arises in a transitive framework can be bridged in a tolerant one, thereby approximating better certain features of our epistemic lives as finite subjects. Moreover, even for those who do not subscribe to tolerant logics, the paper’s two observations jointly indicate that, for all the arguments from aggregation and concatenation show, the status of the relevant closure principles should be no worse than that assigned by one’s favoured theory of vagueness to soritical principles, which only rarely is plain falsity and can indeed get arbitrarily close to full truth. (shrink)

First published in 1974. Despite the tendency of contemporary analytic philosophy to put logic and mathematics at a central position, the author argues it failed to appreciate or account for their rich content. Through discussions of such mathematical concepts as number, the continuum, set, proof and mechanical procedure, the author provides an introduction to the philosophy of mathematics and an internal criticism of the then current academic philosophy. The material presented is also an illustration of a new, more general method (...) of approach called substantial factualism which the author asserts allows for the development of a more comprehensive philosophical position by not trivialising or distorting substantial facts of human knowledge. (shrink)

We investigate axiomatizations of Kripke's theory of truth based on the Strong Kleene evaluation scheme for treating sentences lacking a truth value. Feferman's axiomatization KF formulated in classical logic is an indirect approach, because it is not sound with respect to Kripke's semantics in the straightforward sense: only the sentences that can be proved to be true in KF are valid in Kripke's partial models. Reinhardt proposed to focus just on the sentences that can be proved to be true in (...) KF and conjectured that the detour through classical logic in KF is dispensable. We refute Reinhardt's Conjecture, and provide a direct axiomatization PKF of Kripke's theory in partial logic. We argue that any natural axiomatization of Kripke's theory in Strong Kleene logic has the same proof-theoretic strength as PKF, namely the strength of the system RA< ωω ramified analysis or a system of Tarskian ramified truth up to ωω. Thus any such axiomatization is much weaker than Feferman's axiomatization KF in classical logic, which is equivalent to the system RA<ε₀ of ramified analysis up to ε₀. (shrink)

Theories of epistemic justification are commonly assessed by exploring their predictions about particular hypothetical cases – predictions as to whether justification is present or absent in this or that case. With a few exceptions, it is much less common for theories of epistemic justification to be assessed by exploring their predictions about logical principles. The exceptions are a handful of ‘closure’ principles, which have received a lot of attention, and which certain theories of justification are well known to invalidate. But (...) these closure principles are only a small sample of the logical principles that we might consider. In this paper, I will outline four further logical principles that plausibly hold for justification and two which plausibly do not. While my primary aim is just to put these principles forward, I will use them to evaluate some different approaches to justification and (tentatively) conclude that a ‘normic’ theory of justification best captures its logic. (shrink)

One of the most intriguing claims in Sven Rosenkranz’s Justification as Ignorance is that Timothy Williamson’s celebrated anti-luminosity argument can be resisted when it comes to the condition ~K~KP—the condition that one is in no position to know that one is in no position to know P. In this paper, I critically assess this claim.

Self-referential sentences have troubled our understanding of language for centuries. The most famous self-referential sentence is probably the Liar, a sentence that says of itself that it is false. The Liar Paradox has encouraged many philosophers to establish theories of truth that manage to give a proper account of the truth predicate in a formal language. Kripke’s Fixed Point Theory from 1975 is one famous example of such a formal theory of truth that aims at giving a plausible notion of (...) truth by allowing truth value gaps. However, not only the concept of truth gives rise to paradoxes. A syntactical treatment of epistemic notions like belief and knowledge leads to contradictions that very much resemble the Liar Paradox. Therefore, it seems to be fruitful to apply the established theories of truth to epistemic concepts. In this paper, I will present one such attempt of solving the epistemic paradoxes: I adapt Kripke’s Fixed Point Theory and interpret truth, knowledge and belief within the framework of a partial logic. Thereby I find not only the fixed point of truth but also the fixed points of knowledge and belief. In this fixed point, the predicates of truth, belief and knowledge find their definite interpretation and the paradoxes are avoided. (shrink)

The paper explores a structural account of propositional justification in terms of the notion of being in a position to know and negation. Combined with a non-normal logic for being in a position to know, the account allows for the derivation of plausible principles of justification. The account is neutral on whether justification is grounded in internally individuated mental states, and likewise on whether it is grounded in facts that are already accessible by introspection or reflection alone. To this extent, (...) it is compatible both with internalism and with externalism about justification. Even so, the account allows for the proof of principles that are commonly conceived to depend on an internalist conception of justification. The account likewise coheres both with epistemic contextualism and with its rejection, and is compatible both with the knowledge-first approach and with its rejection. Despite its neutrality on these issues, the account makes propositional justification luminous and so is controversial. However, it proves quite resilient in the light of recent anti-luminosity arguments. (shrink)

We consider a language containing partial predicates for subjective knowability and truth. For this language, inductive hierarchy rules are proposed which build up the extension and anti-extension of these partial predicates in stages. The logical interaction between the extension of the truth predicate and the anti-extension of the knowability predicate is investigated.

The work of mathematician and logician Alfred Tarski (1901--1983) marks the transition from substantial to deflationary views about truth.

Rosenkranz has recently proposed a logic for propositional, non-factive, all-things-considered justification, which is based on a logic for the notion of being in a position to know, 309–338 2018). Starting from three quite weak assumptions in addition to some of the core principles that are already accepted by Rosenkranz, I prove that, if one has positive introspective and modally robust knowledge of the axioms of minimal arithmetic, then one is in a position to know that a sentence is not provable (...) in minimal arithmetic or that the negation of that sentence is not provable in minimal arithmetic. This serves as the formal background for an example that calls into question the correctness of Rosenkranz’s logic of justification. (shrink)

The focus of this article is the question whether the notion of being in a position to know is closed under modus ponens. The question is answered negatively.

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)

This book develops a framework for analysing strategic rationality, a notion central to contemporary game theory, which is the formal study of the interaction of rational agents and which has proved extremely fruitful in economics, political theory and business management. The author argues that a logical paradox lies at the root of a number of persistent puzzles in game theory, in particular those concerning rational agents who seek to establish some kind of reputation. Building on the work of Parsons, Burge, (...) Gaifman and Barwise and Etchemendy, Robert Koons constructs a context-sensitive solution to the whole family of liar-like paradoxes including, for the first time, a detailed account of how the interpretation of paradoxical statements is fixed by context. This analysis provides an understanding of how the rational agent model can account for the emergence of rules, practices and institutions. (shrink)