Primitive Recursive Functions

Primitive Recursive Functions is a class of computable functions in computability theory that are defined inductively from basic functions (zero, successor, and projection) by composition and primitive recursion, distinguishing them from more general recursive functions by their restriction to total, finitely iterated constructions.

172

Publications

9.3K

Citations

225

Authors

134

Institutions

Publications per year

2017–2026

13

Authors

225

  1. AW
    Andreas Weiermann

    University of Münster, Germany

    5 publications · 82 citations

    5

    h-index

  2. UK
    Ulrich Kohlenbach

    Technische Universität Darmstadt, Germany

    4 publications · 76 citations

    4

    h-index

  3. MJ
    Michael J. Fischer

    Yale University, United States

    4 publications · 212 citations

    4

    h-index

  4. MP
    Mauro Piccolo

    University of Turin, Italy

    3 publications · 48 citations

    3

    h-index

  5. WA
    William A. Howard

    Columbia University, United States

    3 publications · 92 citations

    3

    h-index

1–5 of 225

Venues

  1. Journal of Symbolic Logic

    31 publications · 1.2K citations

    19

    h-index

  2. Theoretical Computer Science

    10 publications · 389 citations

    10

    h-index

  3. Mathematical logic quarterly

    MLQ · 8 publications · 228 citations

    8

    h-index

  4. Proceedings of the American Mathematical Society

    PROC · 5 publications · 138 citations

    5

    h-index

  5. ACM SIGPLAN Notices

    4 publications · 356 citations

    4

    h-index

1–5