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)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(81)90014-0

Links

PhilArchive



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

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

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.
Normann Dag. Recursion on the countable functionals. Lecture notes in mathematics, vol. 811. Springer-Verlag, Berlin, Heidelberg, and New York, 1980, VIII + 191 pp.Normann Dag. The continuous functionals; computations, recursions and degrees. Annals of mathematical logic, vol. 21 , pp. 1–26. [REVIEW]Peter G. Hinman - 1984 - Journal of Symbolic Logic 49 (2):668-670.
Computability over the Partial Continuous Functionals.Dag Normann - 2000 - Journal of Symbolic Logic 65 (3):1133-1142.
Degrees of continuous functionals.Peter G. Hinman - 1973 - Journal of Symbolic Logic 38 (3):393-395.
The Computational Power of ℳω.Dag Normann & Christian Rørdam - 2002 - Mathematical Logic Quarterly 48 (1):117-124.
Degrees of unsolvability of continuous functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555-584.
Degrees of Functionals.E. R. Griffor - 1983 - Journal of Symbolic Logic 48 (1):212-213.
Degrees of functionals.Dag Normann - 1979 - Annals of Mathematical Logic 16 (3):269.
Aspects of the Continuous Functionals.Dag Normann - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion Theory. American Mathematical Society. pp. 42--171.
Review: Dag Normann, Degrees of Functionals. [REVIEW]E. R. Griffor - 1983 - Journal of Symbolic Logic 48 (1):212-213.
Characterizing the continuous functionals.Dag Normann - 1983 - Journal of Symbolic Logic 48 (4):965-969.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Priority arguments in the continuous R. E. degrees.Simon Thompson - 1985 - Journal of Symbolic Logic 50 (3):661-667.
Closing the gap between the continuous functionals and recursion in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $^3E$\end{document}. [REVIEW]Dag Normann - 1997 - Archive for Mathematical Logic 36 (4-5):269-287.
General type-structures of continuous and countable functionals.Dag Normann - 1983 - Mathematical Logic Quarterly 29 (4):177-192.

Analytics

Added to PP
2014-01-17

Downloads
18 (#811,325)

6 months
2 (#1,232,442)

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.
On effectively discontinuous type-2 objects.Thomas J. Grilliot - 1971 - Journal of Symbolic Logic 36 (2):245-248.
The 1-section of a countable functional.Dag Normann & Stan S. Wainer - 1980 - Journal of Symbolic Logic 45 (3):549-562.
Countable functionals and the projective hierarchy.Dag Normann - 1981 - Journal of Symbolic Logic 46 (2):209-215.

Add more references