A combinatorial analysis of functions provably recursive in
Fundamenta Mathematicae (1988)
- Volume: 130, Issue: 3, page 191-213
- ISSN: 0016-2736
Access Full Article
top
How to cite
topRatajczyk, Z.. "A combinatorial analysis of functions provably recursive in $ΙΣ_n$." Fundamenta Mathematicae 130.3 (1988): 191-213. <http://eudml.org/doc/211705>.
@article{Ratajczyk1988,
author = {Ratajczyk, Z.},
journal = {Fundamenta Mathematicae},
keywords = {provably recursive functions; exponential function; Hardy hierarchy},
language = {eng},
number = {3},
pages = {191-213},
title = {A combinatorial analysis of functions provably recursive in $ΙΣ_n$},
url = {http://eudml.org/doc/211705},
volume = {130},
year = {1988},
}
TY - JOUR
AU - Ratajczyk, Z.
TI - A combinatorial analysis of functions provably recursive in $ΙΣ_n$
JO - Fundamenta Mathematicae
PY - 1988
VL - 130
IS - 3
SP - 191
EP - 213
LA - eng
KW - provably recursive functions; exponential function; Hardy hierarchy
UR - http://eudml.org/doc/211705
ER -
Citations in EuDML Documents
top- Teresa Bigorajska, Henryk Kotlarski, A partition theorem for α-large sets
- Teresa Bigorajska, Henryk Kotlarski, James Schmerl, On regular interstices and selective types in countable arithmetically saturated models of Peano Arithmetic
- Z. Ratajczyk, Arithmetical transfinite induction and hierarchies of functions
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.