Review of Symbolic Logic 2 (4):684-699 (2009)

Abstract
This paper introduces theories for arithmetical quasi-inductive definitions (Burgess, 1986) as it has been done for first-order monotone and nonmonotone inductive ones. After displaying the basic axiomatic framework, we provide some initial result in the proof theoretic bounds line of research (the upper one being given in terms of a theory of sets extending Kripke–Platek set theory)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1017/s175502030909025x
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 69,018
Through your library

References found in this work BETA

Elementary Induction on Abstract Structures.Yiannis Nicholas Moschovakis - 1974 - Amsterdam, Netherlands: Dover Publications.
The Revision Theory of Truth.Vann Mcgee - 1996 - Philosophy and Phenomenological Research 56 (3):727-730.
The Truth is Never Simple.John P. Burgess - 1986 - Journal of Symbolic Logic 51 (3):663-681.
Elementary Induction on Abstract Structures.Wayne Richter - 1979 - Journal of Symbolic Logic 44 (1):124-125.

View all 12 references / Add more references

Citations of this work BETA

Truth, Pretense and the Liar Paradox.Bradley Armour-Garb & James A. Woodbridge - 2015 - In Kentaro Fujimoto, José Martínez Fernández, Henri Galinon & Theodora Achourioti (eds.), Unifying the Philosophy of Truth. Springer Verlag. pp. 339-354.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-12-31

Total views
38 ( #296,533 of 2,498,500 )

Recent downloads (6 months)
1 ( #426,098 of 2,498,500 )

How can I increase my downloads?

Downloads

My notes