Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T00:12:42.510Z Has data issue: false hasContentIssue false

Tiering as a Recursion Technique

Published online by Cambridge University Press:  15 January 2014

Harold Simmons*
Affiliation:
Mathematical Foundations Group, The University of Manchester, Oxford Road, Manchester M13 9PL, England. E-mail: hsimmons@manchester.ac.uk

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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2005

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable