Provability Logic and the Completeness Principle

Abstract

We study the provability logic of arithmetical theories that prove their own completeness principle. Using our results, we reprove a theorem obtained by Ardeshir and Mojtahedi in 2014, giving the Sigma1-provability logic of Heyting Arithmetic.