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
Parents
7
Clifford Spector · Journal of Symbolic Logic · 1955 · 212 citations
Recursive pseudo-well-orderings
Transactions of the American Mathematical Society · 1968 · 119 citations · Full text
1–5 of 7
9
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 9
8
The Ohio State University
Columbus, United States
3 h-index
3 publications
254 citations

Cornell University
Ithaca, United States
1 h-index
1 publications
20 citations
Stanford University
Stanford, United States
1 h-index
1 publications
15 citations
University of Kentucky
Lexington, United States
1 h-index
1 publications
20 citations
Stanford Medicine
Stanford, United States
1 h-index
1 publications
15 citations
Ludwig-Maximilians-Universität München
Munich, Germany
1 h-index
1 publications
16 citations
University of Pennsylvania
Philadelphia, United States
1 h-index
1 publications
11 citations
University of California San Diego
San Diego, United States
1 h-index
1 publications
20 citations
1–8 of 8
TRAN · 2 publications · 134 citations
2
h-index
2 publications · 228 citations
2
h-index
1 publications · 20 citations
1
h-index
1 publications · 11 citations
1
h-index
1 publications · 31 citations
1
h-index
1–5