Selection functions for recursive functionals

Notre Dame Journal of Formal Logic 10 (3):225-234 (1969)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



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

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

On provable recursive functions.H. B. Enderton - 1968 - Notre Dame Journal of Formal Logic 9 (1):86-88.
Constructively nonpartial recursive functions.Bruce M. Horowitz - 1980 - Notre Dame Journal of Formal Logic 21 (2):273-276.
Recursive linear orderings and hyperarithmetical functions.Shih-Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (3):129-132.
A note on arbitrarily complex recursive functions.Carl H. Smith - 1988 - Notre Dame Journal of Formal Logic 29 (2):198-207.
Functionals defined by recursion.Luis Elpidio Sanchis - 1967 - Notre Dame Journal of Formal Logic 8 (3):161-174.
Recursive equivalence types on recursive manifolds.Leon W. Harkleroad - 1979 - Notre Dame Journal of Formal Logic 20 (1):1-31.
On recursive transcendence.R. L. Goodstein & J. Hooley - 1960 - Notre Dame Journal of Formal Logic 1 (4):127-137.

Analytics

Added to PP
2010-08-24

Downloads
22 (#978,081)

6 months
11 (#356,365)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

On effectively discontinuous type-2 objects.Thomas J. Grilliot - 1971 - Journal of Symbolic Logic 36 (2):245-248.
Selection in abstract recursion theory.L. A. Harrington & D. B. Macqueen - 1976 - Journal of Symbolic Logic 41 (1):153-158.
Degrees of functionals.Dag Normann - 1979 - Annals of Mathematical Logic 16 (3):269.

Add more citations

References found in this work

No references found.

Add more references