Searcharxiv⌕ Search

arXiv · 2609.36394

$n$-variable theorems for dividing lines characterized by positive consistency-inconsistency configurations, and their applications to preservation problems

Abstract

We define a class of classes of complete first-order theories, denoted by $\mathfrak{D}_{n\text{-var}}$, using positive consistency-inconsistency configurations and generalized indiscernibles. It contains the classes of stable, simple, NIP, NTP$_1$, NTP$_2$, NATP, NCTP, and NBTP theories, as well as the classes of theories not having a $(k,1,1)$-weave of depth $ω$ for any $k<ω$, theories not having an infinite $k$-grid for any $k<ω$, and NPM$^{(k)}$ theories for each $1<k<ω$. For any dividing line $D\in\mathfrak{D}_{n\text{-var}}$ and any complete first-order theory $T\notin D$, we can always find a formula $φ(x,y)$ witnessing $T\notin D$ with an indexed set of parameters such that the set of its instances required to be consistent has a realization whose algebraic dimension over the whole set of parameters is $|x|$. We call statements of this form $n$-variable theorems, as they may be regarded as weak versions of one-variable theorems. Under the appropriate hypotheses on $T$, we prove that $T\in D$ if and only if the corresponding theory belongs to $D$ for (i) $T^{gt}$, (ii) $T_P$, (iii) $T^{ind}$, (iv) $T^G_K$, (v) ACF$_T$, and (vi) any completion of $T^δ_g$. These are, respectively, the theories of generic trivializations, lovely pair expansions, $H$-structure expansions, vector spaces with a dense-codense generic $K$-subspace, algebraically closed fields with a distinguished subfield, and generic derivations of algebraically bounded fields. The $n$-variable theorem is essential in proving (i)--(v). We also introduce a larger class $\mathfrak{D}^h_{n\text{-var}}\supseteq\mathfrak{D}_{n\text{-var}}$, capturing higher-arity dividing lines such as NOP$_k$, NFOP$_k$, and NIP$_k$ for $1<k<ω$. The $n$-variable theorem and preservation results (ii), (iii), (iv), and (vi) also hold for this larger class, while (i) holds assuming ${\rm acl}={\rm dcl}$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Joonhee Kim. 2026-09-28. $n$-variable theorems for dividing lines characterized by positive consistency-inconsistency configurations, and their applications to preservation problems. https://arxiv.org/abs/2609.36394

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

KEEP EXPLORING

Related papers

Finitely Related Clones: Action Algebras and Applications to Free Algebras

For finite-domain constraint satisfaction problems (CSPs), the polymorphism clone provides an algebraic framework for studying the associated constraint language. A central question in clone theory is whether a clone is finitely related, that is, whether it is determined by the operations preserving a finite set of relations. Here, we study this question through the action algebra of a clone on its own $n$-ary part. We prove that a clone $\mathcal{C}$ on a finite domain $C$ is finitely related if and only if its action algebra $\widetilde{\mathcal{C}} = \mathcal{C} \curvearrowright \mathcal{C}^{(n)}$ is finitely related, provided that $n \geq |C|$. We also apply natural clone isomorphisms to obtain a finite-relatedness criterion for free algebras: a finite algebra is finitely related if and only if its free algebra of sufficiently large finite rank is finitely related.

math.LO↗

Bistationary Traces, Wide Levels, and Branch-Cover Rigidity for an Unrestricted Typed Variant of the Hayut-Magidor Forcing

For every uncountable regular cardinal $α$, $\mathbb S^{\ast}(α)$ is an explicitly typed four-coordinate forcing motivated by the ladder-system construction of Hayut and Magidor. The forcing is $σ$-closed and, after adjoining a formal maximum, $α$-strategically closed. For $α\geqω_2$, every nonempty countable family of designated generic branches has a stationary and costationary common trace on the generic ladder-coordinate set $L_α$, while no countable family of cofinal branches generates $L_α$. These conclusions persist under a Kurepa-style level-size bound. In the unrestricted forcing, for every infinite cardinal $μ<α$ in the ground model, some level of the generic tree contains a copy of $({}^μ2)^V$. Consequently, the endpoint-corrected restriction family indexed by $\mathcal P_{ω_2}α$ is too wide, whereas the scaled restriction system indexed by $\mathcal P_αα$ has all levels of size less than $α$ exactly when $α$ is strongly inaccessible in the ground model. When these equivalent conditions hold, the branch-covering number of $L_α$ relative to the scaled system is at least $ω_1$. The low-cofinality empty-value convention also ensures that the set of domains of $L_α$ contains no club in $\mathcal P_αα$. The unrestricted tree clause of the motivating presentation is retained, without asserting forcing equivalence.

math.LO↗

Freely adding one layer of quantifiers to a Boolean doctrine

We describe the layer of quantifier alternation depth at most one of the quantifier completion of a Boolean doctrine over a small category. This amounts to a doctrinal version of Herbrand's theorem for formulas with quantifier alternation depth at most one modulo a universal theory. The resulting construction satisfies a universal property that makes it the free QA-one-step Boolean doctrine. To achieve this version of Herbrand's theorem, we characterize, within the doctrinal setting, the classes $A$ of quantifier-free formulas for which there is a model $M$ such that $A$ is precisely the class of formulas whose universal closure is valid in $M$.

math.LO↗