Modal logical aspects of provability predicates and consistency statements

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.