The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Languages that Capture Complexity Classes
Abstract
We present a series of operators of apparently increasing power which when added to first-order logic produce a series of languages in which exactly the properties checkable in a certain complexity class may be expressed. We thus give alternate characterizations of most important complexity classes. We also introduce reductions appropriate for our setting: first-order translations, and a restricted, quantifier free version of these called projection translations. We show that projection translations are a uniform version of Valiant’s projections, and that the usual complete problems remain complete via these very restrictive reductions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Introduction to Logic
(2001) · Elsevier eBooks · doi:10.1016/c2009-0-22107-6 · Cited by 2,387
Stockmeyer, L. J. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90061-x · Cited by 1,293
Chandra, A. K., Kozen, D. C., & Stockmeyer, L. J. (1981) · Journal of the ACM · doi:10.1145/322234.322243 · Cited by 1,221
Random walks, universal traversal sequences, and the complexity of maze problems
Aleliunas, R., Karp, R. M., Lipton, R. J., Lovasz, L., & Rackoff, C. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.34 · Cited by 692
∑11-Formulae on finite structures
Ajtai, M. (1983) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(83)90038-6 · Cited by 585
Chandra, A. K., Stockmeyer, L. J., & Vishkin, U. (1984) · SIAM Journal on Computing · doi:10.1137/0213028 · Cited by 311
Upper and lower bounds for first order expressibility
Immerman, N. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90011-3 · Cited by 263
Self-citationNumber of quantifiers is better than number of tape cells
Immerman, N. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90039-8 · Cited by 174
Self-citationSymmetric space-bounded computation
Lewis, H. R., & Papadimitriou, C. H. (1982) · Theoretical Computer Science · doi:10.1016/0304-3975(82)90058-5 · Cited by 171
A complexity theory based on Boolean algebra
Skyum, S., & Valiant, L. G. (1985) · Journal of the ACM · doi:10.1145/3149.3158 · Cited by 103
Cited by
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
An optimal lower bound on the number of variables for graph identification
Cai, J.-Y., F�rer, M., & Immerman, N. (1992) · Combinatorica · doi:10.1007/bf01305232 · Cited by 502
Self-citationElements of Relational Database Theory
KANELLAKIS, P. C. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50022-6 · Cited by 259
Datalog extensions for database queries and updates
Abiteboul, S., & Vianu, V. (1991) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(91)90032-z · Cited by 256
Metadata
- Authors
- Immerman, N.
- Venue
- SIAM Journal on Computing
- Published
- 1987-08
- Volume
- 16
- Issue
- 4
- Pages
- 760-778
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W1970629906
- Cited by
- 546
- References
- 14
- FWCI
- 11.77
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Languages that Capture Complexity Classes. https://app.cochat.ai/papers/10.1137/0216051
- The paper
- Immerman, N. (1987). Languages that Capture Complexity Classes. SIAM Journal on Computing. https://doi.org/10.1137/0216051
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.