| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4662019 | Annals of Pure and Applied Logic | 2012 | 8 Pages |
Abstract
We construct a Π20 enumeration degree which is a strong minimal cover.
► There is a Π20 enumeration degree which is a strong minimal cover. ► This is the best result possible since the Σ20 enumeration degrees are dense. ► A priority proof using doubling requests is used to construct the required sets.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Thomas F. Kent, Andrew E.M. Lewis, Andrea Sorbi,