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

Bulletin of Symbolic Logic 7 (4):525-527 (2001)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2687799

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,532

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

R. G. Downey and M. R. Fellows. Parameterized complexity. Monographs in computer science. Springer, New York, Berlin, and Heidelberg, 1999, xv + 533 pp. [REVIEW]Jörg Flum - 2002 - Bulletin of Symbolic Logic 8 (4):528-529.
Schöning Uwe. Complexity and structure. Lecture notes in computer science, vol. 211. Springer-Verlag, Berlin, Heidelberg, New York, and Tokyo, 1986, v + 99 pp. [REVIEW]Stephen R. Mahaney - 1989 - Journal of Symbolic Logic 54 (3):1106-1107.
Marker David. Model Theory: An Introduction. Graduate Texts in Mathematics, vol. 271. Springer Verlag, New York, Berlin and Heidelberg, 2002, 342 pp. [REVIEW]Bradd Hart - 2003 - Bulletin of Symbolic Logic 9 (3):408-409.
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. [REVIEW]Samuel Buss - 1989 - Journal of Symbolic Logic 54 (1):287-288.
Goldblatt Robert. Axiomatising the logic of computer programming. Lecture notes in computer science, vol. 130. Springer-Verlag, Berlin, Heidelberg, and New York, 1982, xi + 304 pp. [REVIEW]Mitchell Wand - 1985 - Journal of Symbolic Logic 50 (3):854-855.
Marker David, Introduction to the model theory of fields. Model theory of fields, Lecture notes in logic, no. 5, Springer, Berlin, Heidelberg, New York, etc., 1996, pp. 1–37.Marker David. Model theory of differential fields. Model theory of fields, Lecture notes in logic, no. 5, Springer, Berlin, Heidelberg, New York, etc., 1996, pp. 38–113.Pillay Anand. Differential algebraic groups and the number of countable differentially closed fields. Model theory of fields, Lecture notes in logic, no. 5, Springer, Berlin, Heidelberg, New York, etc., 1996, pp. 114–134.Messmer Margit. Some model theory of separably closed fields. Model theory of fields, Lecture notes in logic, no. 5, Springer, Berlin, Heidelberg, New York, etc., 1996, pp. 135–152. [REVIEW]Zoé Chatzidakis - 1998 - Journal of Symbolic Logic 63 (2):746-747.
Harel David. First-order dynamic logic. Lecture notes in computer science, vol. 68. Springer-Verlag, Berlin, Heidelberg, and New York, 1979, X + 133 pp. [REVIEW]Jerzy Tiuryn - 1982 - Journal of Symbolic Logic 47 (2):453-454.
Greibach Sheila A.. Theory of program structures: schemes, semantics, verification. Lecture notes in computer science, vol. 36. Springer-Verlag, Berlin, Heidelberg, and New York, 1975, xv + 364 pp. [REVIEW]Robert L. Constable - 1978 - Journal of Symbolic Logic 43 (1):154-156.
Felgner Ulrich. Models of ZF-set theory. Lecture notes in mathematics, no. 223, Springer-Verlag, Berlin, Heidelberg, and New York, 1971, vi + 173 pp.Jech Thomas J.. Lectures in set theory with particular emphasis on the method of forcing. Lecture notes in mathematics, no. 217, Springer-Verlag, Berlin, Heidelberg, and New York, 1971, v + 137 pp. [REVIEW]Frank R. Drake - 1975 - Journal of Symbolic Logic 40 (1):92-93.
Descriptive Complexity.Steven Lindell - 2001 - Bulletin of Symbolic Logic 7 (4):525-527.
Wolfgang Pauli: Wissenschaftlicher Briefwechsel mit Bohr, Einstein, Heisenberg u.a. Herausgegeben von Karl von Meÿenn (Band IV, Teil I: 1950–1952; Teil II: 1953‐1954). Berlin/Heidelberg/New York: Springer 1996 und 1999; 968 und 1100 Seiten. [REVIEW]Werner Eisner - 2000 - Berichte Zur Wissenschaftsgeschichte 23 (1):59-62.
Devlin Keith. The joy of sets. Fundamentals of contemporary set theory. Second edition of XLVI419. Undergraduate texts in mathematics. Springer-Verlag, New York, Berlin, Heidelberg, etc., 1993, x + 192 pp. [REVIEW]H. B. Enderton - 1994 - Journal of Symbolic Logic 59 (4):1441-1442.
Ferrante Jeanne and Rackoff Charles W.. The computational complexity of logical theories. Lecture notes in mathematics, vol. 718. Springer-Verlag, Berlin, Heidelberg, and New York, 1979, X + 243 pp. [REVIEW]Dirk Siefkes - 1984 - Journal of Symbolic Logic 49 (2):670-671.
Miller Arnold W.. Descriptive set theory and forcing. How to prove theorems about Borel sets the hard way. Lecture notes in logic, no. 4. Springer, Berlin, Heidelberg, New York, etc., 1995, ii + 130 pp. [REVIEW]Tomek Bartoszyński - 1997 - Journal of Symbolic Logic 62 (1):320-321.
Fitting Melvin. First-order logic and automated theorem proving. Texts and monographs in computer science. Springer-Verlag, New York, Berlin, etc., 1990, xv + 242 pp. [REVIEW]Alfredo Ferro - 1993 - Journal of Symbolic Logic 58 (2):719-719.

Analytics

Added to PP
2019-05-08

Downloads
11 (#1,129,983)

6 months
5 (#627,653)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references