A note on the enumeration degrees of 1-generic sets

Archive for Mathematical Logic 55 (3-4):405-414 (2016)

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

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 44,293
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

Computability Theory.S. Barry Cooper - 2004 - Chapman & Hall.
Enumeration Reducibility and Partial Degrees.John Case - 1971 - Annals of Mathematical Logic 2 (4):419-439.
Some Applications of Forcing to Hierarchy Problems in Arithmetic.Peter G. Hinman - 1969 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 15 (20-22):341-352.
Some Applications of Forcing to Hierarchy Problems in Arithmetic.Peter G. Hinman - 1969 - Mathematical Logic Quarterly 15 (20‐22):341-352.

View all 8 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

The Jump Operator on the Ω-Enumeration Degrees.Hristo Ganchev & Ivan N. Soskov - 2009 - Annals of Pure and Applied Logic 160 (3):289-301.
Sets of Generators and Automorphism Bases for the Enumeration Degrees.Andrea Sorbi - 1998 - Annals of Pure and Applied Logic 94 (1-3):263-272.
The Distribution of the Generic Recursively Enumerable Degrees.Ding Decheng - 1992 - Archive for Mathematical Logic 32 (2):113-135.
Limit Lemmas and Jump Inversion in the Enumeration Degrees.Evan J. Griffiths - 2003 - Archive for Mathematical Logic 42 (6):553-562.
Bounded Enumeration Reducibility and its Degree Structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.
Goodness in the Enumeration and Singleton Degrees.Charles M. Harris - 2010 - Archive for Mathematical Logic 49 (6):673-691.
Bounding Nonsplitting Enumeration Degrees.Thomas F. Kent & Andrea Sorbi - 2007 - Journal of Symbolic Logic 72 (4):1405 - 1417.
The Π₃-Theory of the [Image] -Enumeration Degrees Is Undecidable.Thomas F. Kent - 2006 - Journal of Symbolic Logic 71 (4):1284 - 1302.
The Structure of the s -Degrees Contained Within a Single E -Degree.Thomas F. Kent - 2009 - Annals of Pure and Applied Logic 160 (1):13-21.
Badness and Jump Inversion in the Enumeration Degrees.Charles M. Harris - 2012 - Archive for Mathematical Logic 51 (3-4):373-406.
Noncappable Enumeration Degrees Below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.

Analytics

Added to PP index
2015-12-13

Total views
21 ( #415,840 of 2,271,452 )

Recent downloads (6 months)
1 ( #829,300 of 2,271,452 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature