Forcing MSO on Infinite Words in Weak MSO - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Forcing MSO on Infinite Words in Weak MSO

Résumé

We propose a forcing-based interpretation of monadic second-order logic (MSO) on infinite (omega) words in Weak MSO (WMSO). The interpretation is purely syntactic. We show that a formula with parameters is true in MSO if and only if its interpretation is true in WMSO. We also show that a closed formula is true in MSO if and only if its interpretation is provable under some axioms which hold for WMSO, but without axiomatizing it. We use model-theoretic arguments. Our approach is inspired from point-free topology: infinite words, seen as topological points, are approximated by filters of bounded segments. We devise forcing conditions such that the corresponding generic filters approximate Ramseyan factorizations of infinite words modulo satisfaction of formulas of a given quantifier depth.
Fichier principal
Vignette du fichier
forcing-mso.pdf (410.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00776921 , version 1 (16-01-2013)
hal-00776921 , version 2 (30-07-2013)

Identifiants

Citer

Colin Riba. Forcing MSO on Infinite Words in Weak MSO. 28th Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2013, New Orleans, United States. pp.448-457, ⟨10.1109/LICS.2013.51⟩. ⟨hal-00776921v2⟩
146 Consultations
213 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More