Medvedev Degrees
Medvedev Degrees is a degree structure in computability theory that classifies sets of natural numbers by mediating reducibility via uniformly computable transformations, distinguishing it from other reducibilities by its reliance on mass problems and indexed Medvedev reduction.
14
Publications
396
Citations
18
Authors
13
Institutions
Publications per year
2017–2026
1
14
Partial degrees and the density problem
S. Barry Cooper · Journal of Symbolic Logic · 1982 · 56 citations
Joseph S. Miller · Proceedings of the American Mathematical Society · 2011 · 31 citations · Full text
1–5 of 14
18
2
h-index
Japan Advanced Institute of Science and Technology, Japan
1 publications · 25 citations
1
h-index
1
h-index
1
h-index
International Institute for Strategic Studies, United Kingdom
1 publications · 16 citations
1
h-index
1–5 of 18
13
University of Cambridge
Cambridge, United Kingdom
2 h-index
2 publications
66 citations
University of Wisconsin–Madison
Madison, United States
2 h-index
2 publications
43 citations

Pennsylvania State University
State College, United States
1 h-index
1 publications
48 citations

University of Leeds
Leeds, United Kingdom
1 h-index
1 publications
56 citations
University of Michigan
Ann Arbor, United States
1 h-index
1 publications
23 citations

University of Bologna
Bologna, Italy
1 h-index
1 publications
66 citations
University of California, Berkeley
Berkeley, United States
1 h-index
1 publications
25 citations
University of Vienna
Vienna, Austria
1 h-index
1 publications
16 citations
1–8 of 13
4 publications · 145 citations
4
h-index
PROC · 2 publications · 41 citations
2
h-index
LMCS · 1 publications · 41 citations
1
h-index
1 publications · 48 citations
1
h-index
1 publications · 16 citations
1
h-index
1–5