Defining long words succinctly in FO and MSO

DOI10.1007/978-3-031-08740-0_11OpenAlexW4285212347MaRDI QIDQ2104260

Lauri Hella, Miikka Vilander

Publication date: 7 December 2022

Full work available at URL: https://arxiv.org/abs/2202.10180

zbMATH Keywords

monadic second-order logicsuccinctnesslogic on words

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Defining long words succinctly in FO and MSO

Cites Work

• Unnamed Item
• Unnamed Item
• Elements of finite model theory.
• Defining long words succinctly in FO and MSO
• Succinct definitions in the first order theory of graphs
• Large finite structures with few \(L^k\)-types
• Logical complexity of graphs: a survey
• The Complexity of Translating Logic to Finite Automata
• Some Remarks on Finite Löwenheim‐Skolem Theorems
• Descriptive complexity of finite structures: Saving the quantifier rank

This page was built for publication: Defining long words succinctly in FO and MSO