Effective Enumerability of Some Families of Partially Recursive Functions Connected With Computable Functionals

Mathematical Logic Quarterly 16 (2):113-121 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

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

Through your library

Similar books and articles

Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Recursive functionals.Luis E. Sanchis - 1992 - New York: North-Holland.
Weak Presentations of Computable Fields.Carl G. Jockusch & Alexandra Shlapentokh - 1995 - Journal of Symbolic Logic 60 (1):199 - 208.
Recursion on the countable functionals.Dag Normann - 1980 - New York: Springer Verlag.
Generalized weak presentations.Alexandra Shlapentokh - 2002 - Journal of Symbolic Logic 67 (2):787-819.

Analytics

Added to PP
2013-11-24

Downloads
10 (#1,123,760)

6 months
3 (#880,460)

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