A purely logical characterization of circuit uniformity

Utilizing the connection between uniform constant-depth circuits and first-order logic with numerical predicates, the author provides a purely logical characterization of uniformity based on the intrinsic properties of these predicates. By requiring a numerical predicate R to satisfy a natural extensibility condition-that it can be translated to a polynomially magnified domain based on tuple constructions-he shows that R must already be elementarily definable from < and bit (both of which satisfy the extensibility condition). The answer is motivated by, and coincides with, DLOGTIME uniformity.<<ETX>>

[1]  Neil Immerman,et al.  Expressibility and Parallel Complexity , 1989, SIAM J. Comput..

[2]  Michael Sipser,et al.  Borel sets and circuit complexity , 1983, STOC.

[3]  Neil Immerman,et al.  The complexity of iterated multiplication , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[4]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[5]  Walter L. Ruzzo.  On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..

[6]  Neil Immerman,et al.  On Uniformity within NC¹ , 1990, J. Comput. Syst. Sci..

[7]  Neil Immerman.  Nondeterministic Space is Closed Under Complementation , 1988, SIAM J. Comput..

[8]  Yuri Gurevich,et al.  A Logic for Constant-Depth Circuits , 1984, Inf. Control..

[9]  Steven Lindell.  The Invariant Problem for Binary String Structures and the Parallel Complexity Theory of Queries , 1992, J. Comput. Syst. Sci..

[10]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..