Counting and addition cannot express deterministic transitive closure

An important open question in complexity theory is whether the circuit complexity class TC/sup 0/ is (strictly) weaker than LOGSPACE. This paper considers this question from the viewpoint of descriptive complexity theory. TC/sup 0/ can be characterized as the class of queries expressible by the logic FOC(<, +, /spl times/), which is first-order logic augmented by counting quantifiers on ordered structures that have addition and multiplication predicates. We show that in first-order logic with counting quantifiers and only an addition predicate it is not possible to express "deterministic transitive closure" on ordered structures. As this is a LOGSPACE-complete problem, this logic therefore fails to capture LOGSPACE. It also directly follows from our proof that in the presence of counting quantifiers, multiplication cannot be expressed in terms of addition and ordering alone.

[1]  P. Dedecker.  Review: Roland Fraisse, Sur Quelques Classifications des Systemes de Relations , 1957 .

[2]  Juha Nurmonen,et al.  On Winning Strategies with Unary Quantifiers , 1996, J. Log. Comput..

[3]  H. Jerome Keisler,et al.  Expressive Power of Unary Counters , 1997, ICDT.

[4]  Neil Immerman,et al.  Relational Queries Computable in Polynomial Time , 1986, Inf. Control..

[5]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[6]  Leonid Libkin.  On the forms of locality over finite models , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[7]  Kousha Etessami,et al.  Counting quantifiers, successor relations, and logarithmic space , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[8]  Jörg Flum,et al.  Mathematical logic , 1985, Undergraduate texts in mathematics.

[9]  Jörg Flum,et al.  Finite model theory , 1995, Perspectives in Mathematical Logic.

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

[11]  Limsoon Wong,et al.  Unary Quantifiers, Transitive Closure, and Relations of Large Degree , 1998, STACS.

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

[13]  S. Abiteboul,et al.  Fixpoint extensions of first-order logic and datalog-like languages , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[14]  Neil Immerman,et al.  Expressibility as a complexity measure: results and directions , 1987, SCT.

[15]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[16]  N. Immerman,et al.  On uniformity within NC 1 . , 1988 .

[17]  Eric Allender,et al.  Circuit Complexity before the Dawn of the New Millennium , 1996, FSTTCS.

[18]  Neil Immerman,et al.  Descriptive and Computational Complexity , 1989, FCT.

[19]  Leonid Libkin,et al.  On counting logics and local properties , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[20]  A. Ehrenfeucht.  An application of games to the completeness problem for formalized theories , 1961 .

[21]  Wilfrid Hodges,et al.  Model Theory: The existential case , 1993 .

[22]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[23]  James F. Lynch,et al.  On sets of relations definable by addition , 1982, Journal of Symbolic Logic.

[24]  Yuri Gurevich,et al.  Metafinite Model Theory , 1994, LCC.