Bounded enumeration reducibility and its degree structure
type: Item
instance of: scholarly article
title: Bounded enumeration reducibility and its degree structure
zbMATH Open document ID: 1241.03054
author: Daniele Marsibilio
author: Andrea Sorbi
published in: Archive for Mathematical Logic
publication date: 2012-02-10T00:00:00Z
Mathematics Subject Classification ID: 03D30
Mathematics Subject Classification ID: 03D25
zbMATH DE Number: 6005015
zbMATH Keywords: strong enumeration reducibilities
zbMATH Keywords: be-reducibility
zbMATH Keywords: global properties
MaRDI profile type: Publication
full work available at URL: s00153-011-0259-2
OpenAlex ID: W2093140232
cites work: Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
cites work: Goodness in the enumeration and singleton degrees
cites work: The structure of the s-degrees contained within a single e-degree
cites work: Singleton enumeration reducibility and arithmetic
cites work: Q3256320
cites work: Creative sets
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
cites work: Strong enumeration reducibilities
cites work: Enumeration reducibilities
cites work: RELATIONSHIPS BETWEEN DIFFERENT FORMS OF RELATIVE COMPUTABILITY OF FUNCTIONS
cites work: Q5573961
cites work: Degrees of Unsolvability. (AM-55)
cites work: Definability in the enumeration degrees
cites work: e- and s-degrees
DOI: 10.1007/S00153-011-0259-2
Recommended article: Theory and Applications of Models of Computation
Recommended article: Bounding nonsplitting enumeration degrees
Recommended article: Bounded recursively enumerable sets and degrees
Recommended article: Bounding minimal degrees by computably enumerable degrees
Recommended article: Degrees of denumerability reducibilities
Recommended article: On restricted forms of enumeration reducibility
Recommended article: Logical Approaches to Computational Barriers
Recommended article: Strong enumeration reducibilities
Recommended article: Q4946106
Recommended article: Enumeration Reducibility and Computable Structure Theory
description: scientific article; zbMATH DE number 6005015