Predictably Computable Functionals and Definition by Recursion

&
Journal of Symbolic Logic 33 (2):298-299 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2269903

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,758

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.
Predictably computable functionals and definition by recursion.D. L. Kreider & R. W. Ritchie - 1964 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 10 (5):65-80.
Recursion on the countable functionals.Dag Normann - 1980 - New York: Springer Verlag.
Reviews. A. Grzegorczyk. Computable functionals. Fundamenta mathematicae, vol. 42 , pp. 168–202. A. Grzegorczyk. On the definition of computable functionals. Ibid., pp. 232–239. [REVIEW]G. Kreisel - 1959 - Journal of Symbolic Logic 24 (1):50-51.
Computability over the Partial Continuous Functionals.Dag Normann - 2000 - Journal of Symbolic Logic 65 (3):1133-1142.
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.
Some subrecursive versions of Grzegorczyk's Uniformity Theorem.Dimiter Skordev - 2004 - Mathematical Logic Quarterly 50 (4-5):520-524.
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.
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.

Analytics

Added to PP
2017-02-21

Downloads
7 (#1,405,055)

6 months
2 (#1,243,547)

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

No references found.

Add more references