Logical Omniscience Via Proof Complexity

Sergei N. Artëmov, Roman Kuznets. Logical Omniscience Via Proof Complexity. In Zoltán Ésik, editor, Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings. Volume 4207 of Lecture Notes in Computer Science, pages 135-149, Springer, 2006. [doi]

@inproceedings{ArtemovK06,
  title = {Logical Omniscience Via Proof Complexity},
  author = {Sergei N. Artëmov and Roman Kuznets},
  year = {2006},
  doi = {10.1007/11874683_9},
  url = {http://dx.doi.org/10.1007/11874683_9},
  researchr = {https://researchr.org/publication/ArtemovK06},
  cites = {0},
  citedby = {0},
  pages = {135-149},
  booktitle = {Computer Science Logic, 20th International Workshop, CSL 2006, 15th Annual Conference of the EACSL, Szeged, Hungary, September 25-29, 2006, Proceedings},
  editor = {Zoltán Ésik},
  volume = {4207},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-45458-6},
}