Provability Logic and the Completeness Principle
Publication date
Authors
DOI
Document Type
Master Thesis
Metadata
Show full item recordCollections
License
CC-BY-NC-ND
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.
Keywords
provability logic, completeness principle, arithmetical theories, Heyting Arithmetic, fast provability, slow provability, intuitionistic modal logic