Advertisement

Archive for Mathematical Logic

, Volume 47, Issue 7–8, pp 677–709 | Cite as

Fruitful and helpful ordinal functions

  • Harold Simmons
Article
  • 32 Downloads

Abstract

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.

Mathematics Subject Classification (2000)

03E10 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Archimedes: The Sand Reckoner; pp. 420–429 of [3]Google Scholar
  2. 2.
    Cooper, S.B. (eds) et al.: Sets and proofs. Cambridge University Press, London (1997)Google Scholar
  3. 3.
    Newman J.R.: The world of mathematics, vol 1. George Allen and Unwin, London (1960)Google Scholar
  4. 4.
    Setzer, A.: Ordinal systems, pp. 301–338 of [2]Google Scholar
  5. 5.
    Setzer, A.: Review of [7], Zentralblatt, Zbl 1067.03063Google Scholar
  6. 6.
    Schütte K.: Kennzeichnung von Ordnungszahlen durch rekursive erklärte Functionen. Math. Ann. 127, 15–32 (1954)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Simmons H.: A comparison of two systems of ordinal notations. Arch. Math. Logic 43, 65–83 (2004)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Simmons, H.: Generating ordinal notations from below (submitted)Google Scholar
  9. 9.
    Veblen O.: Continuous increasing functions of finite and transfinite ordinals. Trans. Am. Math. Soc. 9, 280–292 (1908)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag 2008

Authors and Affiliations

  1. 1.School of MathematicsThe UniversityManchesterUK

Personalised recommendations