Hostname: page-component-7b7567c8c-slfcl Total loading time: 0 Render date: 2026-11-19T21:32:12.405Z Has data issue: false hasContentIssue false

DENSITY-1-BOUNDING AND QUASIMINIMALITY IN THE GENERIC DEGREES

Published online by Cambridge University Press:  08 May 2017

PETER CHOLAK
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF NOTRE DAME NOTRE DAME, IN 46556-5683, USA E-mail: peter.cholak.1@nd.edu URL: http://www.nd.edu/∼cholak
GREGORY IGUSA
Affiliation:
DEPARTMENT OF MATHEMATICS UNIVERSITY OF NOTRE DAME NOTRE DAME, IN 46556-5683, USA E-mail: gigusa@nd.edu URL: http://www3.nd.edu/∼gigusa
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider the question “Is every nonzero generic degree a density-1-bounding generic degree?” By previous results [8] either resolution of this question would answer an open question concerning the structure of the generic degrees: A positive result would prove that there are no minimal generic degrees, and a negative result would prove that there exist minimal pairs in the generic degrees.

We consider several techniques for showing that the answer might be positive, and use those techniques to prove that a wide class of assumptions is sufficient to prove density-1-bounding.

We also consider a historic difficulty in constructing a potential counterexample: By previous results [7] any generic degree that is not density-1-bounding must be quasiminimal, so in particular, any construction of a non-density-1-bounding generic degree must use a method that is able to construct a quasiminimal generic degree. However, all previously known examples of quasiminimal sets are also density-1, and so trivially density-1-bounding. We provide several examples of non-density-1 sets that are quasiminimal.

Using cofinite and mod-finite reducibility, we extend our results to the uniform coarse degrees, and to the nonuniform generic degrees. We define all of the above terms, and we provide independent motivation for the study of each of them.

Combined with a concurrently written paper of Hirschfeldt, Jockusch, Kuyper, and Schupp [4], this paper provides a characterization of the level of randomness required to ensure quasiminimality in the uniform and nonuniform coarse and generic degrees.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2017