Switch to: References

Add citations

You must login to add citations.
  1. Hyperations, Veblen progressions and transfinite iteration of ordinal functions.David Fernández-Duque & Joost J. Joosten - 2013 - Annals of Pure and Applied Logic 164 (7-8):785-801.
    Ordinal functions may be iterated transfinitely in a natural way by taking pointwise limits at limit stages. However, this has disadvantages, especially when working in the class of normal functions, as pointwise limits do not preserve normality. To this end we present an alternative method to assign to each normal function f a family of normal functions Hyp[f]=〈fξ〉ξ∈OnHyp[f]=〈fξ〉ξ∈On, called its hyperation, in such a way that f0=idf0=id, f1=ff1=f and fα+β=fα∘fβfα+β=fα∘fβ for all α, β.Hyperations are a refinement of the Veblen hierarchy (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • (1 other version)Some uses of dilators in combinatorial problems.V. Michele Abrusci - 1989 - Archive for Mathematical Logic 29 (2):85-109.
    Download  
     
    Export citation  
     
    Bookmark   4 citations