## Theories for Complexity Classes and their Propositional Translations (2004)

by
Stephen Cook

Venue: | Complexity of computations and proofs |

Citations: | 30 - 7 self |

### BibTeX

@INPROCEEDINGS{Cook04theoriesfor,

author = {Stephen Cook},

title = {Theories for Complexity Classes and their Propositional Translations},

booktitle = {Complexity of computations and proofs},

year = {2004},

pages = {175--227}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present in a uniform manner simple two-sorted theories corresponding to each of eight complexity classes between AC and P. We present simple translations between these theories and systems of the quanti ed propositional calculus.