Tiering as a recursion technique

Harold Simmons

doi:10.2178/bsl/1122038991

Translator Disclaimer

September 2005 Tiering as a recursion technique

Harold Simmons

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

Download 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

ACCESS THE FULL ARTICLE

PERSONAL SIGN IN
Full access may be available with your subscription

Password Forgot your password?

Show

Remember Email on this computer

Remember Password

No Project Euclid account? Create an account
or Sign in with your institutional credentials

PURCHASE THIS CONTENT

PURCHASE SINGLE ARTICLE

This article is only available to subscribers.
It is not available for individual sale.

RIGHTS & PERMISSIONS

Abstract

Citation

Information

KEYWORDS/PHRASES

PUBLICATION TITLE:

PUBLICATION YEARS