The Complexity of Resource-Bounded First-Order Classical Logic

Jean Goubault. The Complexity of Resource-Bounded First-Order Classical Logic. In Patrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner, editors, STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings. Volume 775 of Lecture Notes in Computer Science, pages 59-70, Springer, 1994.

@inproceedings{Goubault94:1,
  title = {The Complexity of Resource-Bounded First-Order Classical Logic},
  author = {Jean Goubault},
  year = {1994},
  tags = {logic},
  researchr = {https://researchr.org/publication/Goubault94%3A1},
  cites = {0},
  citedby = {0},
  pages = {59-70},
  booktitle = {STACS 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings},
  editor = {Patrice Enjalbert and Ernst W. Mayr and Klaus W. Wagner},
  volume = {775},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-57785-8},
}