Defining long words succinctly in FO and MSO

by   Lauri Hella, et al.

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. In addition, we consider the Löwenheim-Skolem and Hanf numbers of these logics on words and obtain similar bounds for these as well.


page 1

page 2

page 3

page 4


On the longest common subsequence of Thue-Morse words

The length a(n) of the longest common subsequence of the n'th Thue-Morse...

A Fixed-Depth Size-Hierarchy Theorem for AC^0[⊕] via the Coin Problem

We prove the first Fixed-depth Size-hierarchy Theorem for uniform AC^0[⊕...

New Bounds on Antipowers in Binary Words

Fici et al. defined a word to be a k-power if it is the concatenation of...

Upper Hessenberg and Toeplitz Bohemians

We look at Bohemians, specifically those with population {-1, 0, +1} and...

Homotopy height, grid-major height and graph-drawing height

It is well-known that both the pathwidth and the outer-planarity of a gr...

Asymptotic bounds for the number of closed and privileged words

A word w has a border u if u is a non-empty proper prefix and suffix of ...

Learning Formulas in Finite Variable Logics

We consider grammar-restricted exact learning of formulas and terms in f...