| dc.rights.license | CC-BY-NC-ND | |
| dc.contributor.advisor | Iemhoff, R. | |
| dc.contributor.advisor | Visser, A. | |
| dc.contributor.author | Zoethout, J. | |
| dc.date.accessioned | 2018-02-02T18:01:15Z | |
| dc.date.available | 2018-02-02T18:01:15Z | |
| dc.date.issued | 2018 | |
| dc.identifier.uri | https://studenttheses.uu.nl/handle/20.500.12932/28524 | |
| dc.description.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. | |
| dc.description.sponsorship | Utrecht University | |
| dc.format.extent | 459657 | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | |
| dc.title | Provability Logic and the Completeness Principle | |
| dc.type.content | Master Thesis | |
| dc.rights.accessrights | Open Access | |
| dc.subject.keywords | provability logic, completeness principle, arithmetical theories, Heyting Arithmetic, fast provability, slow provability, intuitionistic modal logic | |
| dc.subject.courseuu | Philosophy | |
