Axiomatizing provable $n$-provability

Evgeny Kolmakov, Lev Beklemishev

A formula $\varphi$ is called \emph{$n$-provable} in a formal arithmetical theory $S$ if $\varphi$ is provable in $S$ together with all true arithmetical ${\Pi }_n$-sentences taken as additional…