Abstract
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.
Citation
Harold Simmons. "Tiering as a recursion technique." Bull. Symbolic Logic 11 (3) 321 - 350, September 2005. https://doi.org/10.2178/bsl/1122038991
Information
Published: September 2005
First available in Project Euclid: 22 July 2005
zbMATH: 1096.03049
Digital Object Identifier: 10.2178/bsl/1122038991
Rights: Copyright © 2005 Association for Symbolic Logic
