Tiering as a recursion technique
Simmons, Harold
Bull. Symbolic Logic, Tome 11 (2005) no. 3, p. 321-350 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
I survey the syntactic technique of tiering which can be used to restrict the power of a recursion scheme. I show how various results can be obtained entirely proof theoretically without the use of a model of computation.
Publié le : 2005-09-14
Classification:  
@article{1122038991,
     author = {Simmons, Harold},
     title = {Tiering as a recursion technique},
     journal = {Bull. Symbolic Logic},
     volume = {11},
     number = {3},
     year = {2005},
     pages = { 321-350},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1122038991}
}

Simmons, Harold. Tiering as a recursion technique. Bull. Symbolic Logic, Tome 11 (2005) no. 3, pp.  321-350. http://gdmltest.u-ga.fr/item/1122038991/