Studia Logica 62 (3):353-370 (1999)
Some axiomatic theories of truth and related subsystems of second-order arithmetic are surveyed and shown to be conservative over their respective base theory. In particular, it is shown by purely finitistically means that the theory PA ÷ "there is a satisfaction class" and the theory FS of  are conservative over PA.
|Keywords||Philosophy Logic Mathematical Logic and Foundations Computational Linguistics|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
Newman's Objection.Peter M. Ainsworth - 2009 - British Journal for the Philosophy of Science 60 (1):135-171.
Conservativity for Theories of Compositional Truth Via Cut Elimination.Graham E. Leigh - 2015 - Journal of Symbolic Logic 80 (3):845-865.
Reducing Compositional to Disquotational Truth.Volker Halbach - 2009 - Review of Symbolic Logic 2 (4):786-798.
Classes and Truths in Set Theory.Kentaro Fujimoto - 2012 - Annals of Pure and Applied Logic 163 (11):1484-1523.
Similar books and articles
Deflationism, Conservativeness and Maximality.Cezary Cieśliński - 2007 - Journal of Philosophical Logic 36 (6):695 - 705.
Added to index2009-01-28
Total downloads45 ( #116,225 of 2,172,879 )
Recent downloads (6 months)3 ( #117,033 of 2,172,879 )
How can I increase my downloads?