Ordinal Recursion

Ordinal Recursion is a recursive method in set theory that defines functions on ordinal numbers by specifying their values at each ordinal in terms of the values at preceding ordinals, uniquely determined by transfinite induction.

28

Publications

709

Citations

36

Authors

34

Institutions

Publications per year

2017–2026

1

Authors

36

  1. TA
    Toshiyasu Arai

    Hiroshima University, Japan

    4 publications · 79 citations

    4

    h-index

  2. SS
    Stanley S. Wainer

    University of Leeds, United Kingdom

    3 publications · 105 citations

    3

    h-index

  3. PK
    Peter Koepke

    Ludwig-Maximilians-Universität München, Germany

    1 publications · 45 citations

    1

    h-index

  4. AW
    Andreas Weiermann

    University of Münster, Germany

    1 publications · 10 citations

    1

    h-index

  5. SD
    Sy D. Friedman

    University of Vienna, Austria

    1 publications · 11 citations

    1

    h-index

1–5 of 36

Venues

  1. Journal of Symbolic Logic

    8 publications · 186 citations

    8

    h-index

  2. Annals of Pure and Applied Logic

    4 publications · 163 citations

    4

    h-index

  3. Archive for Mathematical Logic

    2 publications · 49 citations

    2

    h-index

  4. Information and Computation

    2 publications · 42 citations

    2

    h-index

  5. Journal of the Mathematical Society of Japan

    2 publications · 47 citations

    2

    h-index

1–5