Mathematical Induction Proofs is a formal deductive method in mathematical logic that establishes the truth of an infinite sequence of statements by verifying a base case and an inductive step, thereby distinguishing it from other proof techniques through its reliance on the well-ordering principle of natural numbers.
54
Publications
2.3K
Citations
79
Authors
49
Institutions
Publications per year
2017–2026
7
Parents
Publications
54
Toward automatic program synthesis
Zohar Manna, Richard Waldinger · Communications of the ACM · 1971 · 297 citations · Full text
1–5 of 54
Authors
79
- AB
4
h-index
- HW
3
h-index
- EK
2
h-index
- FQ
2
h-index
- GJ
2
h-index
1–5 of 79
Institutions
49
University of Edinburgh
Edinburgh, United Kingdom
3 h-index
7 publications
239 citations
University of Oxford
Oxford, United Kingdom
2 h-index
3 publications
181 citations
Technion – Israel Institute of Technology
Haifa, Israel
2 h-index
3 publications
55 citations
University of California San Diego
San Diego, United States
2 h-index
3 publications
36 citations
SRI International
Menlo Park, United States
1 h-index
1 publications
297 citations
University of Central Florida
Orlando, United States
1 h-index
1 publications
19 citations
Universidad Católica del Norte
Antofagasta, Chile
1 h-index
1 publications
28 citations
Pontificia Universidad Católica de Valparaíso
Valparaíso, Chile
1 h-index
1 publications
28 citations
1–8 of 49
Venues
- Transactions of the American Mathematical Society
TRAN · 3 publications · 586 citations
3
h-index
- The Journal of Mathematical Behavior
JMB · 3 publications · 97 citations
3
h-index
- Choice Reviews Online
CRO · 3 publications · 199 citations
3
h-index
- Edinburgh Research Explorer
Repository · 2 publications · 67 citations
2
h-index
- American Mathematical Monthly
2 publications · 43 citations
2
h-index
1–5