Definability by constant-depth polynomial-size circuits

Larry Denenberg*, Yuri Gurevich, Saharon Shelah

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

41 Scopus citations

Abstract

A function of boolean arguments is symmetric if its value depends solely on the number of 1's among its arguments. In the first part of this paper we partially characterize those symmetric functions that can be computed by constant-depth polynomial-size sequences of boolean circuits, and discuss the complete characterization. (We treat both uniform and non-uniform sequences of circuits.) Our results imply that these circuits can compute functions that are not definable in first-order logic. In the second part of the paper we generalize from circuits computing symmetric functions to circuits recognizing first-order structures. By imposing fairly natural restrictions we develop a circuit model with precisely the power of first-order logic: a class of structures is first-order definable if and only if it can be recognized by a constant-depth polynomial-time sequence of such circuits.

Original languageEnglish
Pages (from-to)216-240
Number of pages25
JournalInformation and control
Volume70
Issue number2-3
DOIs
StatePublished - 1986

Fingerprint

Dive into the research topics of 'Definability by constant-depth polynomial-size circuits'. Together they form a unique fingerprint.

Cite this