Research Training Network in Model Theory
Publications > Preprint server > Preprint Number 2062

Preprint Number 2062

Previous Next Preprint server

2062. M. Malliaris and S. Shelah
Shearing in some simple rank one theories

Submission date: 26 September 2021


Dividing asks about inconsistency along indiscernible sequences. In order to study the finer structure of simple theories without much dividing, the authors recently introduced shearing, which essentially asks about inconsistency along generalized indiscernible sequences. Here we characterize the shearing of the random graph. We then use shearing to distinguish between the random graph and the theories T_{n,k}, the higher-order analogues of the triangle-free random graph. It follows that shearing is distinct from dividing in simple unstable theories, and distinguishes meaningfully between classes of simple unstable rank one theories. The paper begins with an overview of shearing, and includes open questions.

Mathematics Subject Classification: 03C45

Keywords and phrases:

Full text arXiv 2109.12642: pdf, ps.

Last updated: September 29 2021 18:46 Please send your corrections to: