How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus

Pavel Pudlák, Samuel R. Buss. How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus. In Leszek Pacholski, Jerzy Tiuryn, editors, Computer Science Logic, 8th International Workshop, CSL 94, Kazimierz, Poland, September 25-30, 1994, Selected Papers. Volume 933 of Lecture Notes in Computer Science, pages 151-162, Springer, 1994.

@inproceedings{PudlakB94,
  title = {How to Lie Without Being (Easily) Convicted and the Length of Proofs in Propositional Calculus},
  author = {Pavel Pudlák and Samuel R. Buss},
  year = {1994},
  researchr = {https://researchr.org/publication/PudlakB94},
  cites = {0},
  citedby = {0},
  pages = {151-162},
  booktitle = {Computer Science Logic, 8th International Workshop, CSL  94, Kazimierz, Poland, September 25-30, 1994, Selected Papers},
  editor = {Leszek Pacholski and Jerzy Tiuryn},
  volume = {933},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-60017-5},
}