Predictably computable functionals and definition by recursion

&
Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (5):65-80 (1964)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19640100502

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Predictably computable functionals and definition by recursion.D. L. Kreider & R. W. Ritchie - 1964 - Mathematical Logic Quarterly 10 (5):65-80.
Review: D. L. Kreider, R. W. Ritchie, Predictably Computable Functionals and Definition by Recursion. [REVIEW]Paul Axt - 1968 - Journal of Symbolic Logic 33 (2):298-299.
Recursion on the countable functionals.Dag Normann - 1980 - New York: Springer Verlag.
The Computational Power of ℳω.Dag Normann & Christian Rørdam - 2002 - Mathematical Logic Quarterly 48 (1):117-124.
The hereditary partial effective functionals and recursion theory in higher types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Axiomatic recursion theory and the continuous functionals.Simon Thompson - 1985 - Journal of Symbolic Logic 50 (2):442-450.
Monotone majorizable functionals.Helmut Schwichtenberg - 1999 - Studia Logica 62 (2):283-289.
A restricted computation model on Scott domains and its partial primitive recursive functionals.Karl-Heinz Niggl - 1998 - Archive for Mathematical Logic 37 (7):443-481.
Equivalence of bar recursors in the theory of functionals of finite type.Marc Bezem - 1988 - Archive for Mathematical Logic 27 (2):149-160.
Review: S. C. Kleene, Ernest Nagel, Patrick Suppes, Alfred Tarski, Turing-Machine Computable Functionals of Finite Types I; S. C. Kleene, Turing-Machine Computable Functionals of Finite Types II. [REVIEW]D. A. Clarke - 1970 - Journal of Symbolic Logic 35 (4):588-589.
Classes of Predictably Computable Functions.Robert W. Ritchie - 1963 - Journal of Symbolic Logic 28 (3):252-253.
Review: Dag Normann, Recursion on the Countable Functionals; Dag Normann, The Continuous Functionals; Computations, Recursions and Degrees. [REVIEW]Peter G. Hinman - 1984 - Journal of Symbolic Logic 49 (2):668-670.
Review: Robert W. Ritchie, Classes of Predictably Computable Functions. [REVIEW]C. C. Elgot - 1963 - Journal of Symbolic Logic 28 (3):252-253.
Finite computable dimension does not relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.
Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.

Analytics

Added to PP
2016-02-04

Downloads
39 (#397,578)

6 months
8 (#352,434)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Introduction to metamathematics.Stephen Cole Kleene - 1952 - Groningen: P. Noordhoff N.V..
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Rekursive Funktionen.Raphael M. Robinson & Rozsa Peter - 1951 - Journal of Symbolic Logic 16 (4):280.
Introduction to Metamathematics.Ann Singleterry Ferebee - 1968 - Journal of Symbolic Logic 33 (2):290-291.

View all 7 references / Add more references