Induction On Integers
Induction On Integers is a proof method in mathematical logic that belongs to the class of induction principles and is distinguished by its application to propositions indexed over the integers, proceeding from a base case and establishing the truth of a statement for all integers by verifying its invariance under incremental steps.
7
Publications
265
Citations
8
Authors
8
Institutions
Publications per year
2017–2026
0
Parents
7
Enumerative Induction and Best Explanation
Robert H. Ennis · The Journal of Philosophy · 1968 · 85 citations
Integers, polynomials, and rings: a course in algebra
Choice Reviews Online · 2005 · 62 citations
The representation theory of cyclotomic BMW algebras
1–5 of 7
8
1
h-index
Rutgers, The State University of New Jersey, United States
1 publications · 25 citations
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 8
8
Center for Discrete Mathematics and Theoretical Computer Science
Piscataway, United States
1 h-index
1 publications
25 citations

Australian National University
Canberra, Australia
1 h-index
1 publications
10 citations

Nihon University
Tokyo, Japan
1 h-index
1 publications
62 citations

Carleton University
Ottawa, Canada
1 h-index
1 publications
10 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
1 h-index
1 publications
10 citations
Rutgers Sexual and Reproductive Health and Rights
Utrecht, Netherlands
1 h-index
1 publications
25 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
2 publications
50 citations
Ben-Gurion University of the Negev
Beersheba, Israel
1 h-index
1 publications
25 citations
1–8 of 8
Repository · 1 publications · 11 citations
1
h-index
1 publications · 85 citations
1
h-index
1 publications · 10 citations
1
h-index
CRO · 1 publications · 62 citations
1
h-index
1 publications · 62 citations
1
h-index
1–5