Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T11:54:45.944Z Has data issue: false hasContentIssue false

A MINIMAL PAIR IN THE GENERIC DEGREES

Published online by Cambridge University Press:  12 November 2019

DENIS R. HIRSCHFELDT*
Affiliation:
DEPARTMENT OF MATHEMATICS THE UNIVERSITY OF CHICAGO CHICAGO, IL, USA E-mail: drh@math.uchicago.edu
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.

We show that there is a minimal pair in the nonuniform generic degrees, and hence also in the uniform generic degrees. This fact contrasts with Igusa’s result that there are no minimal pairs for relative generic computability and answers a basic structural question mentioned in several papers in the area.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2019