Computable Functionals

Journal of Symbolic Logic 24 (1):50-51 (1959)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2964573

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

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

A Note on Computable Functionals.S. C. Kleene - 1959 - Journal of Symbolic Logic 24 (1):51-52.
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.
Predictably computable functionals and definition by recursion.D. L. Kreider & R. W. Ritchie - 1964 - Mathematical Logic Quarterly 10 (5):65-80.
Turing-Machine Computable Functionals of Finite Types I.S. C. Kleene, Ernest Nagel, Patrick Suppes & Alfred Tarski - 1970 - Journal of Symbolic Logic 35 (4):588-589.
Effective Enumerability of Some Families of Partially Recursive Functions Connected With Computable Functionals.Vladeta Vučković - 1970 - Mathematical Logic Quarterly 16 (2):113-121.
D. L. Kreider and R. W. Ritchie. Predictably computable functionals and definition by recursion. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 10 , pp. 65–80. [REVIEW]Paul Axt - 1968 - Journal of Symbolic Logic 33 (2):298-299.

Analytics

Added to PP
2015-02-05

Downloads
15 (#1,237,203)

6 months
6 (#869,904)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The Representational Foundations of Computation.Michael Rescorla - 2015 - Philosophia Mathematica 23 (3):338-366.
Two dogmas of computationalism.Oron Shagrir - 1997 - Minds and Machines 7 (3):321-44.
How Incomputable Is the Separable Hahn-Banach Theorem?Guido Gherardi & Alberto Marcone - 2009 - Notre Dame Journal of Formal Logic 50 (4):393-425.
Computability in Quantum Mechanics.Wayne C. Myrvold - 1995 - In Werner DePauli-Schimanovich, Eckehart Köhler & Friedrich Stadler (eds.), The Foundational Debate: Complexity and Constructivity in Mathematics and Physics. Dordrecht, Boston and London: Kluwer Academic Publishers. pp. 33-46.

View all 21 citations / Add more citations

References found in this work

No references found.

Add more references