Abstract

The computational complexity of a problem is usually defined in terms of the resources required on some machine model of computation. An alternative view looks at the complexity of describing the problem (seen as a collection of relational structures) in a logic, measuring logical resources such as the number of variables, quantifiers, operators, etc. A close correspondence has been observed between these two, with many natural logics corresponding exactly to independently defined complexity classes. For the complexity classes that are generally identified with feasible computation, such characterizations require the presence of a linear order on the domain of every structure, in which case the class PTIME is characterized by an extension of first-order logic by means of an inductive operator. No logical characterization of feasible computation is known for unordered structures. We approach this question from two directions. On the one hand, we seek to accurately characterize the expre...

Citations

3377	Introduction to Automata Theory Languages and Computation. 2nd edition. Addison-Wesley Publishing Company, 2000. de - Hopcroft, Ullman - 2004
1493	Random Graphs - Bollobas - 2001
539	A Mathematical Introduction to Logic - Enderton - 1972
485	The Complexity of Relational Query Languages - Vardi - 1982
254	Relational queries computable in polynomial time - Immerman - 1986
242	Generalized first-order spectra and polynomial-time recognizable sets - Fagin - 1974
236	The polynomial-time hierarchy - Stockmeyer - 1977
233	Structure and complexity of relational queries - Chandra, Harel - 1982
212	Languages that capture complexity classes - Immerman
166	On the computational complexity of algorithms - Hartmanis, Stearns - 1965
154	Elemantary Induction on Abstract Structures - Moschovakis - 1974
149	Logic and the challenge of computer science - Gurevich - 1988
146	Applications of games to the completeness problem for formalized theories - Ehrenfeucht - 1961
138	Datalog extensions for database queries and updates - Abiteboul, Vianu
119	An Optimal Lower Bound on the Number of Variables for Graph Identi cation - Cai, Furer, et al. - 1989
111	Generic computation and its complexity', in - Abiteboul, Vianu - 1991
87	The monadic theory of order - Shelah - 1975
78	S.: Fixed-Point Extensions of First-Order Logic - Gurevich, Shelah - 1986
70	Definability With Bounded Number of Bound Variables - Immerman, Kozen - 1987
69	Sur quelques classifications des systemes de relations - Frai’sse - 1954
69	Toward logic tailored for computational complexity - Gurevich - 1984
69	First order predicate logics with generalized quantifiers. Theoria 35:186–195 - Lindström - 1966
62	On Moschovakis closure ordinals - Barwise
53	Describing graphs: a first-order approach to graph canonization - Immerman, Lander - 1990
48	Descriptive and computational complexity - Immerman - 1989
46	Logical hierarchies in PTIME - Hella - 1996
45	Upper and lower bounds for first-order expressibility - Immerman - 1982
42	Infinitary logic and 0-1 laws - Kolaitis, Vardi
40	The Complexity of Iterated Multiplication - Immerman, Landau - 1995
33	Fixpoint logics, relational machines, and computational complexity - Abiteboul, Vardi - 1997
32	Fixpoint logic vs. infinitary logic in finite-model theory - Kolaitis, Vardi - 1992
31	Extended logics: The general framework - Ebbinghaus - 1985
28	Logic with denumerably long formulas and finite strings of quantifiers - Scott - 1965
27	Modest theory of short chains - Gurevich, Shelah - 1979
17	Definability hierarchies of generalized quantifiers - Hella - 1989
15	Equivalence relations, invariants, and normal forms - Blass, Gurevich - 1984
13	and forth through infinitary logic - Barwise, Back - 1973
13	A decision procedure for the weak second order theory of linear order - Lauchli - 1968
13	Inductive definitions over finite structures - Leivant - 1989
10	Using the Hamiltonian path operator to capture np - Stewart - 1992
9	An analysis of fixed-point queries on binary trees - Lindell - 1991
8	Deux ou trois choses que je sais de L n - Poizat
7	Axiomatizable Classes of Finite Models and Definability of Linear Order - Stolboushkin - 1992
6	Some Remarks on generalized Spectra, Zeitschrift f"ur mathematische Logik und Grundlagen der Mathematik 23 - G'acs, Lov'asz - 1977
6	When is arithmetic possible - McColm - 1990
4	The Logical Complexity of Queries on Unordered Graphs - Lindell - 1987
4	Free Algebras in Von Neumann-Bernays-Godel Set Theory and Positive Elementary Inductions in Reasonable Structures - Rubin - 1975
3	Finite quantifier equivalence - Karp - 1965
2	Computing with first-order logic. to appear - Abiteboul, Vianu - 1992
1	Containment, seperation, complete sets, and immunity of complexity classes - Hartmanis, Li, et al. - 1986