@inproceedings{86b2b0a0ccad49c8ba145515bff8a8ec,

title = "Defining Long Words Succinctly in FO and MSO",

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

author = "Lauri Hella and Miikka Vilander",

note = "JUFOID=62555; Conference on Computability in Europe ; Conference date: 11-07-2022 Through 15-07-2022",

year = "2022",

doi = "10.1007/978-3-031-08740-0_11",

language = "English",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "125--138",

editor = "Ulrich Berger and Franklin, {Johanna N.Y.} and Florin Manea and Arno Pauly",

booktitle = "Revolutions and Revelations in Computability",

}