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
Parents
28
1–5 of 28
36
4
h-index
3
h-index
1
h-index
1
h-index
1
h-index
1–5 of 36
34

University of Leeds
Leeds, United Kingdom
3 h-index
4 publications
128 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
6 publications
253 citations

Hiroshima University
Hiroshima, Japan
2 h-index
2 publications
29 citations

École Normale Supérieure Paris-Saclay
Gif-sur-Yvette, France
2 h-index
5 publications
223 citations

Kobe University
Kobe, Japan
2 h-index
2 publications
50 citations
University of Illinois Chicago
Chicago, United States
2 h-index
2 publications
33 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
1 publications
12 citations

The King's College
New York, United States
1 h-index
1 publications
15 citations
1–8 of 34
8 publications · 186 citations
8
h-index
4 publications · 163 citations
4
h-index
2 publications · 49 citations
2
h-index
2 publications · 42 citations
2
h-index
2 publications · 47 citations
2
h-index
1–5