The Pseudofinite Monadic Second Order Theory of Linear Order
Logic
2021-05-27 v1 Formal Languages and Automata Theory
Logic in Computer Science
Abstract
Monadic second order logic is the expansion of first order logic by quantifiers ranging over unary relations. We study the shared monadic second order theory of finite linear orders, i.e. the pseudofinite monadic second order theory of linear order, using a first order setup . We give explicit (and recursive) axioms and characterise the completions in terms of residue sequences. A connection with profinite algebra, in particular with the free profinite monoid on one generator, is established via extended Stone duality.
Cite
@article{arxiv.2105.12185,
title = {The Pseudofinite Monadic Second Order Theory of Linear Order},
author = {Deacon Linkhorn},
journal= {arXiv preprint arXiv:2105.12185},
year = {2021}
}