A note on finiteness in the predicative foundations of arithmetic

Journal of Philosophical Logic

Volumn 28, Issue 2, 1999, Pages 165-174

  Ferreira, Fernando ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

Finiteness; Foundations of arithmetic; Induction; Natural numbers; Predicativism

Indexed keywords

EID: 53149105950     PISSN: 00223611     EISSN: 15730433     Source Type: Journal    
DOI: 10.1023/A:1004377219147     Document Type: Article

References (6)

1. Feferman, S. and Hellman, G.: Predicative foundations of arithmetic, J. Philos. Logic 24(1) (1995), 1-17.
2. Feferman, S. and Hellman, G.: Challenges to predicative foundations of arithmetic, in G. Sher and R. Tieszen (eds), Between Logic and Intuition: Essays in Honor of Charles Parsons, Cambridge University Press, Cambridge, 1998.
3. Garcia, N.: New Foundations for Recursion Theory, PhD Thesis, Oxford University, Hilary Term, 1980.
4. Parsons, C: The impredicativity of induction, in M. Detlefsen (ed.), Proof Logic and Formalization, Routledge, 1992, pp. 139-161. Revised and expanded version of a 1983 paper.
5. 2 and reverse mathematics, in G. Takeuti (ed.), Proof Theory, North-Holland, Amsterdam, 1987, pp. 433-446.
6. Tarski, A.: Sur les ensembles finis, in S. Givant and R. McKenzie (eds), Alfred Tarski - Collected Works (Vol. 1), Birkhauser, Basel 1986, pp. 67-117. First published in 1924.