If traditional predecessor induction is interpreted computationally as an -step loop, then prefix induction would correspond to a log--step loop. Because of that, proofs using prefix induction are "more feasibly constructive" than proofs using predecessor induction.
If traditional predecessor induction is interpreted computationally as an -step loop then prefix induction would correspond to a log--step loop Because of that proofs using prefix induction are "more feasibly constructive" than proofs using predecessor induction