Proof schemata simulate primitive recursive arithmetic only when the induction variable is not strongly quantified, so the abstract's unqualified claim is not supported by the paper's own results.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Towards an Analysis of Proofs in Arithmetic
Proof schemata simulate primitive recursive arithmetic only when the induction variable is not strongly quantified, so the abstract's unqualified claim is not supported by the paper's own results.