Bounding Minimal Degrees by Computably Enumerable Degrees - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Angsheng Li, Yang Dongping. Bounding Minimal Degrees by Computably Enumerable Degrees. Journal of Symbolic Logic, 63(4):1319-1347, 1998.

@article{LiD98:0,
  title = {Bounding Minimal Degrees by Computably Enumerable Degrees},
  author = {Angsheng Li and Yang Dongping},
  year = {1998},
  researchr = {https://researchr.org/publication/LiD98%3A0},
  cites = {0},
  citedby = {0},
  journal = {Journal of Symbolic Logic},
  volume = {63},
  number = {4},
  pages = {1319-1347},
}

runs on WebDSL