Provable equality in primitive recursive arithmetic with and without induction

DOI10.2140/PJM.1975.57.379MaRDI QIDQ1236526zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(2)

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

This page was built for publication: Provable equality in primitive recursive arithmetic with and without induction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1236526)