- 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
On definition trees of ordinal recursive functonals: Reduction of the recursion orders by means of type level raising
Journal of Symbolic Logic 47 (2):395-402 (1982)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(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
A general formulation of simultaneous inductive-recursive definitions in type theory.Peter Dybjer - 2000 - Journal of Symbolic Logic 65 (2):525-549.
How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study.Andreas Weiermann - 1998 - Journal of Symbolic Logic 63 (4):1348-1370.
Computation on abstract data types. The extensional approach, with an application to streams.Solomon Feferman - 1995 - Annals of Pure and Applied Logic 81 (1-3):75-113.
On Scott and Karp trees of uncountable models.Tapani Hyttinen & Jouko Väänänen - 1990 - Journal of Symbolic Logic 55 (3):897-908.
An ordinal analysis of admissible set theory using recursion on ordinal notations.Jeremy Avigad - 2002 - Journal of Mathematical Logic 2 (1):91-112.
On the physical possibility of ordinal computation (draft).Jeffrey A. Barrett & Wayne Aitken - unknown
A recursion theoretic analysis of the clopen Ramsey theorem.Peter Clote - 1984 - Journal of Symbolic Logic 49 (2):376-400.
Theory Reduction by Means of Functional Sub‐types.Michael Esfeld & Christian Sachse - 2007 - International Studies in the Philosophy of Science 21 (1):1 – 17.
Analytics
Added to PP
2009-01-28
Downloads
206 (#95,379)
6 months
1 (#1,498,742)
2009-01-28
Downloads
206 (#95,379)
6 months
1 (#1,498,742)
Historical graph of downloads
Citations of this work
Typed lambda calculus.Henk P. Barendregt, Wil Dekkers & Richard Statman - 1977 - In Jon Barwise & H. Jerome Keisler (eds.), Handbook of Mathematical Logic. North-Holland Pub. Co.. pp. 1091--1132.
How to assign ordinal numbers to combinatory terms with polymorphic types.William R. Stirton - 2012 - Archive for Mathematical Logic 51 (5):475-501.
Reduction of higher type levels by means of an ordinal analysis of finite terms.Jan Terlouw - 1985 - Annals of Pure and Applied Logic 28 (1):73-102.
References found in this work
Interpretation of analysis by means of constructive functionals of finite types.Georg Kreisel - 1959 - In A. Heyting (ed.), Constructivity in Mathematics. Amsterdam: North-Holland Pub. Co.. pp. 101--128.
Eine Klassifikation der ε0‐Rekursiven Funktionen.Helmut Schwichtenberg - 1971 - Mathematical Logic Quarterly 17 (1):61-74.
Eine Klassifikation der ε 0 ‐Rekursiven Funktionen.Helmut Schwichtenberg - 1971 - Mathematical Logic Quarterly 17 (1):61-74.
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-7c76586df8-g9ljc uwo