BibTeX record conf/tphol/OConnor05

download as .bib file

@inproceedings{DBLP:conf/tphol/OConnor05,
  author    = {Russell O'Connor},
  title     = {Essential Incompleteness of Arithmetic Verified by Coq},
  booktitle = {Theorem Proving in Higher Order Logics, 18th International Conference,
               TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings},
  pages     = {245--260},
  year      = {2005},
  crossref  = {DBLP:conf/tphol/2005},
  url       = {https://doi.org/10.1007/11541868\_16},
  doi       = {10.1007/11541868\_16},
  timestamp = {Tue, 14 May 2019 10:00:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tphol/OConnor05},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/tphol/2005,
  editor    = {Joe Hurd and
               Thomas F. Melham},
  title     = {Theorem Proving in Higher Order Logics, 18th International Conference,
               TPHOLs 2005, Oxford, UK, August 22-25, 2005, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {3603},
  publisher = {Springer},
  year      = {2005},
  url       = {https://doi.org/10.1007/11541868},
  doi       = {10.1007/11541868},
  isbn      = {3-540-28372-2},
  timestamp = {Tue, 14 May 2019 10:00:48 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/tphol/2005},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics