BibTeX record journals/apal/DowneyLN98

download as .bib file

@article{DBLP:journals/apal/DowneyLN98,
  author       = {Rodney G. Downey and
                  Geoffrey LaForte and
                  Andr{\'{e}} Nies},
  title        = {Computably Enumerable Sets and Quasi-Reducibility},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {95},
  number       = {1-3},
  pages        = {1--35},
  year         = {1998},
  url          = {https://doi.org/10.1016/S0168-0072(98)00013-X},
  doi          = {10.1016/S0168-0072(98)00013-X},
  timestamp    = {Fri, 21 Feb 2020 21:18:56 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/DowneyLN98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.