Transfinite induction within Peano arithmetic
type: Item
instance of: scholarly article
title: Transfinite induction within Peano arithmetic
zbMATH Open document ID: 0858.03056
DOI: 10.1016/0168-0072(95)00029-G
author: Richard Sommer
published in: Annals of Pure and Applied Logic
publication date: 1997-03-19T00:00:00Z
Mathematics Subject Classification ID: 03F30
zbMATH DE Number: 908451
zbMATH Keywords: upper bounds
zbMATH Keywords: transfinite induction
zbMATH Keywords: provably recursive functions
MaRDI profile type: Publication
cites work: Q4163527
cites work: Ordinal complexity of recursive definitions
cites work: Transfinite recursive progressions of axiomatic theories
cites work: Q3962995
cites work: Q5286672
cites work: Rapidly growing Ramsey functions
cites work: Exact estimates of the provability of transfinite induction in the initial segments of arithmetic
cites work: Q3893931
cites work: Q4138726
cites work: Q3884109
cites work: Q3689182
cites work: Q3325707
cites work: Q3866106
cites work: Theory of Formal Systems. (AM-47)
cites work: A classification of the ordinal recursive functions
cites work: Q4723712
full work available at URL: 0168-0072(95)00029-g
OpenAlex ID: W2025460262
description: scientific article; zbMATH DE number 908451