Recursion On Well-ordered Sets

Recursion On Well-Ordered Sets is a mathematical framework in set theory that enables the definition of functions on well-ordered sets by specifying each value in terms of preceding values through transfinite induction.

7

Publications

424

Citations

9

Authors

8

Institutions

Publications per year

2017–2026

0

Authors

9

  1. WP
    Wolfram Pohlers

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

    1 publications · 16 citations

    1

    h-index

  2. CS
    Clifford Spector

    The Ohio State University, United States

    1 publications · 212 citations

    1

    h-index

  3. JB
    Jeffrey B. Remmel

    University of California San Diego, United States

    1 publications · 20 citations

    1

    h-index

  4. AS
    Andre Scedrov

    University of Pennsylvania, United States

    1 publications · 11 citations

    1

    h-index

  5. MR
    Michael Rathjen

    University of Leeds, United Kingdom

    1 publications · 31 citations

    1

    h-index

1–5 of 9

Venues

  1. Transactions of the American Mathematical Society

    TRAN · 2 publications · 134 citations

    2

    h-index

  2. Journal of Symbolic Logic

    2 publications · 228 citations

    2

    h-index

  3. Annals of Pure and Applied Logic

    1 publications · 20 citations

    1

    h-index

  4. Advances in Mathematics

    1 publications · 11 citations

    1

    h-index

  5. Archive for Mathematical Logic

    1 publications · 31 citations

    1

    h-index

1–5