The Borel monadic theory of order is decidable

The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_σ$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof extends to larger classes of sets.

💡 Research Summary

The paper investigates the monadic second‑order theory of the ordered real line ((\mathbb R,\le)) when the monadic quantifiers are restricted to Borel sets. It proves that this “Borel monadic theory of order” is decidable, and that the Boolean algebra generated by (F_\sigma) sets forms an elementary substructure of the full Borel algebra. The work builds on earlier results: Rabin’s decidability of S2S (the monadic theory of two successors) and the consequent decidability of the monadic theory of ((\mathbb R,\le)) with quantification over (F_\sigma) sets. The open question—whether the same holds when (F_\sigma) is replaced by all Borel sets—is answered affirmatively.

The technical core adapts Shelah’s method (originally developed for the unrestricted monadic theory) to the Borel setting, employing the Baire category theorem as a key tool. The authors introduce the notion of a k‑uniform tuple of sets: a finite collection ((X_1,\dots,X_m)) of Borel subsets of (\mathbb R) is k‑uniform if, for any two open intervals ((a,b)) and ((c,d)), the truth values of all monadic formulas with at most k quantifiers are the same when interpreted over ((a,b)) and ((c,d)) with the same parameters. By a Ramsey‑type argument, every tuple becomes k‑uniform on some open interval; the complement of the maximal uniform region is either empty or a Cantor set. Consequently, the theory of the whole line reduces to the theory of a Cantor set together with a uniform “background” type.

Two kinds of restricted quantifiers are identified:

1. Quantification over all sets that preserve uniformity (first‑kind quantifiers).
2. Quantification over Cantor sets on which the parameters remain uniform (second‑kind quantifiers).

The first kind can often be eliminated or reduced to the second. The second kind is more delicate; its handling relies on Baire category arguments. A set is either meager or comeager on some open interval, and a k‑uniform set is either everywhere meager or everywhere comeager. Meager sets can be covered by countable unions of Cantor sets, and the monadic type of a tuple of meager sets is determined by the types of these Cantor components, which are independent of each other.

The decision procedure proceeds in two phases. In the first phase a “coarse” type (cTh_n) is defined, where only second‑kind quantifiers appear and the number (n) records quantifier alternations. The authors compute the finite set of realizable coarse types for uniform tuples (Corollary 5.31). They show that every coarse type arises from a finite iteration of a construction called a uniform sum: starting from a Cantor set (C), one repeatedly embeds copies of (C) into the complementary intervals, producing a highly regular meager union. This yields an explicit combinatorial description of all possible coarse types.

In the second phase the coarse type is refined back to the original fine type (Th_k). If sufficiently complicated Cantor subsets exist, the refinement is straightforward. Otherwise the real line can be decomposed into a Boolean combination of a bounded number of (F_\sigma) sets; each component can be analyzed separately. This dichotomy is justified by the determinacy of a “separation game”, a generalized Wadge game (Section 6.2). Determinacy guarantees that the game has a winning strategy for one of the players, which translates into an effective procedure for deciding the remaining cases.

A central conceptual contribution is the definition of sufficiently stable Boolean algebras. A family ((B_X){X\subseteq\mathbb R\text{ G}\delta}) of Boolean subalgebras of (\mathcal P(X)) is sufficiently stable if it is generated by a family (A_X) that is closed under homeomorphisms, Gδ‑intersections, and countable local decompositions. The Borel algebra is sufficiently stable (with (A_X) the Borel subsets of (X)), as are the Boolean algebras generated by (F_\sigma) sets, by (\Sigma^0_\alpha) for (\alpha\ge2), by (\Delta^0_\alpha) for (\alpha\ge3), by (\Sigma^1_n) for (n\ge1), by (\Delta^1_n), and by the projective sets. Theorem 1.2 shows that for any sufficiently stable algebras (B\subseteq C) with every subset of (2^{\mathbb N}) in (C) determined, the monadic theory restricted to (B) is decidable and the embedding (B\hookrightarrow C) is elementary. Consequently, under appropriate determinacy hypotheses, the decidability result extends from Borel sets to all these larger classes.

The paper also discusses the limits of these methods. It conjectures (Conjecture 1.8) that the Baire property alone (without full determinacy) might suffice for the same conclusions, which would lower the large‑cardinal strength needed. Evidence is provided: the only place determinacy is used is in the separation game; the Baire property yields the perfect set property, which fails for (\sigma(\Sigma^1_1)) in some models, suggesting the conjecture may be false for certain analytic extensions. Moreover, for the structure ((2^{\le\omega},\le_{\text{lex}},\text{prefix})) the analogous conjecture fails, as a formula equivalent to determinacy for a Borel set is true in the Borel monadic theory but false for Boolean combinations of analytic sets under (V=L).

Finally, the authors note that the unrestricted monadic theory of ((\mathbb R,\le)) is undecidable (proved via reductions to first‑order arithmetic and third‑order arithmetic in forcing extensions). The undecidability persists in ZFC and even in ZF+DC, unless large cardinals or determinacy are assumed.

In summary, the paper establishes the decidability of the Borel monadic theory of order, provides a robust framework for extending this result to many larger definable classes, and connects model‑theoretic decidability with deep set‑theoretic principles such as determinacy, the Baire property, and game‑theoretic determinacy. It advances the understanding of which fragments of monadic second‑order logic over uncountable linear orders admit algorithmic decision procedures.