An optimal construction of Hanf sentences

We give the first elementary construction of equivalent formulas in Hanf normal form. The triply exponential upper bound is complemented by a matching lower bound.

[1]  Markus Lohrey,et al.  Automatic structures of bounded degree revisited , 2011, J. Symb. Log..

[2]  D. Kuske,et al.  First-order and counting theories of ω-automatic structures , 2008, Journal of Symbolic Logic.

[3]  Detlef Seese,et al.  Linear time computable problems and first-order descriptions , 1996, Mathematical Structures in Computer Science.

[4]  W. Hanf.  MODEL-THEORETIC METHODS IN THE STUDY OF ELEMENTARY LOGIC , 2014 .

[5]  Paul Gastin,et al.  Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces , 2010, Inf. Comput..

[6]  Paul Gastin,et al.  Uniform Satisfiability in PSPACE for Local Temporal Logics Over Mazurkiewicz Traces , 2007, Fundam. Informaticae.

[7]  Martin Grohe,et al.  Deciding first-order properties of locally tree-decomposable structures , 2000, JACM.

[8]  Arnaud Durand,et al.  First-order queries on structures of bounded degree are computable with constant delay , 2005, TOCL.

[9]  Thomas Schwentick,et al.  Local Normal Forms for First-Order Logic with Applications to Games and Automata , 1998, Discret. Math. Theor. Comput. Sci..

[10]  A. Tarski.  Contributions to the theory of models. III , 1954 .

[11]  Leonid Libkin,et al.  Elements of Finite Model Theory , 2004, Texts in Theoretical Computer Science.

[12]  Benedikt Bollig,et al.  Muller message-passing automata and logics , 2008, Inf. Comput..

[13]  Martin Grohe,et al.  The complexity of first-order and monadic second-order logic revisited , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[14]  Markus Lohrey,et al.  Decidable First-Order Theories of One-Step Rewriting in Trace Monoids , 2004, Theory of Computing Systems.

[15]  Moshe Y. Vardi,et al.  On Monadic NP vs. Monadic co-NP (Extended Abstract) , 1993, SCT.

[16]  Benedikt Bollig,et al.  Message-passing automata are expressively equivalent to EMSO logic , 2006, Theor. Comput. Sci..

[17]  Antonio Restivo,et al.  Monadic Second-Order Logic Over Rectangular Pictures and Recognizability by Tiling Systems , 1996, Inf. Comput..

[18]  Y. Gurevich.  On Finite Model Theory , 1990 .

[19]  Jean-Louis Krivine,et al.  Realizability algebras: a program to well order R , 2010, Log. Methods Comput. Sci..

[20]  Leonid Libkin,et al.  Logics with counting and local properties , 2000, TOCL.

[21]  Stephan Kreutzer,et al.  Approximation Schemes for First-Order Definable Optimisation Problems , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[22]  Ronald Fagin,et al.  On Monadic NP vs. Monadic co-NP , 1995, Inf. Comput..

[23]  Ludwig Staiger,et al.  Ω-languages , 1997 .

[24]  Steven Lindell.  A Normal Form for First-Order Logic over Doubly-Linked Data Structures , 2008, Int. J. Found. Comput. Sci..

[25]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[26]  Ross Willard.  Hereditary Undecidability of Some Theories of Finite Structures , 1994, J. Symb. Log..

[27]  Benedikt Bollig,et al.  Distributed Muller Automata and Logics , 2006 .

[28]  Jerzy Łoś,et al.  On the extending of models (IV) , 1955 .

[29]  Stephan Kreutzer,et al.  Model Theory Makes Formulas Large , 2007, ICALP.

[30]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[31]  Nivat G. Päun,et al.  Handbook of Formal Languages , 2013, Springer Berlin Heidelberg.

[32]  Luc Segoufin,et al.  First-order query evaluation on structures of bounded degree , 2011, Log. Methods Comput. Sci..