Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T12:10:13.114Z Has data issue: false hasContentIssue false

AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS

Published online by Cambridge University Press:  23 October 2018

OLIVIER CARTON
Affiliation:
INSTITUT DE RECHERCHE EN INFORMATIQUE FONDAMENTALE (IRIF) UNIVERSITÉ PARIS DIDEROT PARIS, FRANCE E-mail: olivier.carton@irif.fr
THOMAS COLCOMBET
Affiliation:
CNRS / INSTITUT DE RECHERCHE EN INFORMATIQUE FONDAMENTALE (IRIF) UNIVERSITÉ PARIS DIDEROT PARIS, FRANCE E-mail: thomas.colcombet@irif.fr
GABRIELE PUPPIS
Affiliation:
CNRS / LABORATOIRE BORDELAIS DE RECHERCHE EN INFORMATIQUE (LABRI) UNIVERSITÉ BORDEAUX BORDEAUX, FRANCE E-mail: gabriele.puppis@labri.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2018