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.

Links

PhilArchive

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2014-09-30

Downloads
834 (#17,298)

6 months
86 (#49,437)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Edoardo Rivello
Università di Torino

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references