Finite Induction

Finite Induction is a formal proof technique in mathematical logic and discrete mathematics that belongs to the class of inductive reasoning methods, distinguished by its application to finite sequences of propositions through a base case and an inductive step that together establish the truth of all propositions within the sequence.

4

Publications

108

Citations

6

Authors

4

Institutions

Publications per year

2017–2026

0

Authors

6

  1. PJ
    Paul J. Dagdigian

    Johns Hopkins University, United States

    1 publications · 42 citations

    1

    h-index

  2. FP
    Flavio Previale

    University of Turin, Italy

    1 publications · 14 citations

    1

    h-index

  3. JM
    John Macintyre

    Dana-Farber Cancer Institute, United States

    1 publications · 17 citations

    1

    h-index

  4. ME
    Michael E. Mytilinaios

    Dartmouth College, United States

    1 publications · 35 citations

    1

    h-index

  5. DP
    Dipti Patel-Misra

    Johns Hopkins University, United States

    1 publications · 42 citations

    1

    h-index

1–5 of 6

Institutions

4

  1. University of Turin

    Turin, Italy

    1 h-index

    1 publications

    14 citations

  2. Johns Hopkins University

    Baltimore, United States

    1 h-index

    3 publications

    126 citations

  3. Collegio Carlo Alberto

    Moncalieri, Italy

    1 h-index

    1 publications

    14 citations

  4. Dartmouth College

    Hanover, United States

    1 h-index

    1 publications

    35 citations

1–4 of 4

Venues

  1. Journal of Symbolic Logic

    2 publications · 52 citations

    2

    h-index

  2. The Journal of Chemical Physics

    1 publications · 42 citations

    1

    h-index

  3. Archive for Mathematical Logic

    1 publications · 14 citations

    1

    h-index

1–3