Notre Dame Journal of Formal Logic 59 (4):461-489 (2018)

Abstract
We discuss a notion of forcing that characterizes enumeration 1-genericity, and we investigate the immunity, lowness, and quasiminimality properties of enumeration 1-generic sets and their degrees. We construct an enumeration operator Δ such that, for any A, the set ΔA is enumeration 1-generic and has the same jump complexity as A. We deduce from this and other recent results from the literature that not only does every degree a bound an enumeration 1-generic degree b such that a'=b', but also that, if a is nonzero, then we can find such b satisfying 0e
Keywords degrees   genericity   reducibility  enumeration
Categories (categorize this paper)
DOI 10.1215/00294527-2018-0008
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: 54,608
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

No references found.

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.
On the Symmetric Enumeration Degrees.Charles M. Harris - 2007 - Notre Dame Journal of Formal Logic 48 (2):175-204.
A Non-Splitting Theorem in the Enumeration Degrees.Mariya Ivanova Soskova - 2009 - Annals of Pure and Applied Logic 160 (3):400-418.
A Jump Inversion Theorem for the Enumeration Jump.I. N. Soskov - 2000 - Archive for Mathematical Logic 39 (6):417-437.
Limit Lemmas and Jump Inversion in the Enumeration Degrees.Evan J. Griffiths - 2003 - Archive for Mathematical Logic 42 (6):553-562.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
Noncappable Enumeration Degrees Below 0'e. [REVIEW]S. Barry Cooper & Andrea Sorbi - 1996 - Journal of Symbolic Logic 61 (4):1347 - 1363.
Goodness in the Enumeration and Singleton Degrees.Charles M. Harris - 2010 - Archive for Mathematical Logic 49 (6):673-691.
Bounded Enumeration Reducibility and its Degree Structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.
Structural Properties and $\Sigma^0_2$ Enumeration Degrees.Andre Nies & Andrea Sorbi - 2000 - Journal of Symbolic Logic 65 (1):285-292.
Badness and Jump Inversion in the Enumeration Degrees.Charles M. Harris - 2012 - Archive for Mathematical Logic 51 (3-4):373-406.

Analytics

Added to PP index
2018-10-13

Total views
5 ( #1,120,432 of 2,385,937 )

Recent downloads (6 months)
1 ( #555,436 of 2,385,937 )

How can I increase my downloads?

Downloads

My notes