Encodability of Kleene's O

&
Journal of Symbolic Logic 38 (3):437 - 440 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2273040

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,676

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: Robert I. Soare, Recursion Theory and Dedekind Cuts; Robert I. Soare, Cohesive Sets and Recursively Enumerable Dedekind Cuts. [REVIEW]Brian H. Mayoh - 1971 - Journal of Symbolic Logic 36 (1):148-148.
[Omnibus Review].Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
Review: Robert I. Soare, Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets. [REVIEW]Eberhard Herrmann & Rodney Downey - 1990 - Journal of Symbolic Logic 55 (1):356-357.
Robert I. Soare. Recursion theory and Dedekind cuts. Transactions of the American Mathematical Society, vol. 140 , pp. 271–294. - Robert I. Soare. Cohesive sets and recursively enumerable Dedekind cuts. Pacific Journal of mathematics, vol. 31 , pp. 215–231. [REVIEW]Brian H. Mayoh - 1971 - Journal of Symbolic Logic 36 (1):148.
Robert I. Soare, Turing Computability, Theory and Applications of Computability, Springer-Verlag, Berlin, Heidelberg, 2016, xxxvi + 263 pp. [REVIEW]Damir D. Dzhafarov - 2017 - Bulletin of Symbolic Logic 23 (1):113-115.
John N. Crossley and Kurt Schütte. Non-uniqueness at ω2 in Kleene's O. Archiv für mathematische Logik und Grundlagenforschung, vol. 9 , pp. 95–101. - Peter H. G. Aczel. Paths in Kleene's O. Archiv für mathematische Logik und Grundlagenforschung, vol. 10 , pp. 8–12. [REVIEW]Gustav B. Hensel - 1970 - Journal of Symbolic Logic 35 (2):336.
Review: R. O. Gandy, On a Problem of Kleene's. [REVIEW]Wayne Richter - 1964 - Journal of Symbolic Logic 29 (2):104-104.
Computability, enumerability, unsolvability, Directions in recursion theory, edited by S. B. Cooper, T. A. Slaman, and S. S. Wainer, London Mathematical Society lecture note series, no. 224, Cambridge University Press, Cambridge, New York, and Oakleigh, Victoria, 1996, vii + 347 pp. - Leo Harrington and Robert I. Soare, Dynamic properties of computably enumerable sets, Pp. 105–121. - Eberhard Herrmann, On the ∀∃-theory of the factor lattice by the major subset relation, Pp. 139–166. - Manuel Lerman, Embeddings into the recursively enumerable degrees, Pp. 185–204. - Xiaoding Yi, Extension of embeddings on the recursively enumerable degrees modulo the cappable degrees, Pp. 313–331. - André Nies, Relativization of structures arising from computability theory. Pp. 219–232. - Klaus Ambos-Spies, Resource-bounded genericity. Pp. 1–59. - Rod Downey, Carl G. Jockusch, and Michael Stob. Array nonrecursive degrees and genericity, Pp. 93–104. - Masahiro Kumabe, Degrees of generic sets, Pp. 167–183. [REVIEW]C. T. Chong - 1999 - Journal of Symbolic Logic 64 (3):1362-1365.

Analytics

Added to PP
2009-01-28

Downloads
59 (#360,520)

6 months
6 (#846,711)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Happy families.A. R. D. Mathias - 1977 - Annals of Mathematical Logic 12 (1):59.
$\Pi ^{0}_{1}$ -Encodability and Omniscient Reductions.Benoit Monin & Ludovic Patey - 2019 - Notre Dame Journal of Formal Logic 60 (1):1-12.

Add more citations

References found in this work

No references found.

Add more references