Enumeration reducibility and partial degrees

DOI10.1016/0003-4843(71)90003-9zbMath0223.02046OpenAlexW2069624526MaRDI QIDQ5628119

John Case

Publication date: 1971

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(71)90003-9

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items

A note on the enumeration degrees of 1-generic sets, Strong enumeration reducibilities, Jumps of quasi-minimal enumeration degrees, Unnamed Item, Reducibilities in two models for combinatory logic, Unnamed Item, Enumeration Reducibility and Computable Structure Theory, Density of the cototal enumeration degrees, On some filters and ideals of the Medvedev lattice, A survey of partial degrees, 1-genericity in the enumeration degrees, Interpreting true arithmetic in the -enumeration degrees, Relatively computably enumerable reals, C-quasi-minimal enumeration degrees below \(\mathbf c'\), Partial degrees and \(r\)-degrees, Goodness in the enumeration and singleton degrees, Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets, Enumeration reducibilities, On cototality and the skip operator in the enumeration degrees, On minimal pairs of enumeration degrees, The Π₃-theory of the -enumeration degrees is undecidable, \(e\)-immune sets, Noncappable enumeration degrees below 0_e^′