An algebraic approach to MSO-definability on countable linear orderings

We develop an algebraic notion of recognizability for languages of words indexed by countable linear orderings. We prove that this notion is effectively equivalent to definability in monadic second-order (MSO) logic. We also provide three logical applications. First, we establish the first known col...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2018-05
Main Authors: Carton, Olivier, Colcombet, Thomas, Puppis, Gabriele
Format: Article
Language:English
Subjects:
Algebra
Collapse
Numbers
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We develop an algebraic notion of recognizability for languages of words indexed by countable linear orderings. We prove that this notion is effectively equivalent to definability in monadic second-order (MSO) logic. We also provide three logical applications. First, we establish the first known collapse result for the quantifier alternation of MSO logic over countable linear orderings. Second, we solve an open problem posed by Gurevich and Rabinovich, concerning the MSO-definability of sets of rational numbers using the reals in the background. Third, we establish the MSO-definability of the set of yields induced by an MSO-definable set of trees, confirming a conjecture posed by Bruy{è}re, Carton, and S{é}nizergues.
ISSN:2331-8422