SearcharxivSearch

arXiv · 2608.15044

$\omega_1$-anchored labels in minimal counterexamples to Vaught's conjecture: a per-witness trichotomy and an unconditional stationary dichotomy

Abstract

Let $\varphi$ be a minimal counterexample to Vaught's conjecture in the sense of Montalban; such a $\varphi$ exists if Vaught's conjecture fails, by Steel and Harnik-Makkai. We bring into contact, at the level of statements, two bodies of work on the models of such a $\varphi$: the analysis of Gonzalez-Rossegger-Turetsky, in which at every countable level $\beta$ exactly one back-and-forth class $C_\beta$ is uncountable and, at fixed points of an associated function, has a distinguished member of least Scott rank (its label); and the supply of models with prescribed $\omega_1^A$ from higher recursion theory, namely Montalban's Gandy-basis lemma and Sacks' $\Sigma_1$-hull club. All results are theorems of ZFC under standing hypotheses (H0)-(H3). We prove: (i) a per-witness trichotomy -- for every limit $\lambda$ in the fixed-point club above $qr(\varphi)$, every model $A$ of $\varphi$ with $\omega_1^A=\lambda$ and Scott rank at least $\lambda$ either is the label $K_\lambda$, or lies outside $C_{\lambda+1}$ and so forces two non-isomorphic models of Scott rank $\lambda+1$, or is the label $K_{\lambda+1}$ and attains the Nadel bound; (ii) coordinate identities: the first and third branches are equivalent, level by level, to computations of $\omega_1$ of the labels; (iii) a seeding theorem: on a club, Sacks' construction supplies at every level a model of top rank with prescribed $\omega_1$, and his atomic chain consists of the labels; (iv) an unconditional stationary dichotomy: on that club, either stationarily many successor levels carry two non-isomorphic models of Scott rank $\lambda+1$, or stationarily many labels attain the Nadel bound. On the fiber of models with $\omega_1=\lambda$ we further prove uniqueness of the node-saturated model and give a complete isomorphism invariant with countable spectrum. We prove nothing bearing on Vaught's conjecture itself.

Explore related subjects

Keep this discovery

BibTeXRIS

Mohammad Assem Mahmoud. 2026-08-15. $\omega_1$-anchored labels in minimal counterexamples to Vaught's conjecture: a per-witness trichotomy and an unconditional stationary dichotomy. https://arxiv.org/abs/2608.15044

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO