Weak recursive degrees and a problem of Spector

  • Sh. T. Ishmukhanetov

Abstract

We introduce a concept of weak recursive degrees and show that each weak recursive degree possess a strong minimal cover (s.m.c.). Since the class of r.e. array nonrecursive (a.n.r.) degrees defined by Downey, Jockusch and Stob [1990] is complementary to the class of weak recursive degrees in the r.e. degrees R and no a.n.r.degree can possess a s.m.c. we… (More)

Topics

  • Presentations referencing similar topics