Array Nonrecursive Degrees and Genericity

@inproceedings{Jockusch1996ArrayND,
  title={Array Nonrecursive Degrees and Genericity},
  author={Carl G. Jockusch and Michael StobAbstract},
  year={1996}
}
A class of r.e. degrees, called the array nonrecursive degrees, previously studied by the authors in connection with multiple permitting arguments relative to r.e. sets, is extended to the degrees in general. This class contains all degrees which satisfy a 00 > (a 0 0) 0 (i.e. a 2 GL 2) but in addition there exist low r.e. degrees which are array nonrecursive (a.n.r.). Many results for GL 2 degrees extend to the a.n.r. degrees and thus to certain low degrees. A new notion of genericity (called… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Array nonrecursive degrees and lattice embeddings of the diamond , Ill

  • R. Downey
  • J . Math .
  • 1993

Array nonrecursive sets and multiple permitting arguments ,

  • C. Jockusch R. Downey, M. Stob
  • Recursion Theory Week ( Proceedings , Oberwolfach
  • 1989

A recursively enumerable degree that is not the top of a diamond in theTuring degrees , to appear

  • J. Steel
  • 1981

Degrees of unsolvability complementary between recursively enumerabledegrees

  • S. B. Cooper
  • Annals of Math . Logic
  • 1972

Similar Papers

Loading similar papers…