Fruitful and helpful ordinal functions

Archive for Mathematical Logic 47 (7-8):677-709 (2008)
  Copy   BIBTEX


In Simmons (Arch Math Logic 43:65–83, 2004), I described a method of producing ordinal notations ‘from below’ (for countable ordinals up to the Howard ordinal) and compared that method with the current popular ‘from above’ method which uses a collapsing function from uncountable ordinals. This ‘from below’ method employs a slight generalization of the normal function—the fruitful functions—and what seems to be a new class of functions—the helpful functions—which exist at all levels of the function space hierarchy over ordinals. Unfortunately, I was rather sparing in my description of these classes of functions. In this paper I am much more generous. I describe the properties of the helpful functions on all finite levels and, in the final section, indicate how they can be used to simplify the generation of ordinal notations. The main aim of this paper is to fill in the details missing from [7]. The secondary aim is to indicate what can be done with helpful functions. Fuller details of this development will appear elsewhere



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

A comparison of two systems of ordinal notations.Harold Simmons - 2004 - Archive for Mathematical Logic 43 (1):65-83.
Variations on a theme by Weiermann.Toshiyasu Arai - 1998 - Journal of Symbolic Logic 63 (3):897-925.
Normal forms for elementary patterns.Timothy J. Carlson & Gunnar Wilken - 2012 - Journal of Symbolic Logic 77 (1):174-194.
Assignment of Ordinals to Patterns of Resemblance.Gunnar Wilken - 2007 - Journal of Symbolic Logic 72 (2):704 - 720.
Normal functions and constructive ordinal notations.Larry W. Miller - 1976 - Journal of Symbolic Logic 41 (2):439-459.
Dynamic ordinal analysis.Arnold Beckmann - 2003 - Archive for Mathematical Logic 42 (4):303-334.
Ordinal arithmetic and $\Sigma_{1}$ -elementarity.Timothy J. Carlson - 1999 - Archive for Mathematical Logic 38 (7):449-460.
Proof theory and ordinal analysis.W. Pohlers - 1991 - Archive for Mathematical Logic 30 (5-6):311-376.


Added to PP

31 (#486,401)

6 months
6 (#417,196)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

A comparison of two systems of ordinal notations.Harold Simmons - 2004 - Archive for Mathematical Logic 43 (1):65-83.
Sets and Proofs.S. Barry Cooper & John K. Truss - 2001 - Studia Logica 69 (3):446-448.

Add more references