Sergei G. Vorobyov. An Improved Lower Bound for the Elementary Theories of Trees. In Michael A. McRobbie, John K. Slaney, editors, Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30 - August 3, 1996, Proceedings. Volume 1104 of Lecture Notes in Computer Science, pages 275-287, Springer, 1996.
@inproceedings{Vorobyov96:0, title = {An Improved Lower Bound for the Elementary Theories of Trees}, author = {Sergei G. Vorobyov}, year = {1996}, researchr = {https://researchr.org/publication/Vorobyov96%3A0}, cites = {0}, citedby = {0}, pages = {275-287}, booktitle = {Automated Deduction - CADE-13, 13th International Conference on Automated Deduction, New Brunswick, NJ, USA, July 30 - August 3, 1996, Proceedings}, editor = {Michael A. McRobbie and John K. Slaney}, volume = {1104}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {3-540-61511-3}, }