| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6424807 | Annals of Pure and Applied Logic | 2014 | 18 Pages |
Abstract
We show that there is a generalized high degree which is a minimal cover of a minimal degree. This is the highest jump class one can reach by finite iterations of minimality. This result also answers an old question by Lerman.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Mingzhong Cai,