## Feasible Computation through Model Theory (1993)

Citations: | 35 - 7 self |

### BibTeX

@MISC{Dawar93feasiblecomputation,

author = {Anuj Dawar},

title = {Feasible Computation through Model Theory},

year = {1993}

}

### Years of Citing Articles

### OpenURL

### 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...