Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-16T18:55:03.313Z Has data issue: false hasContentIssue false

A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE

Published online by Cambridge University Press:  04 November 2019

RODNEY G. DOWNEY
Affiliation:
DEPARTMENT OF MATHEMATICS AND STATISTICS VICTORIA UNIVERSITY WELLINGTON P. O. BOX 600, WELLINGTON, NEW ZEALAND E-mail: rod.downey@vuw.ac.nz
SATYADEV NANDAKUMAR
Affiliation:
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING INDIAN INSTITUTE OF TECHNOLOGY KANPUR KANPUR208016, UTTAR PRADESH, INDIA E-mail: satyadev@cse.iitk.ac.in
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.

Jockusch showed that 2-generic degrees are downward dense below a 2-generic degree. That is, if a is 2-generic, and $0 < {\bf{b}} < {\bf{a}}$, then there is a 2-generic g with $0 < {\bf{g}} < {\bf{b}}.$ In the case of 1-generic degrees Kumabe, and independently Chong and Downey, constructed a minimal degree computable from a 1-generic degree. We explore the tightness of these results.

We solve a question of Barmpalias and Lewis-Pye by constructing a minimal degree computable from a weakly 2-generic one. While there have been full approximation constructions of ${\rm{\Delta }}_3^0$ minimal degrees before, our proof is rather novel since it is a computable full approximation construction where both the generic and the minimal degrees are ${\rm{\Delta }}_3^0 - {\rm{\Delta }}_2^0$.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2019