Philip Kremer, Department of Philosophy, McMaster University Note: The following version of this paper does not contain the proofs of the stated theorems. A longer version, complete with proofs, is forthcoming. §1. Introduction. In "The truth is never simple" and its addendum, Burgess conducts a breathtakingly comprehensive survey of the complexity of the set of truths which arise when you add a truth predicate to arithmetic, and interpret that predicate according to the fixed point semantics or the revision-theoretic semantics for languages expressing their own truth concepts. Burgess considers various sets that can be said to represent truth in this context, and shows that their complexity ranges from Π11 or Σ11 to Π12 or Σ12. Thus, enriching arithmetic with a truth predicate increases its complexity, which is otherwise only ∆11
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
New Wave Deflationism.Nic Damnjanovic - 2010 - In Cory D. Wright & Nikolaj J. L. L. Pedersen (eds.), New Waves in Truth. Palgrave-Macmillan. pp. 45--58.
The Liar Speaks the Truth: A Defense of the Revision Theory of Truth.Aladdin Mahmūd Yaqūb - 1993 - Oxford University Press.
Comparing Fixed-Point and Revision Theories of Truth.Philip Kremer - 2009 - Journal of Philosophical Logic 38 (4):363-403.
Added to index2009-01-28
Total downloads37 ( #140,958 of 2,178,184 )
Recent downloads (6 months)2 ( #166,015 of 2,178,184 )
How can I increase my downloads?