Enumeration reducibility and partial degrees

DOI10.1016/0003-4843(71)90003-9MaRDI QIDQ5628119zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(24)

• Partial degrees and \(r\)-degrees
• Enumeration reducibilities
• \(e\)-immune sets
• Density of the cototal enumeration degrees
• C-quasi-minimal enumeration degrees below c'
• A note on the enumeration degrees of 1-generic sets
• Enumeration reducibility and computable structure theory
• Noncappable enumeration degrees below 0_e^′
• Reducibilities in two models for combinatory logic
• The Π₃-theory of the -enumeration degrees is undecidable
• Interpreting true arithmetic in the _2⁰-enumeration degrees
• Jumps of quasi-minimal enumeration degrees
• 1-genericity in the enumeration degrees
• A survey of partial degrees
• On minimal pairs of enumeration degrees
• On cototality and the skip operator in the enumeration degrees
• scientific article; zbMATH DE number 7092101 (Why is no real title available?)
• Relatively computably enumerable reals
• eT-reducibility of sets
• Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets
• Learning families of algebraic structures from text
• Strong enumeration reducibilities
• On some filters and ideals of the Medvedev lattice
• Goodness in the enumeration and singleton degrees

This page was built for publication: Enumeration reducibility and partial degrees

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