Goodness in the enumeration and singleton degrees
type: Item
instance of: scholarly article
title: Goodness in the enumeration and singleton degrees
zbMATH Open document ID: 1202.03051
author: Charles M. Harris
published in: Archive for Mathematical Logic
publication date: 2010-09-08T00:00:00Z
Mathematics Subject Classification ID: 03D30
zbMATH DE Number: 5781208
zbMATH Keywords: enumeration reducibility
zbMATH Keywords: singleton degrees
zbMATH Keywords: partial order embeddings
MaRDI profile type: Publication
full work available at URL: s00153-010-0192-9
OpenAlex ID: W2018499782
cites work: Enumeration reducibility and partial degrees
cites work: On minimal pairs of enumeration degrees
cites work: Partial degrees and the density problem
cites work: Limit lemmas and jump inversion in the enumeration degrees
cites work: On the jump classes of noncuppable enumeration degrees
cites work: Semirecursive Sets and Positive Reducibility
cites work: s-Degrees within e-Degrees
cites work: The upper semi-lattice of degrees of recursive unsolvability
cites work: The \(n\)-rea enumeration degrees are dense
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
cites work: Strong enumeration reducibilities
cites work: Degrees of Unsolvability. (AM-55)
cites work: Q3819052
cites work: Q4348132
cites work: Q4946105
cites work: e- and s-degrees
DOI: 10.1007/S00153-010-0192-9
description: scientific article; zbMATH DE number 5781208