Journal of Symbolic Logic 56 (3):1068-1074 (1991)

Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2275073
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 72,634
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Classical Recursion Theory.Peter G. Hinman - 2001 - Bulletin of Symbolic Logic 7 (1):71-73.
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references

Citations of this work BETA

Splitting Theorems in Recursion Theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Some Orbits for E.Peter Cholak, Rod Downey & Eberhard Herrmann - 2001 - Annals of Pure and Applied Logic 107 (1-3):193-226.
Some Orbits For.Peter Cholak, Rod Downey & Eberhard Herrmann - 2001 - Annals of Pure and Applied Logic 107 (1-3):193-226.

Add more citations

Similar books and articles

Diagonals and Semihyperhypersimple Sets.Martin Kummer - 1991 - Journal of Symbolic Logic 56 (3):1068-1074.
Diagonals and D-Maximal Sets.Eberhard Herrmann & Martin Kummer - 1994 - Journal of Symbolic Logic 59 (1):60-72.
Diagonals and $Mathscr{D}$-Maximal Sets.Eberhard Herrmann & Martin Kummer - 1994 - Journal of Symbolic Logic 59 (1):60-72.
Sets and Point-Sets: Five Grades of Set-Theoretic Involvement in Geometry.John P. Burgess - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:456 - 463.
Weakly Semirecursive Sets and R.E. Orderings.Martin Kummer & Frank Stephan - 1993 - Annals of Pure and Applied Logic 60 (2):133-150.
Cuppability of Simple and Hypersimple Sets.Martin Kummer & Marcus Schaefer - 2007 - Notre Dame Journal of Formal Logic 48 (3):349-369.
Effectively and Noneffectively Nowhere Simple Sets.Valentina S. Harizanov - 1996 - Mathematical Logic Quarterly 42 (1):241-248.
Recursively Enumerable Generic Sets.Wolfgang Maass - 1982 - Journal of Symbolic Logic 47 (4):809-823.
Index Sets in the Arithmetical Hierarchy.Ulrike Brandt - 1988 - Annals of Pure and Applied Logic 37 (2):101-110.
Powers of 2.Kyriakos Keremedis & Horst Herrlich - 1999 - Notre Dame Journal of Formal Logic 40 (3):346-351.
The Length Problem for Co‐R.E. Sets.Martin Kummer - 1988 - Mathematical Logic Quarterly 34 (3):277-282.
On Subcreative Sets and S-Reducibility.John T. Gill Iii & Paul H. Morris - 1974 - Journal of Symbolic Logic 39 (4):669 - 677.
Powers Of.Kyriakos Keremedis & Horst Herrlich - 1999 - Notre Dame Journal of Formal Logic 40 (3):346-351.

Analytics

Added to PP index
2016-06-30

Total views
2 ( #1,458,228 of 2,533,752 )

Recent downloads (6 months)
1 ( #389,210 of 2,533,752 )

How can I increase my downloads?

Downloads

My notes