Bounding nonsplitting enumeration degrees

Bounding nonsplitting enumeration degrees

We show that every nonzero $\Sigma _{2}^{0}$ enumeration degree bounds a nonsplitting nonzero enumeration degree.

Saved in:
Bibliographic Details
Published in:The Journal of symbolic logic Vol. 72; no. 4; pp. 1405 - 1417
Main Authors: Kent, Thomas F., Sorbi, Andrea
Format: Journal Article
Language:English
Published: New York, USA Cambridge University Press 01-12-2007
Association for Symbolic Logic, Inc
Association for Symbolic Logic
Subjects:
Approximation
Degree of unsolvability
Lexicography
Logical theorems
Mathematical logic
Mathematical theorems
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We show that every nonzero $\Sigma _{2}^{0}$ enumeration degree bounds a nonsplitting nonzero enumeration degree.
Bibliography:istex:749FF37650B85FC786B3BD21D77D73E6EDE3C4A0
ark:/67375/6GQ-HCXWRQXL-4
PII:S0022481200005004
ArticleID:00500
ISSN:0022-4812
1943-5886
DOI:10.2178/jsl/1203350795