Hyperarithmetic Hierarchy

The Hyperarithmetic Hierarchy is a stratification of sets of natural numbers in computability theory, where each level is obtained by iterating the Turing jump along recursive ordinals, thereby extending the arithmetical hierarchy into the transfinite while preserving effective definability.

24

Publications

1.1K

Citations

31

Authors

25

Institutions

Publications per year

2017–2026

0

Authors

31

  1. SF
    Sy‐David Friedman

    University of Vienna, Austria

    2 publications · 91 citations

    2

    h-index

  2. YN
    Yiannis N. Moschovakis

    University of California, Los Angeles, United States

    2 publications · 87 citations

    2

    h-index

  3. RA
    Richard A. Shore

    Cornell University, United States

    2 publications · 157 citations

    2

    h-index

  4. GE
    Gerald E. Sacks

    Massachusetts Institute of Technology, United States

    2 publications · 66 citations

    2

    h-index

  5. HF
    Harvey Friedman

    University at Buffalo, State University of New York, United States

    2 publications · 55 citations

    2

    h-index

1–5 of 31

Venues

  1. Journal of Symbolic Logic

    8 publications · 567 citations

    8

    h-index

  2. Transactions of the American Mathematical Society

    TRAN · 6 publications · 239 citations

    6

    h-index

  3. Annals of Pure and Applied Logic

    2 publications · 78 citations

    2

    h-index

  4. Notre Dame Journal of Formal Logic

    2 publications · 88 citations

    2

    h-index

  5. 1

    h-index

1–5