
Abstract
We axiomatize Leitgeb’s (2005) theory of truth and show that this theory proves all arithmetical sentences of the system of ramified analysis up to ε0. We also give alternative axiomatizations of Kripke’s (1975) theory of truth (Strong Kleene and supervaluational version) and show that they are at least as strong as the Kripke-Feferman system KF and Cantini’s VF, respectively.
Item Type: | Journal article |
---|---|
Form of publication: | Publisher's Version |
Faculties: | Philosophy, Philosophy of Science and Religious Science |
Subjects: | 100 Philosophy and Psychology > 100 Philosophy |
URN: | urn:nbn:de:bvb:19-epub-59141-1 |
ISSN: | 1755-0203 |
Alliance/National Licence: | This publication is with permission of the rights owner freely accessible due to an Alliance licence and a national licence (funded by the DFG, German Research Foundation) respectively. |
Annotation: | Published online: 30 October 2013 |
Language: | English |
Item ID: | 59141 |
Date Deposited: | 23. Nov 2018, 16:00 |
Last Modified: | 04. Nov 2020, 13:38 |