Bounded enumeration reducibility and its degree structure

DOI10.1007/S00153-011-0259-2zbMATH Open1241.03054OpenAlexW2093140232MaRDI QIDQ661285

Daniele Marsibilio, Andrea Sorbi

Publication date: 10 February 2012

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00153-011-0259-2

zbMATH Keywords

global propertiesbe-reducibilitystrong enumeration reducibilities

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (6)

Bounding minimal degrees by computably enumerable degrees ⋮ Agreement reducibility ⋮ Reduced criteria for degree sequences ⋮ On the bounded quasi‐degrees of c.e. sets ⋮ Title not available (Why is that?) ⋮ 0/1 vertex and facet enumeration with BDDs

Recommendations

• Strong enumeration reducibilities 👍 👎
• Degrees of denumerability reducibilities 👍 👎
• Bounded recursively enumerable sets and degrees 👍 👎
• On restricted forms of enumeration reducibility 👍 👎
• Enumeration Reducibility and Computable Structure Theory 👍 👎
• Bounding minimal degrees by computably enumerable degrees 👍 👎
• Bounding nonsplitting enumeration degrees 👍 👎
• Logical Approaches to Computational Barriers 👍 👎
• Theory and Applications of Models of Computation 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Bounded enumeration reducibility and its degree structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q661285)