Enumeration Reducibility Using Bounded Information: Counting Minimal Covers
From MaRDI portal
Publication:3789543
DOI10.1002/malq.19870330608zbMath0646.03037OpenAlexW2066055833MaRDI QIDQ3789543
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
compactnessminimal coversenumeration reducibilitydegree structuresdecision reducibilitye- reducibilityrestricted information degrees
Related Items
Embedding finite lattices into the Σ20 enumeration degrees ⋮ Strong enumeration reducibilities ⋮ Bounded query classes and the difference hierarchy ⋮ IN MEMORIAM: BARRY COOPER 1943–2015 ⋮ s-Degrees within e-Degrees ⋮ Bounded enumeration reducibility and its degree structure ⋮ Bounding and nonbounding minimal pairs in the enumeration degrees ⋮ Immunity properties and strong positive reducibilities ⋮ Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets ⋮ On restricted forms of enumeration reducibility ⋮ The structure of the s-degrees contained within a single e-degree ⋮ Noncappable enumeration degrees below 0e′