Journal of Symbolic Logic

Review: Neil Immerman, Upper and Lower Bounds for First Order Expressibility; Neil Immerman, Relational Queries Computable in Polynomial Time; Neil Immerman, Languages that Capture Complexity Classes

Samuel Buss

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Article information

Source
J. Symbolic Logic, Volume 54, Issue 1 (1989), 287-288.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1183742870

JSTOR
links.jstor.org

Citation

Buss, Samuel. Review: Neil Immerman, Upper and Lower Bounds for First Order Expressibility ; Neil Immerman, Relational Queries Computable in Polynomial Time ; Neil Immerman, Languages that Capture Complexity Classes. J. Symbolic Logic 54 (1989), no. 1, 287--288. https://projecteuclid.org/euclid.jsl/1183742870


Export citation