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
Parents
28
A system of axiomatic set theory—Part I
Paul Bernays · Journal of Symbolic Logic · 1937 · 130 citations
Leo A. Paquette, Jinsung Tae, Mark P. Arrington et al. · Journal of the American Chemical Society · 2000 · 88 citations
1–5 of 28
119
3 publications · 153 citations
3
h-index
2
h-index
1
h-index
United States Food and Drug Administration, United States
1 publications · 24 citations
1
h-index
1
h-index
1–5 of 119
39

University of Edinburgh
Edinburgh, United Kingdom
2 h-index
2 publications
37 citations
FH Aachen
Aachen, Germany
1 h-index
2 publications
110 citations
Humboldt-Universität zu Berlin
Berlin, Germany
1 h-index
2 publications
48 citations

Kōchi University
Kochi, Japan
1 h-index
3 publications
72 citations

Universidade Federal de São Paulo
São Paulo, Brazil
1 h-index
1 publications
13 citations

University of Warwick
Coventry, United Kingdom
1 h-index
1 publications
24 citations
Dalhousie University
Halifax, Canada
1 h-index
2 publications
38 citations
Beijing National Laboratory for Molecular Sciences
Beijing, China
1 h-index
3 publications
234 citations
1–8 of 39
3 publications · 108 citations
3
h-index
3 publications · 153 citations
3
h-index
JOC · 2 publications · 86 citations
2
h-index
1 publications · 55 citations
1
h-index
1 publications · 24 citations
1
h-index
1–5