The Peano axioms' induction scheme, though second-order, can be recast as universally quantified equations over successor operations implicitly encoding finiteness constraints.
?Rate how convincing each reason is below to see the overall strength.
No one has weighed in yet. Be the first to share reasons for or against this statement.
Sign in or register to share your perspective on this statement.