For any MSO formula over the infinite binary tree whose existential witness is well-founded, the minimal ordinal rank bound is either strictly below ω² or equal to ω1, and it is decidable which holds.
[Fon08] Ga¨ elle Fontaine
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A Dichotomy Theorem for Ordinal Ranks in MSO
For any MSO formula over the infinite binary tree whose existential witness is well-founded, the minimal ordinal rank bound is either strictly below ω² or equal to ω1, and it is decidable which holds.