Gerald E. Sacks. A maximal set which is not complete. Michigan mathematical journal, vol. 11 , pp. 193–205

Journal of Symbolic Logic 32 (4):528 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270203

Links

PhilArchive



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

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: Gerald E. Sacks, A Maximal Set which is not Complete. [REVIEW]K. Appel - 1967 - Journal of Symbolic Logic 32 (4):528-528.
Invariant Constructions of Simple and Maximal Sets.Frank P. Weber - 1995 - Mathematical Logic Quarterly 41 (2):143-160.
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.
Ideals of independence.Vera Fischer & Diana Carolina Montoya - 2019 - Archive for Mathematical Logic 58 (5-6):767-785.
Gerald E. Sacks. On a theorem of Lachlan and Martin. Proceedings of the American Mathematical Society, vol. 18 , pp. 140–141. [REVIEW]C. E. M. Yates - 1968 - Journal of Symbolic Logic 32 (4):529.
Gerald E. Sacks. A minimal degree less than O'. Bulletin of the American Mathematical Society, vol. 67 (1961), pp. 416–419. [REVIEW]Robert W. Robinson - 1969 - Journal of Symbolic Logic 34 (2):295-295.
Preface.Gerald E. Sacks - 1972 - Annals of Mathematical Logic 4 (4):341.
On Suborderings of Degrees of Recursive Unsolvability.Gerald E. Sacks - 1961 - Mathematical Logic Quarterly 7 (1-5):46-56.
Mathematical Logic in the 20th Century.Gerald E. Sacks - 2003 - World Scientific.
Gerald E. Sacks. Higher recursion theory. Perspectives in mathematical logic. Springer-Verlag, Berlin etc. 1990, xv + 344 pp. [REVIEW]Dag Normann - 1992 - Journal of Symbolic Logic 57 (2):761-762.
Conjectures and questions from Gerald Sacks's Degrees of Unsolvability.Richard A. Shore - 1997 - Archive for Mathematical Logic 36 (4-5):233-253.
Sacks Gerald E.. Forcing with perfect closed sets. Axiomatic set theory, Proceedings of symposia in pure mathematics, vol. 13 part 1, American Mathematical Society, Providence, Rhode Island, 1971, pp. 331–355. [REVIEW]J. R. Shoenfield - 1974 - Journal of Symbolic Logic 39 (2):330-330.
On Some Complexity Characteristics of Immune Sets.Valeriy K. Bulitko - 1995 - Mathematical Logic Quarterly 41 (3):307-313.
Selected logic papers.Gerald E. Sacks - 1999 - River Edge, N.J.: World Scientific.
Shoenfield J. R.. On degrees of unsolvability. Annals of mathematics, second series, vol. 69 , pp. 644–653.Shoenfield J. R.. An uncountable set of incomparable degrees. Proceedings of the American Mathematical Society, vol. 11 , pp. 61–62. [REVIEW]Gerald E. Sacks - 1964 - Journal of Symbolic Logic 29 (4):203-204.

Analytics

Added to PP
2016-06-30

Downloads
18 (#832,589)

6 months
2 (#1,198,779)

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