MSO中序数秩的一个二分定理
A Dichotomy Theorem for Ordinal Ranks in MSO
AI总结:
针对全二叉树上MSO公式∃X.φ(Y,X)且X为良基集,研究其秩的上界,发现秩要么严格小于ω²,要么达到最大可能值ω₁,且可判定。
摘要:
我们关注全二叉树上的一元二阶逻辑公式 $\exists X.\, \varphi(\vec{Y}, X)$,其中见证 $X$ 是一个良基集。这样的集合 $X$ 的序数秩 $\mathrm{rank}(X) < \omega_1$ 衡量其深度和分支结构。我们寻找这些秩的最小上界,并根据公式 $\varphi$ 发现以下二分性。令 $\mathrm{rank}(\varphi)$ 为最小的序数,使得每当实例 $\vec{Y}$ 满足公式时,存在一个见证 $X$ 满足 $\mathrm{rank}(X) \leq \mathrm{rank}(\varphi)$。那么 $\mathrm{rank}(\varphi)$ 要么严格小于 $\omega^2$,要么达到最大可能值 $\omega_1$。此外,哪种情况成立是可判定的。该结果在多种与序数相关的问题中具有潜在应用,特别是它蕴含了关于不动点公式闭包序数的结果。
英文摘要:
We focus on formulae $\exists X.\, φ(\vec{Y}, X)$ of monadic second-order logic over the full binary tree, such that the witness $X$ is a well-founded set. The ordinal rank $\mathrm{rank}(X) < ω_1$ of such a set $X$ measures its depth and branching structure. We search for the least upper bound for these ranks, and discover the following dichotomy depending on the formula $φ$. Let $\mathrm{rank}(φ)$ be the minimal ordinal such that, whenever an instance $\vec{Y}$ satisfies the formula, there is a witness $X$ with $\mathrm{rank}(X) \leq \mathrm{rank}(φ)$. Then $\mathrm{rank}(φ)$ is either strictly smaller than $ω^2$ or it reaches the maximal possible value $ω_1$. Moreover, it is decidable which of the cases holds. The result has potential for applications in a variety of ordinal-related problems, in particular it entails a result about the closure ordinal of a fixed-point formula.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。