- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Tiering as a recursion technique
Bulletin of Symbolic Logic 11 (3):321-350 (2005)
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 computationLinks
PhilArchive
External links
- From the Publisher via CrossRef (no proxy)
- citeseerx.ist.psu.edu
(no proxy) - dx.doi.org (no proxy)
- mathtest.math.ucla.edu (no proxy)
- projecteuclid.org (no proxy)
- projecteuclid.org [2] (no proxy)
- projecteuclid.org [3] (no proxy)
- journals.cambridge.org (no proxy)
- jstor.org (no proxy)
- jstor.org [2] (no proxy)
- jstor.org [3] (no proxy)
- cambridge.org (no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Axiomatic recursion theory and the continuous functionals.Simon Thompson - 1985 - Journal of Symbolic Logic 50 (2):442-450.
Natural Recursion Doesn’t Work That Way: Automata in Planning and Syntax.Cem Bozsahin - 2016 - In Vincent C. Müller (ed.), Fundamental Issues of Artificial Intelligence. Cham: Springer. pp. 95-112.
The Sacks Density Theorem and $\Sigma_2$-Bounding.Marcia Groszek, Michael Mytilinaios & Theodore Slaman - 1996 - Journal of Symbolic Logic 61 (2):450-467.
Doxastic logic: a new approach.Daniel Rönnedal - 2018 - Journal of Applied Non-Classical Logics 28 (4):313-347.
On the proof of Solovay's theorem.Dick de Jongh, Marc Jumelet & Franco Montagna - 1991 - Studia Logica 50 (1):51-69.
A reduction of the recursion scheme.M. D. Gladstone - 1967 - Journal of Symbolic Logic 32 (4):505-508.
Simplifications of the recursion scheme.M. D. Gladstone - 1971 - Journal of Symbolic Logic 36 (4):653-665.
The Sacks density theorem and Σ2-bounding.Marcia J. Groszek, Michael E. Mytilinaios & Theodore A. Slaman - 1996 - Journal of Symbolic Logic 61 (2):450 - 467.
A Reduction of the Recursion Scheme.M. D. Gladstone - 1970 - Journal of Symbolic Logic 35 (4):591-591.
Analytics
Added to PP
2009-01-28
Downloads
81 (#70,962)
6 months
7 (#1,397,300)
2009-01-28
Downloads
81 (#70,962)
6 months
7 (#1,397,300)
Historical graph of downloads
References found in this work
The realm of primitive recursion.Harold Simmons - 1988 - Archive for Mathematical Logic 27 (2):177-188.
Safe recursion with higher types and BCK-algebra.Martin Hofmann - 2000 - Annals of Pure and Applied Logic 104 (1-3):113-166.
A new "feasible" arithmetic.Stephen Bellantoni & Martin Hofmann - 2002 - Journal of Symbolic Logic 67 (1):104-116.
Characterizing the elementary recursive functions by a fragment of Gödel's T.Arnold Beckmann & Andreas Weiermann - 2000 - Archive for Mathematical Logic 39 (7):475-491.
Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity.Daniel Leivant - 1999 - Annals of Pure and Applied Logic 96 (1-3):209-229.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-ktvwr uwo