Notes on bounded induction for the compositional truth predicate
Logic
2017-12-05 v1
Abstract
We prove that the theory of the extensional compositional truth predicate for the language of arithmetic with -induction scheme for the truth predicate and the full arithmetical induction scheme is not conservative over Peano Arithmetic. In addition, we show that a slightly modified theory of truth actually proves the global reflection principle over the base theory.
Cite
@article{arxiv.1712.00470,
title = {Notes on bounded induction for the compositional truth predicate},
author = {Mateusz Łełyk and Bartosz Wcisło},
journal= {arXiv preprint arXiv:1712.00470},
year = {2017}
}
Comments
38 pages