V\'{\i }t\v ezslav \v Svejdar

V\'{\i }t\v ezslav \v Svejdar
The limit lemma in fragments of arithmetic

Comment.Math.Univ.Carolinae 44,3 (2003) 565-568.

Abstract:The recursion theoretic limit lemma, saying that each function with a $\varSigma _{n+2}$ graph is a limit of certain function with a $\varDelta _{n+1}$ graph, is provable in $\text {B}\Sigma _{n+1}$.

Keywords: limit lemma, fragments of arithmetic, collection scheme
AMS Subject Classification: 03F30, 03D55

PDF

V\'{\i }t\v ezslav \v Svejdar The limit lemma in fragments of arithmetic

V\'{\i }t\v ezslav \v Svejdar
The limit lemma in fragments of arithmetic