Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2024-12-25T02:56:54.828Z Has data issue: false hasContentIssue false
  • English
  • Français

Neil Immerman. Descriptive complexity. Graduate texts in computer science. Springer, New York, Berlin, and Heidelberg, 1999, xvi + 268 pp.

Published online by Cambridge University Press:  15 January 2014

Steven Lindell
Steven Lindell*
Affiliation:
Department of Computer Science, Haverford College, Haverford, PA 19041, USA. [email protected].
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Reviews
Information
Bulletin of Symbolic Logic , Volume 7 , Issue 4 , December 2001 , pp. 525 - 527
Copyright
Copyright © Association for Symbolic Logic 2001

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)