Eliminating the ordinals from proofs. An analysis of transfinite recursion

In Proceedings of the conference "Philosophy, Mathematics, Linguistics. Aspects of Interaction", St. Petersburg, April 21-25, 2014. pp. 174-184 (2014)
  Copy   BIBTEX

Abstract

Transfinite ordinal numbers enter mathematical practice mainly via the method of definition by transfinite recursion. Outside of axiomatic set theory, there is a significant mathematical tradition in works recasting proofs by transfinite recursion in other terms, mostly with the intention of eliminating the ordinals from the proofs. Leaving aside the different motivations which lead each specific case, we investigate the mathematics of this action of proof transforming and we address the problem of formalising the philosophical notion of elimination which characterises this move.

Author's Profile

Edoardo Rivello
Università di Torino

Analytics

Added to PP
2014-09-30

Downloads
831 (#16,053)

6 months
85 (#46,376)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?