G. Kreisel and Gerald E. Sacks. Metarecursive sets. The journal of symbolic logic, vol. 30 , pp. 318–338

Journal of Symbolic Logic 33 (4):622-623 (1968)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

1969

DOI

10.2307/2271406

Links

PhilArchive



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

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

Metarecursive Sets.G. Kreisel & Gerald E. Sacks - 1968 - Journal of Symbolic Logic 33 (4):622-623.
Metarecursive sets.G. Kreisel & Gerald E. Sacks - 1965 - Journal of Symbolic Logic 30 (3):318-338.
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.
Review: Gerald E. Sacks, Forcing with Perfect Closed Sets. [REVIEW]J. R. Shoenfield - 1974 - Journal of Symbolic Logic 39 (2):330-330.
Metarecursively Enumerable Sets and Admissible Ordinals.Gerald E. Sacks & Graham C. Driscoll - 1969 - Journal of Symbolic Logic 34 (1):115-116.
Review: R. M. Friedberg, The Fine Structure of Degrees of Unsolvability of Recursively Enumerable Sets. [REVIEW]Gerald E. Sacks - 1963 - Journal of Symbolic Logic 28 (2):166-166.
Kreisel, Generalized.Gerald E. Sacks - 1996 - In Piergiorgio Odifreddi (ed.), Kreiseliana. About and Around Georg Kreisel. A K Peters. pp. 103.
Friedberg R. M.. The fine structure of degrees of unsolvability of recursively enumerable sets. Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, 1957, 2nd edn., Communications Research Division, Institute for Defense Analyses, Princeton, N.J., 1960, pp. 404–406. [REVIEW]Gerald E. Sacks - 1963 - Journal of Symbolic Logic 28 (2):166-166.
Meeting of the association for symbolic logic Washington, D.c., 1975.James Owinos, Hilary Putnam & Gerald Sacks - 1976 - Journal of Symbolic Logic 41 (1):279-288.
Meeting of the association for symbolic logic: New York, 1975.Paul Benacerraf, Simon Kochen & Gerald Sacks - 1977 - Journal of Symbolic Logic 42 (1):143-155.
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.
A. H. Lachlan. The impossibility of finding relative complements for recursively enumerable degrees. The journal of symbolic logic, vol. 31 , pp. 434–454. [REVIEW]Gerald E. Sacks - 1971 - Journal of Symbolic Logic 36 (3):539-540.
On the Degrees Less than 0'.Gerald E. Sacks - 1964 - Journal of Symbolic Logic 29 (1):60-60.
Gerald E. Sacks. A minimal degree less than O'. Bulletin of the American Mathematical Society, vol. 67 (1961), pp. 416–419. [REVIEW]Gerald E. Sacks - 1969 - Journal of Symbolic Logic 34 (2):295-295.
Degrees of Unsolvability.Gustav B. Hensel - 1964 - Journal of Symbolic Logic 29 (4):202-203.

Analytics

Added to PP
2013-11-03

Downloads
27 (#584,441)

6 months
4 (#779,417)

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