Provable equality in primitive recursive arithmetic with and without induction

DOI10.2140/pjm.1975.57.379zbMath0354.02034OpenAlexW2016024033MaRDI QIDQ1236526

Harvey M. Friedman

Publication date: 1975

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1975.57.379

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

A version of the ∑1-reflection principle for CFA provable in PRA ⋮ Some results on cut-elimination, provable well-orderings, induction and reflection