Properly Σ2 Enumeration Degrees

DOI10.1002/malq.19880340603zbMath0667.03034OpenAlexW2062310829MaRDI QIDQ3819056

Catherine Sara Copestake, S. Barry Cooper

Publication date: 1988

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.19880340603

zbMATH Keywords

partial functionse-degreeenumeration degreesEnumeration reducibilityrelative computability between sets of natural numbers

Mathematics Subject Classification ID

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

Related Items (13)

Enumeration 1-genericity in the local enumeration degrees ⋮ IN MEMORIAM: BARRY COOPER 1943–2015 ⋮ Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees ⋮ Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees ⋮ Avoiding uniformity in the \(\Delta_2^0\) enumeration degrees ⋮ Cupping and definability in the local structure of the enumeration degrees ⋮ Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets ⋮ The distribution of properly Σ₂⁰ e-degrees ⋮ Cupping Δ₂⁰ enumeration degrees to 0_e′ ⋮ Splitting and nonsplitting, II: A low₂ c.e. degree above which 0′ is not splittable ⋮ Quasi-minimal enumeration degrees and minimal Turing degrees ⋮ Properly enumeration degrees and the high/low hierarchy ⋮ Noncappable enumeration degrees below 0_e^′

This page was built for publication: Properly Σ2 Enumeration Degrees