Pith. sign in

REVIEW 1 major objections 1 minor 1 cited by

On the notion of a patterning property in model theory

T0 review · 1 major / 1 minor · reviewed 2026-06-26 · grok-4.3

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The n-strict order property is straightly definable and poset definable for every n, finishing the classification of all classical model-theoretic properties.

desk verdict The paper settles the open questions on straight and poset definability of SOP_n for n at least 4 and adds a restriction on positive definability implications in countably categorical theories. read the letter →

arxiv 2606.18533 v2 pith:JLNZ5RLJ submitted 2026-06-16 math.LO

Gabriel Day , Scott Mutchnik This is my paper
classification math.LO
keywords modeltheoryclassificationstrictorderpropertystraightdefinabilityposetSOP_ncountablycategoricaltheoriespatterning
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper defines rigorous notions of patterning properties in model theory through straight definability, which captures patterns of consistency and inconsistency between a formula and its negation, and poset definability, which captures properties via embeddings of partial orders. It proves that the n-strict order property satisfies both notions for all n at least 4. This completes an earlier program that had already handled the order property, tree property, and smaller cases of the strict order property. A second result shows that, inside countably categorical theories, any implication between positively straightly definable properties must already hold at the level of existential-universal formulas, with further consequences if the second and third strict order properties coincide.

What carries the argument

Straight definability: a patterning property is straightly definable when it is witnessed by a fixed pattern of consistency and inconsistency statements involving a single formula and its negation; poset definability is the corresponding notion obtained by interpreting an arbitrary finite poset inside the theory.

What would settle it

A single countably categorical theory containing a positively straightly definable property whose implication to another such property fails to be witnessed by any existential-universal formula, or a concrete theory in which SOP_4 fails to be straightly definable.

Watch

Extended reading notes

Core claim

SOP_n is straightly definable and poset definable for every integer n at least 4. This finishes the demonstration that every classical classification-theoretic property (order property, tree property, and all SOP_n) is straightly definable. In addition, inside any countably categorical theory, implications between positively straightly definable properties are witnessed already by existential-universal formulas, and therefore also by the assumption that SOP_2 equals SOP_3.

Load-bearing premise

The claims about positively straightly definable properties in countably categorical theories rest on Saracino's theorem together with results of Bodirsky, Bodor and Marimon, plus the auxiliary assumption that SOP_2 equals SOP_3.

Editorial extensions

If this is right

  • Every classical classification-theoretic property is straightly definable.
  • Every classical classification-theoretic property is also poset definable.
  • Inside countably categorical theories, implications between positively straightly definable properties are already visible at the exists-forall level.
  • If SOP_2 equals SOP_3 then the exists-forall level is the only level at which such implications can first appear in countably categorical theories.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The same definability notions might be used to classify further families of properties that lie outside the classical list, such as higher-arity order properties.
  • The exists-forall restriction supplies a uniform syntactic test that could be checked algorithmically in omega-categorical structures.
  • If the equality SOP_2 = SOP_3 turns out to be independent of ZFC, the second main result splits into two separate statements whose relative strength would then be comparable.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

1 major / 1 minor

Summary. The paper discusses proposals for making the notion of a model-theoretic patterning property rigorous, including Shelah's straight definability (patterns of consistency/inconsistency in a formula and negation) and Garcia-Mennuni poset definability (interpreting a partial order embedding a given poset), along with a higher-arity version of straight definability. The first main result answers open questions of Bailetti and Garcia-Mennuni by showing that SOP_n is straightly definable and poset definable for all n ≥ 4, completing the categorization of all classical classification-theoretic properties as straightly definable. The second main result shows that in any countably categorical theory, implications between positively straightly definable properties (as defined by Bailetti) must be exhibited at the level of ∃∀-formulas, using Saracino's theorem and results of Bodirsky, Bodor and Marimon, with special consequences under the assumption that SOP_2 equals SOP_3.

Significance. If the results hold, the work completes the classification of classical properties under straight definability and provides structural constraints on implications among positively straight definable properties in countably categorical theories. The use of established external theorems (Saracino, Bodirsky et al.) to derive the second result is a strength when the background conditions are met.

major comments (1)
  1. [second main result (abstract and relevant section on positively straightly definable properties)] The second main result depends on Saracino's theorem and results of Bodirsky, Bodor and Marimon holding in countably categorical theories, together with the assumption that SOP_2 equals SOP_3 for the stated consequences; if these background theorems or the equality assumption fail, the implication claim at the exists-forall level does not follow. The paper should make the dependence on these external results and the SOP_2 = SOP_3 assumption fully explicit, including any edge cases for n ≥ 4.
minor comments (1)
  1. [introduction / discussion of proposals] The abstract introduces a higher-arity version of straight definability but provides no definition or examples; include a precise definition and at least one illustrative example in the introduction or § on proposals from the literature.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful review and constructive feedback. We address the major comment below by agreeing to enhance the explicitness of the dependencies in our presentation of the second main result.

read point-by-point responses

  1. Referee: The second main result depends on Saracino's theorem and results of Bodirsky, Bodor and Marimon holding in countably categorical theories, together with the assumption that SOP_2 equals SOP_3 for the stated consequences; if these background theorems or the equality assumption fail, the implication claim at the exists-forall level does not follow. The paper should make the dependence on these external results and the SOP_2 = SOP_3 assumption fully explicit, including any edge cases for n ≥ 4.

    Authors: We agree that the dependence on Saracino's theorem, the results of Bodirsky, Bodor and Marimon, and the assumption SOP_2 = SOP_3 should be stated more explicitly, including discussion of edge cases for n ≥ 4. The manuscript already invokes these results and the assumption in the abstract and relevant section, but we will revise to make the conditions under which the ∃∀-level implication holds fully transparent to the reader. This change will be incorporated in the next version. revision: yes

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity identified

full rationale

The paper proves that SOP_n (n≥4) is straightly definable and poset definable by answering open questions from Bailetti and Garcia-Mennuni, and derives implications for positively straightly definable properties in countably categorical theories via Saracino's theorem and results of Bodirsky, Bodor and Marimon. These steps rely on external theorems and prior definability notions rather than any internal fit, self-definition, or self-citation chain that reduces the central claims to quantities already present in the paper itself. The derivation chain is therefore self-contained against external benchmarks.

Assumptions & free parameters 0 free parameters · 2 assumptions · 0 invented entities

The results rest on background theorems from model theory whose proofs are external to this paper.

assumptions (2)
  • standard math Saracino's theorem
    Invoked to obtain the exists-forall level restriction in countably categorical theories.
  • standard math Results of Bodirsky, Bodor and Marimon
    Used to control implications between positively straightly definable properties.

how reviews work

0 comments
Cite this review

Pith. "Pith review of On the notion of a patterning property in model theory." pith.science (2026). https://pith.science/paper/JLNZ5RLJ

@misc{pith2026260618533,
  author       = {Pith},
  title        = {Pith review of: On the notion of a patterning property in model theory},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/JLNZ5RLJ}},
  note         = {Machine review of arXiv:2606.18533}
}
abstract

Different kinds of definable patterns in the models of a first-order theory, such as the order property, the tree property, or the ($n$-)strict order property, allow us to distinguish theories according to their logical complexity. The complexity distinctions given by these definable patterns play a central role in model theory. However, a rigorous definition of the notion of a model-theoretic patterning property has yet to be established. We start by discussing different proposals from the literature for making the notion of a model-theoretic patterning property rigorous. Some examples will include the straight definability of Shelah, which will describe properties definable by a pattern of consistency and inconsistency in a formula and its negation, and the poset definability of Garcia and Mennuni, covering properties definable by interpreting a partial order embedding a given poset. We will also introduce a higher-arity version of straight definability. In our first main result, we will answer open questions of Bailetti and Garcia-Mennuni, showing that the $n$-strict order property $\mathrm{SOP}_{n}$ is straightly definable and poset definable even for integers $n \geq 4$. This will complete the categorization of all of the classical classification-theoretic properties as straightly definable. Our other main result will concern properties that are straightly definable without negation: the positively straightly definable properties defined by Bailetti. We will show using Saracino's theorem and results of Bodirsky, Bodor and Marimon that, in any countably categorical theory, implications between positively straightly definable properties must be exhibited at the level of $\exists\forall$-formulas. This will have special consequences under the assumption that $\mathrm{SOP}_{2}$ is equal to $\mathrm{SOP}_{3}$.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Some applications of the real strict order property hierarchy

    math.LO 2026-06 unverdicted novelty 7.0 of 10

    Real-valued NSOP_r techniques yield that NSOP2subseteq NSOP_r for r>2, an approximate alternative between new real properties and NSOP_n collapse in NTP2, and a sharp SOP2-implies-SOP3 dichotomy for finitely forbidden...

Reference graph

Works this paper leans on

36 extracted references · 16 canonical work pages · cited by 1 Pith paper

  1. [1]

    Annals of Pure and Applied Logic , year =

    Džamonja, Mirna and Shelah, Saharon , title =. Annals of Pure and Applied Logic , year =

  2. [2]

    manuscript , year =

    Day, Gabriel , title =. manuscript , year =

  3. [3]

    2020 , school=

    Definability and categoricity in continuous logic , author=. 2020 , school=

    2020

  4. [4]

    , title =

    Mutchnik, S. , title =. arXiv preprint arXiv:2509.14517 , year =

    work page arXiv

  5. [5]

    Kaplan, Itay and Ramsey, Nicholas , year =. On. Journal of the European Mathematical Society , doi =

  6. [6]

    M. E. Malliaris , journal =. THE CHARACTERISTIC SEQUENCE OF A FIRST-ORDER FORMULA , urldate =

  7. [7]

    Binary simple homogeneous structures are supersimple with finite rank , urldate =

    Vera Koponen , journal =. Binary simple homogeneous structures are supersimple with finite rank , urldate =

  8. [8]

    Simple Homogeneous Structures and Indiscernible Sequence Invariants

    Baldwin, John and Freitag, James and Mutchnik, Scott , title =. arXiv preprint arXiv:2405.08211 , year =

    work page Pith review arXiv

Show all 36 references
  1. [9]

    1988 , publisher=

    Fundamentals of stability theory , author=. 1988 , publisher=

    1988

  2. [10]

    Annals of Pure and Applied Logic , volume =

    Chernikov, Artem , title =. Annals of Pure and Applied Logic , volume =. 2014 , publisher =. doi:10.1016/j.apal.2013.09.004 , eprint =

    2014 doi

  3. [11]

    Notre Dame Journal of Formal Logic , volume =

    Casanovas, Enrique and Kim, Byunghan , title =. Notre Dame Journal of Formal Logic , volume =. 1998 , publisher =. doi:10.1305/ndjfl/1039118865 , URL =

    1998 doi

  4. [12]

    Proceedings of the American Mathematical Society , volume=

    Model companions for _0 -categorical theories , author=. Proceedings of the American Mathematical Society , volume=. 1973 , issn=. doi:10.2307/2039308 , url=

    1973 doi

  5. [13]

    and Bodor, B

    Bodirsky, M. and Bodor, B. and Marimon, P. , title =. arXiv preprint arXiv:2512.21278 , year =

  6. [14]

    , title =

    Mutchnik, S. , title =. arXiv preprint arXiv:2305.09908 , year =

    arXiv

  7. [15]

    2023 , month =

    Neostability , author =. 2023 , month =

    2023

  8. [16]

    Annals of Pure and Applied Logic , year =

    JinHoo Ahn and Joonhee Kim , title =. Annals of Pure and Applied Logic , year =

  9. [17]

    1990 , publisher=

    Classification theory: and the number of non-isomorphic models , author=. 1990 , publisher=

    1990

  10. [18]

    arXiv preprint arXiv:2507.06977 , year =

    Day, Gabriel , title =. arXiv preprint arXiv:2507.06977 , year =

  11. [19]

    Saharon Shelah and Alexander Usvyatsov , keywords =. More on. Annals of Pure and Applied Logic , volume =. 2008 , issn =. doi:https://doi.org/10.1016/j.apal.2008.02.003 , url =

    2008 doi

  12. [20]

    Archive for Mathematical Logic , volume=

    On -categorical simple theories , author=. Archive for Mathematical Logic , volume=. 2012 , publisher=

    2012

  13. [21]

    Journal of the European Mathematical Society 28 (2026), no

    Mutchnik, Scott , title = ". Journal of the European Mathematical Society 28 (2026), no. 8, pp. 3475–3498 , year =

    2026

  14. [22]

    arXiv preprint arXiv:math/9910158 , year =

    Shelah, Saharon , title = ". arXiv preprint arXiv:math/9910158 , year =

    arXiv

  15. [23]

    Mathematical Logic Quarterly , volume=

    On n -dependent groups and fields , author=. Mathematical Logic Quarterly , volume=. 2016 , publisher=

    2016

  16. [24]

    arXiv preprint arXiv:2010.00726 , year=

    Hypergraph regularity and higher arity VC-dimension , author=. arXiv preprint arXiv:2010.00726 , year=

    2010

  17. [25]

    arXiv preprint arXiv:2111.01739 , year=

    Higher-order generalizations of stability and arithmetic regularity , author=. arXiv preprint arXiv:2111.01739 , year=

  18. [26]

    Fundamenta Mathematicae , author =

    On what. Fundamenta Mathematicae , author =. 2000 , pages =. doi:10.4064/fm-166-1-2-1-82 , language =

    2000 doi

  19. [27]

    arXiv preprint arXiv:2209.00571 , year=

    Model-theoretic dividing lines via posets , author=. arXiv preprint arXiv:2209.00571 , year=

  20. [28]

    Trace definability

    Walsberg, Erik , journal=. Trace definability

  21. [29]

    Forum of Mathematics, Sigma , volume=

    Generic stability independence and treeless theories , author=. Forum of Mathematics, Sigma , volume=. 2024 , organization=

    2024

  22. [30]

    Shelah, Saharon , year =. On what

  23. [31]

    arXiv preprint math/0703045 , year=

    Definable groups for dependent and 2-dependent theories , author=. arXiv preprint math/0703045 , year=

  24. [32]

    Selecta Mathematica , volume=

    Higher arity stability and the functional order property , author=. Selecta Mathematica , volume=. 2025 , publisher=

    2025

  25. [33]

    Mathematical Logic Quarterly , author =

    On. Mathematical Logic Quarterly , author =. 1982 , pages =. doi:10.1002/malq.19820280802 , language =

    1982 doi

  26. [34]

    The Journal of Symbolic Logic , pages=

    A Walk on the Wild Side: Notions of maximality in first-order theories , author=. The Journal of Symbolic Logic , pages=. 2024 , publisher=

    2024

  27. [35]

    Notre Dame Journal of Formal Logic , year=

    On n-dependence , author=. Notre Dame Journal of Formal Logic , year=

  28. [36]

    Characterization of

    Scow, Lynn , journal=. Characterization of. 2012 , publisher=

    2012

Pith tools

Reviewed June 26, 2026 · model on record in the stance chip above.