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 [Book Review]

Journal of Symbolic Logic 36 (1):148 (1971)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271527

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,130

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

Soare Robert I.. Automorphisms of the lattice of recursively enumerable sets. Part I: maximal sets. Annals of mathematics, ser. 2 vol. 100 , pp. 80–120. - Lerman Manuel and Soare Robert I.. d-Simple sets, small sets, and degree classes. Pacific journal of mathematics, vol. 87 , pp. 135–155. - Cholak Peter. Automorphisms of the lattice of recursively enumerable sets. Memoirs of the American Mathematical Society, no. 541. American Mathematical Society, Providence1995, viii + 151 pp. - Harrington Leo and Soare Robert I.. The Δ30-automorphism method and noninvariant classes of degrees. Journal of the American Mathematical Society, vol. 9 , pp. 617–666. [REVIEW]Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
Robert W. Robinson. Simplicity of recursively enumerable sets.The journal of symbolic logic, vol. 32 , pp. 162–172. - Robert W. Robinson. Two theorems on hyperhypersimple sets. Transactions of the American Mathematical Society, vol. 128 , pp. 531–538. - A. H. Lachlan. On the lattice of recursively enumerable sets.Transactions of the American Mathematical Society, vol. 130 , pp. 1–37. - A. H. Lachlan. The elementary theory of recursively enumerable sets. Duke mathematical journal, vol. 35 , pp. 123–146. [REVIEW]James C. Owings - 1970 - Journal of Symbolic Logic 35 (1):153-155.
[Omnibus Review].Rod Downey - 1997 - Journal of Symbolic Logic 62 (3):1048-1055.
Soare Robert I.. Recursively enumerable sets and degrees. A study of computable functions and computably generated sets. Perspectives in mathematical logic. Springer-Verlag, Berlin, Heidelberg, New York, etc., 1987, xviii + 437 pp. [REVIEW]Eberhard Herrmann & Rodney Downey - 1990 - Journal of Symbolic Logic 55 (1):356-357.
Rice H. G.. Classes of recursively enumerable sets and their decision problems. Transactions of the American Mathematical Society, vol. 74 pp. 358–366. [REVIEW]Rózsa Péter - 1954 - Journal of Symbolic Logic 19 (2):121-122.
Rice H. G.. Recursive and recursively enumerable orders. Transactions of the American Mathematical Society, vol. 83 , pp. 277–300. [REVIEW]Martin Davis - 1957 - Journal of Symbolic Logic 22 (4):375-375.
James H. Schmerl. Peano models with many generic classes. Pacific Journal of Mathematics, vol. 43 (1973), pp. 523–536. - James H. Schmerl. Correction to: “Peano models with many generic classes”. Pacific Journal of Mathematics, vol. 92 (1981), no. 1, pp. 195–198. - James H. Schmerl. Recursively saturated, rather classless models of Peano arithmetic. Logic Year 1979–80. Recursively saturated, rather classless models of Peano arithmetic. Logic Year 1979–80 (Proceedings, Seminars, and Conferences in Mathematical Logic, University of Connecticut, Storrs, Connecticut, 1979/80). edited by M. Lerman, J. H. Schmerl, and R. I. Soare, Lecture Notes in Mathematics, vol. 859. Springer, Berlin, pp. 268–282. - James H. Schmerl. Recursively saturatedmodels generated by indiscernibles. Notre Dane Journal of Formal Logic, vol. 26 (1985), no. 1, pp. 99–105. - James H. Schmerl. Large resplendent models generated by indiscernibles. The Journal of Symbolic Logic, vol. 54 (1989), no. 4, pp. 1382–1388. - Jam. [REVIEW]Roman Kossak - 2009 - Bulletin of Symbolic Logic 15 (2):222-227.
Louise Hay. On creative sets and indices of partial recursive functions. Transactions of the American Mathematical Society, vol. 120 no. 2 , pp. 359–367. - Louise Hay. Isomorphism types of index sets of partial recursive functions. Proceedings of the American Mathematical Society, vol. 17 , pp. 106–110. - Louise Hay. Index sets of finite classes of recursively enumerable sets. The journal of symbolic logic, vol. 34 , pp. 39–44. [REVIEW]Forbes D. Lewis - 1974 - Journal of Symbolic Logic 39 (1):186-187.
Recursion Theory and Dedekind Cuts.Robert I. Soare - 1971 - Journal of Symbolic Logic 36 (1):148-148.
Gerald E. Sacks. Metarecursively enumerable sets and admissible ordinals. Bulletin of the American Mathematical Society, vol. 72 , pp. 59–64. - Gerald E. Sacks. Post's problem, admissible ordinals, and regularity. Transactions of the American Mathematical Society, vol. 124 , pp. 1–23. - Gerald E. Sacks. Metarecursion theory. Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by John N. Crossley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 243–263. - Graham C. DriscollJr., Metarecursively enumerable sets and their metadegrees. The Journal of symbolic logic, vol. 33 , pp. 389–11. [REVIEW]Richard A. Platek - 1969 - Journal of Symbolic Logic 34 (1):115-116.

Analytics

Added to PP
2013-11-03

Downloads
34 (#662,872)

6 months
11 (#338,628)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references