Definability by Constant-depth Polynomial-size Circuits

  • L. Denenberg ,
  • Yuri Gurevich ,
  • S. Shelah

Information and Control | , Vol 70: pp. 216-240

We investigate the expressive power of constant-depth polynomial-size circuit models. In particular, we construct a circuit model whose expressive power is precisely that of first-order logic.