Akira Kanda. Recursion theorems and effective domains. Annals of pure and applied logic, vol. 38 , pp. 289–300

Journal of Symbolic Logic 56 (1):335 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274928

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

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

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.
Dag Normann. Degrees of functionals. Annals of mathematical logic, vol. 16 , pp. 269–304.E. R. Griffor - 1983 - Journal of Symbolic Logic 48 (1):212-213.
Normann Dag. A jump operator in set recursion. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 25 , pp. 251–264. [REVIEW]E. R. Griffor - 1982 - Journal of Symbolic Logic 47 (4):902-902.
Andreas Blass. Selective ultrafilters and homogeneity. Annals of pure and applied logic, vol. 38 , pp. 215–255. - Claude Laflamme. Forcing with filters and complete combinatorics. Annals of pure and applied logic, vol. 42 , pp. 125–163. [REVIEW]Peter J. Nyikos - 1991 - Journal of Symbolic Logic 56 (4):1490-1492.
Lawrence S. Moss. Power set recursion. Annals of pure and applied logic, vol. 71 , pp. 247–306.Dag Normann - 1996 - Journal of Symbolic Logic 61 (4):1388-1389.
Richard Sommer. Transfinite induction within Peano arithmetic. Annals of pure and applied logic, vol. 76 , pp. 231–289.Michael Rathjen - 1996 - Journal of Symbolic Logic 61 (4):1388.
Recursion theorems and effective domains.Akira Kanda - 1988 - Annals of Pure and Applied Logic 38 (3):289-300.
Metakides G. and Nerode A.. Recursively enumerable vector spaces. Annals of mathematical logic, vol. 11 , pp. 147–171.Metakides G. and Nerode A.. Effective content of field theory. Annals of mathematical logic, vol. 17 , pp. 289–320.Metakides G. and Nerode A.. Recursion theory on fields and abstract dependence. Journal of algebra, vol. 65 , pp. 36–59. [REVIEW]A. G. Hamilton - 1983 - Journal of Symbolic Logic 48 (3):880-882.
Edward Nelson. The syntax of nonstandard analysis. Annals of pure and applied logic, vol. 38 , pp. 123–134.Nigel Cutland - 1991 - Journal of Symbolic Logic 56 (2):751-752.

Analytics

Added to PP
2013-11-03

Downloads
60 (#370,593)

6 months
12 (#218,371)

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

No references found.

Add more references