Induction Schemes

Induction Schemes is a formal logical framework within mathematical induction that systematizes the inference structure by specifying a general class of predicates and corresponding recursive proof templates to establish universal quantification over inductively defined domains.

85

Publications

4.3K

Citations

218

Authors

118

Institutions

Publications per year

2017–2026

6

Authors

218

  1. JB
    J. B. Paris

    University of Manchester, United Kingdom

    4 publications · 290 citations

    4

    h-index

  2. LR
    Larry Rendell

    University of Illinois Urbana-Champaign, United States

    3 publications · 244 citations

    3

    h-index

  3. SS
    Saharon Shelah

    Hebrew University of Jerusalem, Israel

    2 publications · 288 citations

    2

    h-index

  4. RK
    Richard Kaye

    University of Manchester, United Kingdom

    2 publications · 61 citations

    2

    h-index

  5. JH
    Jiawei Han

    University of Illinois Urbana-Champaign, United States

    1 publications · 32 citations

    2

    h-index

1–5 of 218

Venues

  1. Journal of Symbolic Logic

    7 publications · 150 citations

    7

    h-index

  2. Theoretical Computer Science

    4 publications · 103 citations

    4

    h-index

  3. Choice Reviews Online

    CRO · 3 publications · 89 citations

    3

    h-index

  4. Information and Computation

    2 publications · 37 citations

    2

    h-index

  5. Machine Learning

    2 publications · 217 citations

    2

    h-index

1–5