Complete Induction

Complete Induction is a proof technique in mathematical logic and recursion theory that belongs to the class of inductive methods and is distinguished by its reliance on the assumption that a property holds for all natural numbers less than a given number in order to establish its truth for that number.

28

Publications

1.1K

Citations

119

Authors

39

Institutions

Publications per year

2017–2026

4

Authors

119

  1. PB
    Paul Bernays

    3 publications · 153 citations

    3

    h-index

  2. DE
    Dieter Enders

    RWTH Aachen University, Germany

    2 publications · 66 citations

    2

    h-index

  3. JE
    Joseph E. Gootenberg

    Georgetown University, United States

    1 publications · 30 citations

    1

    h-index

  4. MR
    Marc R. Theoret

    United States Food and Drug Administration, United States

    1 publications · 24 citations

    1

    h-index

  5. JB
    Jamie Busch

    University of Pittsburgh, United States

    1 publications · 41 citations

    1

    h-index

1–5 of 119

Venues

  1. Tetrahedron Letters

    3 publications · 108 citations

    3

    h-index

  2. Journal of Symbolic Logic

    3 publications · 153 citations

    3

    h-index

  3. The Journal of Organic Chemistry

    JOC · 2 publications · 86 citations

    2

    h-index

  4. Liebigs Annalen der Chemie

    1 publications · 55 citations

    1

    h-index

  5. PLoS ONE

    1 publications · 24 citations

    1

    h-index

1–5