Searcharxiv⌕ Search

arXiv · 2611.12948

The Four-Model Scott Complexity Spectrum: $F(4)=8$

Abstract

Gonzalez, Rossegger, and Turetsky introduced a spectrum-counting function $F(n)$ for the Scott complexities realized by $Π^{\mathrm{in}}_2$ theories with exactly $n$ countable models. They proved $7\leq F(4)\leq 8$ and left the exact value open. We prove $F(4)=8$. More precisely, we construct a $Π^{\mathrm{in}}_2$ sentence with exactly four countable models whose optimal Scott complexities are $Π^{\mathrm{in}}_2$, $Σ^{\mathrm{in}}_3$, $Π^{\mathrm{in}}_3$, and $d\text{-}Σ^{\mathrm{in}}_3$, one of each. The construction starts with a complete first-order Ehrenfeucht theory having exactly two almost-prime and two limit models, whose existence follows from a realization theorem of Sudoplatov, and then passes to a full first-order Morleyization. The proof is organized around two low-level transfer principles. First, in a small theory, a $Σ^{\mathrm{in}}_3$ Scott sentence forces a model to be prime over a finite tuple; after Morleyization the converse holds. Second, if a model realizes every complete finite-tuple type over the empty set, then every $Π^{\mathrm{in}}_3$ sentence true in it is true in the countable saturated model. These two principles force the four models into the four distinct Scott-complexity classes above.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yueer Yang. 2026-11-06. The Four-Model Scott Complexity Spectrum: $F(4)=8$. https://searcharxiv.com/abs/2611.12948

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Dubnov-Ivanov-Nagata-Higman Theorem for NIP nilrings

We prove that NIP nilrings of bounded nilexponent are nilpotent. We also deduce that NIP $ω$-categorical $n$-Engel Lie algebras of characteristic $p>n$ are nilpotent, yielding a case of the Lie algebra analogous of Wilson conjecture for $ω$-categorical groups.

math.LO↗

Relative computability and definability for nonregular oracles

Classically, a set is computable from an oracle if both the set and its complement are computably enumerable (c.e.) relative to that oracle. We construct a countable nonstandard model of true arithmetic with sets A and X such that both A and its complement are c.e. relative to X, yet A is not pointwise Turing reducible to X. The Turing functionals used here are single-valued at every oracle. For regular oracles, we prove that the classical equivalence holds over ISigma_1. Two further phenomena, each known from earlier work, are realized with the same oracle X that witnesses our main separation. Strong and pointwise Turing reducibility differ for this X, and some Delta_1^X set is not X-c.e.

math.LO↗