A P-Time Completeness Proof for Light Logics

Luca Roversi. A P-Time Completeness Proof for Light Logics. In Jörg Flum, Mario Rodríguez-Artalejo, editors, Computer Science Logic, 13th International Workshop, CSL 99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings. Volume 1683 of Lecture Notes in Computer Science, pages 469-483, Springer, 1999.

@inproceedings{Roversi99,
  title = {A P-Time Completeness Proof for Light Logics},
  author = {Luca Roversi},
  year = {1999},
  tags = {completeness, logic},
  researchr = {https://researchr.org/publication/Roversi99},
  cites = {0},
  citedby = {0},
  pages = {469-483},
  booktitle = {Computer Science Logic, 13th International Workshop, CSL  99, 8th Annual Conference of the EACSL, Madrid, Spain, September 20-25, 1999, Proceedings},
  editor = {Jörg Flum and Mario Rodríguez-Artalejo},
  volume = {1683},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-66536-6},
}