Rosenkranz’s Logic of Justification and Unprovability

Journal of Philosophical Logic 49 (6):1243-1256 (2020)
  Copy   BIBTEX

Abstract

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.

Author's Profile

Jan Heylen
KU Leuven

Analytics

Added to PP
2020-05-27

Downloads
348 (#62,713)

6 months
83 (#67,869)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?