When I read about mathematical induction, there is no general formula, just a notion that is described:
Show true for $n = 1$
Assume true for $n = k$
Show true for $n = k + 1$
Conclusion: Statement is true for all $n \geq 1$
Can we formalize the above notion into a "pluggable" formula where we just plug in the values of what we want to prove?
Any formula would depend on the specific case.
In logic notation,