Indiscernibles in monadically NIP theories

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F25%3A00639509" target="_blank" >RIV/67985807:_____/25:00639509 - isvavai.cz</a>
Alternative codes found
RIV/00216208:11320/25:10511789
Result on the web
<a href="https://doi.org/10.1112/blms.70155" target="_blank" >https://doi.org/10.1112/blms.70155</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1112/blms.70155" target="_blank" >10.1112/blms.70155</a>

Result language
angličtina
Original language name
Indiscernibles in monadically NIP theories
Original language description
We prove various results around indiscernibles in monadically NIP theories. First, we provide several characterizations of monadic NIP in terms of indiscernibles, mirroring previous characterizations in terms of the behavior of finite satisfiability. Second, we study (monadic) distality in hereditary classes and complete theories. Here, via finite combinatorics, we prove a result implying that every planar graph admits a distal expansion. Finally, we prove a result implying that no monadically NIP theory interprets an infinite group, and note an example of a (monadically) stable theory with no distal expansion that does not interpret an infinite group
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GM24-12591M" target="_blank" >GM24-12591M: Model theory, structural combinatorics, and algorithms</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)