## Languages That Capture Complexity Classes (1987)

Venue: | SIAM Journal of Computing |

Citations: | 229 - 21 self |

### BibTeX

@ARTICLE{Immerman87languagesthat,

author = {Neil Immerman},

title = {Languages That Capture Complexity Classes},

journal = {SIAM Journal of Computing},

year = {1987},

volume = {16},

pages = {760--778}

}

### Years of Citing Articles

### OpenURL

### Abstract

this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a property of graphs (respectively groups, binary strings, etc.) is in polynomial time if and only if it is expressible in the first order language of graphs (respectively groups, binary strings, etc.) together with a least fixed point operator. As another example, a property is in logspace if and only if it is expressible in first order logic together with a deterministic transitive closure operator. The roots of our approach to complexity theory go back to 1974 when Fagin showed that the NP properties are exactly those expressible in second order existential sentences. It follows that second order logic expresses exactly those properties which are in the polynomial time hierarchy. We show that adding suitable transitive closure operators to second order logic results in languages capturing polynomial space and exponential time, respectively. The existence of such natural languages for each important complexity class sheds a new light on complexity theory. These languages reaffirm the importance of the complexity classes as much more than machine dependent issues. Furthermore a whole new approach is suggested. Upper bounds (algorithms) can be produced by expressing the property of interest in one of our languages. Lower bounds may be demonstrated by showing that such expression is impossible.

### Citations

2438 |
The Design and Analysis of Computer Algorithms
- Aho, Hopcroft, et al.
- 1974
(Show Context)
Citation Context ...rties, including planarity for graphs of bounded valence, are in the symmetric logspace hierarchy. It follows that they are also in BPL. Reif also showed that BPL is contained in O[log n] time and n O=-=[1]-=- processors on a probabilistic hardware modification machine (HMM). b c a A Figure 1: An alternating graph with two universal nodes: a; c. Theorem 1.5 (Re84) . \SigmasSym-L ` BPL ` Prob-HMM-TIME[logn]... |

598 | A Mathematical Introduction to Logic - Enderton - 2002 |

530 | The complexity of relational query languages - Vardi - 1982 |

271 | Relational queries computable in polynomial time - Immerman - 1986 |

270 | Generalized first-order spectra and polynomial-time recognizable sets - Fagin - 1974 |

263 | The p olynomial-time hierarchy - Stockmeyer - 1977 |

244 | Structure and complexity of relational queries - Chandra, Harel - 1982 |

220 | Parity, circuits, and the polynomialtime hierarchy - Furst, Saxe, et al. - 1984 |

205 | Universality of data retrieval languages - Aho, Ullman - 1985 |

99 | Alternation - Chandra, Stockmeyer - 1981 |

73 | Borel sets and circuit complexity - Sipser - 1983 |

52 | Languages which capture complexity classes
- Immerman
- 1987
(Show Context)
Citation Context ...ce using the fixed point operator which cannot be expressed with a single application of transitive closure. SIAM J. of Computing 16:4 (1987), 760-778. A preliminary version of this paper appeared as =-=[17]-=-. y Research supported by an NSF postdoctoral fellowship. Current address: Computer Science Dept., UMass, Amherst, MA 01003. In previous work [Im81], [Im82b], we showed that the complexity of a proper... |

50 | A complexity theory based on boolean algebra - Skyum, Valiant - 1985 |

49 | The monotone and planar circuit value problems are logspace complete for P - Goldschlager - 1977 |

45 | Number of quantifiers is better than number of tape cells - Immerman - 1981 |

38 | Upper and lower bounds for first order expressibility - Immerman - 1982 |

32 | Complexity classes and theories of finite models - Lynch - 1982 |

28 | Symmetric complementation - Reif - 1984 |

22 | Maze recognizing automata and nondeterministic tape complexity - Savitch - 1973 |

13 | On the definability of properties of finite graphs - TurĂ¡n - 1984 |

11 | P 1 1 -formulae on finite structures", Annals of Pure and Applied logic 24 - Ajtai - 1983 |

10 | The Spectra of First-Order Sentences and Computational Complexity - Grandjean |

8 | Reducibility by algebraic projections," L'Enseignement math'ematique 28 - Valiant - 1982 |

6 | OneWay Log Tape Reductions - Hartmanis, Immerman, et al. - 1978 |

3 | Vishkin: "Constant depth reducibility - Chandra, Stockmeyer, et al. - 1984 |

2 | Symmetric Space Bounded Computation," Theoret - Lewis, Papadimitriou - 1982 |

2 | Some Remarks on Generalized Spectra," Zeitchr. f. math, Logik und Grundlagen d - Lov'asz, G'acs - 1977 |

2 | and Uzi Vishkin, "Simulation of Parallel Random Access Machines by Circuits - Stockmeyer - 1984 |

1 | Yao,"Separating the Polynomial-Time Hierarchy by Oracles - Chi-Chih - 1985 |