Enumeration Reducibility Using Bounded Information: Counting Minimal Covers

DOI10.1002/MALQ.19870330608MaRDI QIDQ3789543zbMATH OpenOpenAlexFDO

Authors S. Barry Cooper

Publication date 1987

Published in Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19870330608

zbMATH Keywords

compactnessdecision reducibilitydegree structurese- reducibilityenumeration reducibilityminimal coversrestricted information degrees

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• On restricted forms of enumeration reducibility
• scientific article; zbMATH DE number 221461
• scientific article; zbMATH DE number 4160710
• Constructing minimal pairs of degrees
• Empty intervals in the enumeration degrees

Cited in

(13)

• The structure of the s-degrees contained within a single e-degree
• Bounded query classes and the difference hierarchy
• On restricted forms of enumeration reducibility
• Noncappable enumeration degrees below 0_e^′
• s-Degrees within e-Degrees
• Embedding finite lattices into the Σ₂⁰ enumeration degrees
• IN MEMORIAM: BARRY COOPER 1943–2015
• Immunity properties and strong positive reducibilities
• Bounding and nonbounding minimal pairs in the enumeration degrees
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
• Bounded enumeration reducibility and its degree structure
• The singleton degrees of the \({\Sigma}_2^0\) sets are not dense
• Strong enumeration reducibilities

This page was built for publication: Enumeration Reducibility Using Bounded Information: Counting Minimal Covers

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