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

Authors

18

  1. AP
    Arno Pauly

    University of Cambridge, United Kingdom

    2 publications · 66 citations

    2

    h-index

  2. TK
    Takayuki Kihara

    Japan Advanced Institute of Science and Technology, Japan

    1 publications · 25 citations

    1

    h-index

  3. KH
    Kojiro Higuchi

    Tohoku University, Japan

    1 publications · 41 citations

    1

    h-index

  4. SB
    S. Barry Cooper

    Massey University, New Zealand

    1 publications · 56 citations

    1

    h-index

  5. OA
    Oksana Antonenko

    International Institute for Strategic Studies, United Kingdom

    1 publications · 16 citations

    1

    h-index

1–5 of 18

Venues

  1. Journal of Symbolic Logic

    4 publications · 145 citations

    4

    h-index

  2. Proceedings of the American Mathematical Society

    PROC · 2 publications · 41 citations

    2

    h-index

  3. Logical Methods in Computer Science

    LMCS · 1 publications · 41 citations

    1

    h-index

  4. Ergodic Theory and Dynamical Systems

    1 publications · 48 citations

    1

    h-index

  5. Notre Dame Journal of Formal Logic

    1 publications · 16 citations

    1

    h-index

1–5