Degrees of functionals

Annals of Mathematical Logic 16 (3):269 (1979)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(79)90004-4

Links

PhilArchive



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

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.
Degrees of continuous functionals.Peter G. Hinman - 1973 - Journal of Symbolic Logic 38 (3):393-395.
Degrees of Functionals.E. R. Griffor - 1983 - Journal of Symbolic Logic 48 (1):212-213.
Review: Dag Normann, Degrees of Functionals. [REVIEW]E. R. Griffor - 1983 - Journal of Symbolic Logic 48 (1):212-213.
The continuous functionals; computations, recursions and degrees.Dag Normann - 1981 - Annals of Mathematical Logic 21 (1):1.
The Computational Power of ℳω.Dag Normann & Christian Rørdam - 2002 - Mathematical Logic Quarterly 48 (1):117-124.
Computability over the Partial Continuous Functionals.Dag Normann - 2000 - Journal of Symbolic Logic 65 (3):1133-1142.
Recursion on the countable functionals.Dag Normann - 1980 - New York: Springer Verlag.
Infima of d.r.e. degrees.Jiang Liu, Shenling Wang & Guohua Wu - 2010 - Archive for Mathematical Logic 49 (1):35-49.
Computing with functionals: Computability theory or computer science?Dag Normann - 2006 - Bulletin of Symbolic Logic 12 (1):43-59.
The hereditary partial effective functionals and recursion theory in higher types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals.Marc Bezem - 1985 - Journal of Symbolic Logic 50 (3):652-660.
Bi-Isolation in the D.C.E. Degrees.Guohua Wu - 2004 - Journal of Symbolic Logic 69 (2):409 - 420.
Bi-isolation in the d.c.e. degrees.Guohua Wu - 2004 - Journal of Symbolic Logic 69 (2):409-420.

Analytics

Added to PP
2014-01-17

Downloads
8 (#1,287,956)

6 months
1 (#1,510,037)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dag Normann
University of Oslo

Citations of this work

No citations found.

Add more citations

References found in this work

Internal cohen extensions.D. A. Martin & R. M. Solovay - 1970 - Annals of Mathematical Logic 2 (2):143-178.
A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
Internal Cohen extensions.D. A. Martin - 1970 - Annals of Mathematical Logic 2 (2):143.
Recursive Functionals and Quantifiers of Finite Types II.S. C. Kleene - 1971 - Journal of Symbolic Logic 36 (1):146-146.
Computations in higher types.Johan Moldestad - 1977 - New York: Springer Verlag.

View all 9 references / Add more references