1-genericity in the enumeration degrees

DOI10.2307/2274578zbMath0663.03030OpenAlexW2062295175MaRDI QIDQ3813806

Kate Copestake

Publication date: 1988

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274578

zbMATH Keywords

enumeration degreesquasiminimal1-generic partial function

Mathematics Subject Classification ID

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

Related Items (7)

A note on the enumeration degrees of 1-generic sets ⋮ Enumeration 1-genericity in the local enumeration degrees ⋮ Cupping and definability in the local structure of the enumeration degrees ⋮ Cupping Δ₂⁰ enumeration degrees to 0_e′ ⋮ Regular enumerations ⋮ Comparing the degrees of enumerability and the closed Medvedev degrees ⋮ Sets of generator and automorphism bases for the enumeration degrees

Cites Work

• Recursively enumerable degress and the conjugacy problem
• On minimal pairs of enumeration degrees
• Enumeration reducibility and partial degrees

This page was built for publication: 1-genericity in the enumeration degrees