Hyperarithmetical Hierarchy
The Hyperarithmetical Hierarchy is a stratification of sets of natural numbers, ordered by definability through iterated jump operators along recursive ordinals, that extends the arithmetical hierarchy by allowing transfinite levels via recursive well-orderings in the context of effective descriptive set theory.
24
Publications
1.2K
Citations
24
Authors
19
Institutions
Publications per year
2017–2026
0
Parents
24
Clifford Spector · Journal of Symbolic Logic · 1955 · 212 citations
Recursive pseudo-well-orderings
Transactions of the American Mathematical Society · 1968 · 119 citations · Full text
K. Jon Barwise, R. O. Gandy, Yiannis N. Moschovakis · Journal of Symbolic Logic · 1971 · 66 citations
1–5 of 24
24
3
h-index
University at Buffalo, State University of New York, United States
2 publications · 55 citations
2
h-index
University of California, Los Angeles, United States
2 publications · 87 citations
2
h-index
2
h-index
2
h-index
1–5 of 24
19

University of Notre Dame
Notre Dame, United States
3 h-index
4 publications
110 citations

Monash University
Melbourne, Australia
3 h-index
3 publications
172 citations
University of California System
Oakland, United States
2 h-index
2 publications
102 citations
The Ohio State University
Columbus, United States
2 h-index
2 publications
245 citations
University at Buffalo, State University of New York
Buffalo, United States
2 h-index
2 publications
55 citations

Cornell University
Ithaca, United States
2 h-index
5 publications
379 citations
University of California, Los Angeles
Los Angeles, United States
2 h-index
2 publications
102 citations
University of Wisconsin–Madison
Madison, United States
1 h-index
1 publications
66 citations
1–8 of 19
TRAN · 8 publications · 351 citations
8
h-index
8 publications · 527 citations
8
h-index
2 publications · 88 citations
2
h-index
1 publications · 31 citations
1
h-index
PROC · 1 publications · 20 citations
1
h-index
1–5