The continuous functionals; computations, recursions and degrees

Annals of Mathematical Logic 21 (1):1 (1981)
  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,225

External links

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

Through your library

Analytics

Added to PP
2014-01-17

Downloads
32 (#705,389)

6 months
9 (#482,469)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dag Normann
University of Oslo

Citations of this work

Computability over the Partial Continuous Functionals.Dag Normann - 2000 - Journal of Symbolic Logic 65 (3):1133-1142.
Axiomatic recursion theory and the continuous functionals.Simon Thompson - 1985 - Journal of Symbolic Logic 50 (2):442-450.

Add more citations

References found in this work

Countable functionals.S. C. Kleene - 1959 - Journal of Symbolic Logic 27 (3):81--100.
The 1-section of a countable functional.Dag Normann & Stan S. Wainer - 1980 - Journal of Symbolic Logic 45 (3):549-562.
On effectively discontinuous type-2 objects.Thomas J. Grilliot - 1971 - Journal of Symbolic Logic 36 (2):245-248.
Countable functionals and the projective hierarchy.Dag Normann - 1981 - Journal of Symbolic Logic 46 (2):209-215.

Add more references