Affiliation:
1. Computing Sciences, Tampere University, Finland
Abstract
We consider the length of the longest word definable in FO and MSO via a formula of size n. For both logics we obtain as an upper bound for this number an exponential tower of height linear in n. We prove this by counting types with respect to a fixed quantifier rank. As lower bounds we obtain for both FO and MSO an exponential tower of height in the order of a rational power of n. We show these lower bounds by giving concrete formulas defining word representations of levels of the cumulative hierarchy of sets. For the two-variable fragment of FO we obtain quadratic lower and upper bounds for the definability numbers of quantifier rank k fragments. In addition, we consider the Löwenheim–Skolem and Hanf numbers of these logics on words and obtain similar bounds for these as well.
Reference16 articles.
1. H. Ebbinghaus and J. Flum, Finite Model Theory, 2nd edn, Perspectives in Mathematical Logic, Springer, 1995. ISBN 978-3-540-60149-4.
2. H.-D. Ebbinghaus, Löwenheim–Skolem theorems, in: Philosophy of Logic, D.M. Gabbay, P. Thagard, J. Woods and D. Jacquette, eds, Handbook of the Philosophy of Science, Elsevier Science, 2006. ISBN 9780080466637.
3. Regular expressions: New results and open problems;Ellul;J. Autom. Lang. Comb.,2005
4. First-order logic with two variables and unary temporal logic;Etessami;Inf. Comput.,2002
5. Some remarks on finite Löwenheim–Skolem theorems;Grohe;Math. Log. Q.,1996