Conservative theories of classical truth

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 [2] are conservative over PA.
Keywords Philosophy   Logic   Mathematical Logic and Foundations   Computational Linguistics
Categories (categorize this paper)
DOI 10.1023/A:1005148426909
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 16,667
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA
Peter M. Ainsworth (2009). Newman's Objection. British Journal for the Philosophy of Science 60 (1):135-171.
Kentaro Fujimoto (2012). Classes and Truths in Set Theory. Annals of Pure and Applied Logic 163 (11):1484-1523.
Martin Fischer (2009). Minimal Truth and Interpretability. Review of Symbolic Logic 2 (4):799-815.

View all 7 citations / Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

30 ( #105,336 of 1,726,249 )

Recent downloads (6 months)

7 ( #99,332 of 1,726,249 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.