Notes on Bounded Induction for The Compositional Truth Predicate
Notes on Bounded Induction for The Compositional Truth Predicate
Punktacja ministerialna
30
Data publikacji
Abstrakt (EN)
We prove that the theory of the extensional compositional truth predicate for the language of arithmetic with Δ0-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.
Dyscyplina PBN
filozofia
Czasopismo
Review of Symbolic Logic
Tom
10
Zeszyt
3
Strony od-do
455-480
ISSN
1755-0203
Licencja otwartego dostępu
Dostęp zamknięty