Modal logical aspects of provability predicates and consistency statements
read the original abstract
This paper studies the modal logical aspects of provability predicates and consistency statements for theories of arithmetic. First, we provide an overview of previous works on the correspondence between various derivability conditions for provability predicates and different modal logics. The main technical contribution of the present paper is to establish the arithmetical completeness of the logics $\mathsf{NP}$, $\mathsf{ND}$, $\mathsf{NP4}$, and $\mathsf{ND4}$ by extending Solovay's method and refining Arai's construction of Rosser provability predicates.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Finite Kripke models and provability interpretations in quantified modal logic
Constructs a Σ₂ Fefermanian provability predicate for conversely well-founded finite Kripke models and a Σ₁ predicate satisfying D2^G for finite constant-domain models, each with an arithmetical interpretation that em...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.