
The main result of the paper is that for many \(\Sigma_ 2\) inadmissible ordinals, no 1-generic degree bounds a minimal degree. A short description of the current state of study of the structure of 1-degrees in higher recursion theory is also included.
Higher-type and set recursion theory, Logic, admissible ordinals, minimal degree, 1-generic set, 1-generic degree, Computability and recursion theory on ordinals, admissible sets, etc., inadmissible ordinals
Higher-type and set recursion theory, Logic, admissible ordinals, minimal degree, 1-generic set, 1-generic degree, Computability and recursion theory on ordinals, admissible sets, etc., inadmissible ordinals
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
