Metraipolis › archive › dc_695f8cbb60ca
$n$-variable theorems for dividing lines characterized by positive consistency-inconsistency configurations, and their applications to preservation problems — arXiv:2609.36394
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.36394
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T18:37:12.218Z
- SHA-256 of the archived text
2cde34cdf3b23ba3db4e943a10b642cfded50dc7523bab4e79a7186afb2da408- Stable URL of this page
https://metraipolis.com/documento/dc_695f8cbb60ca
How to cite
$n$-variable theorems for dividing lines characterized by positive consistency-inconsistency configurations, and their applications to preservation problems — arXiv:2609.36394 — arXiv (en), https://arxiv.org/abs/2609.36394 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_695f8cbb60ca (Metraipolis archive dc_695f8cbb60ca, sha256 2cde34cdf3b23ba3db4e943a10b642cfded50dc7523bab4e79a7186afb2da408)
BibTeX
@misc{dc695f8cbb60ca,
title = {$n$-variable theorems for dividing lines characterized by positive consistency-inconsistency configurations, and their applications to preservation problems — arXiv:2609.36394},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.36394},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_695f8cbb60ca; sha256 2cde34cdf3b23ba3db4e943a10b642cfded50dc7523bab4e79a7186afb2da408},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36394. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 $\omega$ for any $k<\omega$, theories not having an infinite $k$-grid for any $k<\omega$, and NPM$^{(k)}$ theories for each $1<k<\omega$. 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 $\varphi(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^\delta_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<\omega$. 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}$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.LO).
Categorie arXiv: Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.36394 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T18:03:25.984Z dalla pagina https://arxiv.org/catchup/math.LO/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).