First-order and counting theories of ω-automatic structures

Abstract The logic extends first-order logic by a generalized form of counting quantifiers (“the number of elements satisfying … belongs to the set C”). This logic is investigated for structures with an injectively ω-automatic presentation. If first-order logic is extended by an infinity-quantifier, the resulting theory of any such structure is known to be decidable [6]. It is shown that, as in the case of automatic structures [21], also modulo-counting quantifiers as well as infinite cardinality quantifiers (“there are many elements satisfying …”) lead to decidable theories. For a structure of bounded degree with injective ω-automatic presentation, the fragment of that contains only effective quantifiers is shown to be decidable and an elementary algorithm for this decision is presented. Both assumptions (ω-automaticity and bounded degree) are necessary for this result to hold.

[1]  J. Büchi.  Weak Second‐Order Arithmetic and Finite Automata , 1960 .

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

[3]  Albert R. Meyer,et al.  Word problems requiring exponential time(Preliminary Report) , 1973, STOC.

[4]  Yaacov Choueka,et al.  Theories of Automata on omega-Tapes: A Simplified Approach , 1974, J. Comput. Syst. Sci..

[5]  R. Lindner,et al.  Algebraische Codierungstheorie , 1977 .

[6]  Bernard R. Hodgson.  On Direct Products of Automaton Decidable Theories , 1982, Theor. Comput. Sci..

[7]  C. Ward Henson,et al.  A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories , 1990, Ann. Pure Appl. Log..

[8]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[9]  David B. A. Epstein,et al.  Word processing in groups , 1992 .

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

[11]  Anil Nerode,et al.  Automatic Presentations of Structures , 1994, LCC.

[12]  Alexis Bès.  Undecidable Extensions of Büchi Arithmetic and Cobham-Semënov Theorem , 1997, J. Symb. Log..

[13]  M. Lothaire.  Combinatorics on words: Bibliography , 1997 .

[14]  Achim Blumensath,et al.  Automatic structures , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[15]  Thomas Schwentick,et al.  A model-theoretic approach to regular string relations , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[16]  Sasha Rubin,et al.  Graphs with Automatic Presentations over a Unary Alphabet , 2001, J. Autom. Lang. Comb..

[17]  Sasha Rubin,et al.  Some results on automatic structures , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[18]  Automatic Structures of Bounded Degree , 2003, LPAR.

[19]  Sasha Rubin,et al.  On automatic partial orders , 2003, 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings..

[20]  Thomas Schwentick,et al.  Definable relations and first-order query languages over strings , 2003, JACM.

[21]  Dietrich Kuske,et al.  Is Cantor's Theorem Automatic? , 2003, LPAR.

[22]  Achim Blumensath,et al.  Finite Presentations of Infinite Structures: Automata and Interpretations , 2004, Theory of Computing Systems.

[23]  Frank Stephan,et al.  Definability and Regularity in Automatic Structures , 2004, STACS.

[24]  M. Lothaire.  Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications) , 2005 .

[25]  H. Jerome Keisler,et al.  A local normal form theorem for infinitary logic with unary quantifiers , 2005, Math. Log. Q..

[26]  Yunfeng Tao.  Infinity problems and countability problems for omega-automata , 2006, Inf. Process. Lett..

[27]  Vince Bárány,et al.  Automatic presentations of infinite structures , 2007 .

[28]  Markus Lohrey,et al.  First-order and counting theories of omega-automatic structures , 2006, J. Symb. Log..

[29]  Greg Hjorth,et al.  From Automatic Structures to Borel Structures , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.