Name
Abstract | ||
|---|---|---|
The structure of the semi lattice of enumeration degrees has been investigated from many aspects. One aspect is the bounding and non-bounding properties of generic degrees. Copestake proved that every 2-generic enumeration degree bounds a minimal pair and conjectured that there exists a 1-generic degree that does not bound a minimal pair. In this paper we verify this longstanding conjecture by constructing such a degree using an infinite injury priority argument. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1093/logcom/exm042 | J. Log. Comput. |
Keywords | Field | DocType |
non-bounding property,longstanding conjecture,2-generic enumeration degree,enumeration degree,semi lattice,infinite injury priority argument,generic degree,minimal pair,1-generic degree | Discrete mathematics,Combinatorics,Minimal pair,Existential quantification,Lattice (order),Enumeration,Algebraic enumeration,Conjecture,Mathematics,Bounding overwatch | Journal |
Volume | Issue | ISSN |
17 | 6 | 0955-792X |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mariya Ivanova Soskova | 1 | 21 | 10.54 |