arxiv: 2605.04714 · v1 · submitted 2026-05-06 · 🧮 math.LO · math.CO

Recognition: unknown

On n-distality, n-triviality and hypergraph regularity in NIP theories

Artem Chernikov, Francis Westhead

Pith reviewed 2026-05-08 16:42 UTC · model grok-4.3

classification 🧮 math.LO math.CO

keywords NIP theoriesn-distalityhypergraph regularityKeisler measuresstable theoriesforking trivialityNIP fieldsmodel theory

0 comments

The pith

Strongly n-distal NIP theories satisfy a hypergraph regularity lemma and have strict n-distality hierarchy among stable theories.

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

The paper examines Keisler measures in strongly n-distal NIP theories to generalize earlier results known for distal theories. It establishes a hypergraph version of the distal regularity lemma along with compact domination for definable fsg groups. The work shows that the strong n-distality hierarchy is strict among stable theories by linking it to total triviality of forking. It further proves that every infinite strongly n-distal NIP field has characteristic zero, drawing on a discrepancy result from multiparty communication complexity.

Core claim

In strongly n-distal NIP theories, Keisler measures obey a hypergraph regularity lemma. Definable fsg groups are compactly dominated. The strong n-distality hierarchy is strict among stable theories, as shown by a connection to Poizat's total triviality of forking. Infinite strongly n-distal NIP fields have characteristic zero.

What carries the argument

Strong n-distality as a tameness condition on forking in NIP theories that controls higher-order interactions and enables regularity and domination properties for Keisler measures.

If this is right

A hypergraph regularity lemma holds for Keisler measures in these theories.
Definable fsg groups admit compact domination.
The strong n-distality hierarchy is strict in the class of stable theories.
Infinite strongly n-distal NIP fields must have characteristic zero.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The results suggest that n-distality can serve as a replacement for full distality in a range of combinatorial regularity statements.
Links to communication complexity open the possibility of importing discrepancy methods into model-theoretic classification problems.
n-triviality may turn out to be the right notion for studying forking in higher-arity hypergraph settings beyond the cases treated here.

Load-bearing premise

The theories under consideration are strongly n-distal and NIP.

What would settle it

An explicit example of a strongly n-distal NIP theory in which the hypergraph regularity lemma fails, or an infinite strongly n-distal NIP field of positive characteristic.

read the original abstract

We study Keisler measures in strongly n-distal NIP theories, generalizing some results of Simon and Chernikov-Starchenko for distal theories and addressing some questions of Walker. In particular, we establish a hypergraph version of the distal regularity lemma, compact domination for definable fsg groups, and demonstrate that the strong n-distality hierarchy is strict among stable theories using a connection to Poizat's total triviality of forking. We also show that infinite strongly n-distal NIP fields have characteristic 0 using a discrepancy result of Babai-Hayes-Kimmel from multiparty communication complexity.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This paper lifts distal regularity to a hypergraph version in strongly n-distal NIP theories, proves the n-distality hierarchy is strict in stable theories via Poizat, and gets characteristic zero for infinite strongly n-distal NIP fields.

read the letter

The main things to know are the hypergraph distal regularity lemma, compact domination for definable fsg groups, and the strictness of the strong n-distality hierarchy among stable theories. The authors also show that infinite strongly n-distal NIP fields have characteristic zero by applying the Babai-Hayes-Kimmel discrepancy theorem to the relevant definable hypergraphs. These build directly on Simon, Chernikov-Starchenko, Walker, and Poizat without obvious circularity or post-hoc fitting. The connection to multiparty communication complexity is a useful bridge that makes the field result concrete rather than abstract. The proofs follow the established patterns for the distal case but adapt them to the n-setting, and the full text indicates they are self-contained under the tameness hypotheses. The new contributions are the hypergraph version and the strict hierarchy result, which clarify the landscape beyond what was already known for distal theories. The main limitation is the standing assumption of strong n-distality, which is required for the regularity and domination to hold but narrows the scope to sufficiently tame NIP structures. That is not a flaw in the argument, just the natural boundary of the results. The citation pattern is appropriate and does not rely on self-referential loops. This is for model theorists working on NIP structures, regularity lemmas, and classification of tame theories. A reader who already knows the distal case will pick up the generalizations quickly and see how they organize more examples. The work is precise enough and grounded enough to deserve a serious referee, even if some readers will want more explicit examples or comparisons to non-strongly n-distal cases. I would send it to peer review.

Referee Report

0 major / 3 minor

Summary. The paper studies Keisler measures in strongly n-distal NIP theories, generalizing results of Simon and Chernikov-Starchenko from the distal (n=1) case. It proves a hypergraph version of the distal regularity lemma, establishes compact domination for definable fsg groups, shows that the strong n-distality hierarchy is strict among stable theories by linking to Poizat's total triviality of forking, and proves that every infinite strongly n-distal NIP field has characteristic 0 by applying the Babai-Hayes-Kimmel discrepancy theorem to definable hypergraphs.

Significance. If the derivations hold, the work supplies new combinatorial and measure-theoretic tools for the n-distal fragment of NIP theories, answers questions posed by Walker, and gives a clean separation of the strong n-distality hierarchy inside stable theories. The hypergraph regularity lemma and the characteristic-0 result for fields are concrete applications that may be useful beyond the NIP setting. The explicit use of an external discrepancy theorem from communication complexity is a strength.

minor comments (3)

The introduction would benefit from a short paragraph explicitly listing the questions of Walker that are addressed and indicating where in the paper each is resolved.
Notation for n-distality and n-triviality is introduced gradually; a single consolidated definition table or subsection early in the paper would improve readability for readers unfamiliar with the n>1 case.
In the proof of the hypergraph regularity lemma, the dependence on the strong n-distality assumption should be highlighted at each step where it is invoked, to make the generalization from the distal case transparent.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful reading of our manuscript and the positive assessment. We appreciate the recommendation for minor revision and will incorporate any indicated changes in the revised version.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The manuscript generalizes prior results on distal theories from Simon and Chernikov-Starchenko while establishing new claims (hypergraph distal regularity lemma, compact domination for definable fsg groups, strictness of the strong n-distality hierarchy via Poizat's total triviality of forking, and characteristic 0 for infinite strongly n-distal NIP fields via Babai-Hayes-Kimmel discrepancy). These derivations rely on external citations and the standing tameness hypotheses (strongly n-distal NIP) without any reduction of the target statements to fitted parameters, self-definitional loops, or load-bearing self-citation chains within the paper itself. No equations or steps in the provided abstract or described claims exhibit the enumerated circularity patterns; the work is self-contained against the stated external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Only abstract available; no explicit free parameters, axioms, or invented entities can be extracted beyond standard NIP and distal assumptions.

pith-pipeline@v0.9.0 · 5390 in / 1099 out tokens · 15266 ms · 2026-05-08T16:42:17.397355+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

92 extracted references · 19 canonical work pages

[1]

Abd Aldaim, G

A. Abd Aldaim, G. Conant, and C. Terry. Higher arity stability and the functional order property. Sel. Math., New Ser., 31(3):79, 2025. Id/No 59

2025
[2]

Efficient testing of bipartite graphs for forbidden induced subgraphs.SIAM Journal on Computing, 37(3):959–976, 2007

Noga Alon, Eldar Fischer, and Ilan Newman. Efficient testing of bipartite graphs for forbidden induced subgraphs.SIAM Journal on Computing, 37(3):959–976, 2007

2007
[3]

Crossing patterns of semi-algebraic sets.Journal of Combinatorial Theory, Series A, 111(2):310–326, 2005

Noga Alon, János Pach, Rom Pinchasi, Radoš Radoičić, and Micha Sharir. Crossing patterns of semi-algebraic sets.Journal of Combinatorial Theory, Series A, 111(2):310–326, 2005

2005
[4]

Fuzzy VC combinatorics and distality in continuous logic.Preprint, arXiv:2310.04393, 2023

Aaron Anderson. Fuzzy VC combinatorics and distality in continuous logic.Preprint, arXiv:2310.04393, 2023

work page arXiv 2023
[5]

Distality in valued fields and related structures.Transactions of the American Mathematical Society, 375(7):4641–4710, 2022

Matthias Aschenbrenner, Artem Chernikov, Allen Gehret, and Martin Ziegler. Distality in valued fields and related structures.Transactions of the American Mathematical Society, 375(7):4641–4710, 2022

2022
[6]

The cost of the missing bit: Communication complexitywithhelp.InProceedings of the thirtieth annual ACM symposium on Theory of computing, pages 673–682, 1998

László Babai, Thomas P Hayes, and Peter G Kimmel. The cost of the missing bit: Communication complexitywithhelp.InProceedings of the thirtieth annual ACM symposium on Theory of computing, pages 673–682, 1998

1998
[7]

Combinatorial complexity in o-minimal geometry.Proceedings of the London Mathe- matical Society, 100(2):405–428, 2010

Saugata Basu. Combinatorial complexity in o-minimal geometry.Proceedings of the London Mathe- matical Society, 100(2):405–428, 2010

2010
[8]

Incidence bounds in positive characteristic via valuations and distality.Annales Henri Lebesgue, 6:627–641, 2023

Martin Bays and Jean-François Martin. Incidence bounds in positive characteristic via valuations and distality.Annales Henri Lebesgue, 6:627–641, 2023

2023
[9]

Separating deterministic from randomized multiparty communication complexity.Theory of Computing, 6(1):201–225, 2010

Paul Beame, Matei David, Toniann Pitassi, and Philipp Woelfel. Separating deterministic from randomized multiparty communication complexity.Theory of Computing, 6(1):201–225, 2010

2010
[10]

Extended order-generic queries

Oleg V Belegradek, Alexei P Stolboushkin, and Michael A Taitslin. Extended order-generic queries. Annals of Pure and Applied Logic, 97(1-3):85–125, 1999

1999
[11]

Continuous and random Vapnik-Chervonenkis classes.Israel Journal of Mathemat- ics, 173(1):309–333, 2009

Itaï Ben Yaacov. Continuous and random Vapnik-Chervonenkis classes.Israel Journal of Mathemat- ics, 173(1):309–333, 2009

2009
[12]

Definable relations and first-order query languages over strings.Journal of the ACM (JACM), 50(5):694–751, 2003

Michael Benedikt, Leonid Libkin, Thomas Schwentick, and Luc Segoufin. Definable relations and first-order query languages over strings.Journal of the ACM (JACM), 50(5):694–751, 2003

2003
[13]

The definable (p, q)-theorem for distal theories.The Journal of Symbolic Logic, 83(1):123–127, 2018

Gareth Boxall and Charlotte Kestner. The definable (p, q)-theorem for distal theories.The Journal of Symbolic Logic, 83(1):123–127, 2018

2018
[14]

Theories with distal Shelah expansions.The Journal of Sym- bolic Logic, 88(4):1323–1333, 2023

Gareth Boxall and Charlotte Kestner. Theories with distal Shelah expansions.The Journal of Sym- bolic Logic, 88(4):1323–1333, 2023

2023
[15]

Characterizations of monadic NIP.Transactions of the American Mathematical Society, Series B, 8(30):948–970, 2021

Samuel Braunfeld and Michael Laskowski. Characterizations of monadic NIP.Transactions of the American Mathematical Society, Series B, 8(30):948–970, 2021

2021
[16]

Characterizations of monadic NIP

Samuel Braunfeld and Michael Laskowski. Corrigenda to “Characterizations of monadic NIP”.Trans- actions of the American Mathematical Society, Series B, 11(34):1226–1232, 2024

2024
[17]

Towards higher classification theory

Artem Chernikov. Towards higher classification theory. InModel Theory: Combinatorics, Groups, Valued Fields and Neostability. Abstracts from the workshop held January 8–14, 2023, volume 20 ofOberwolfach Workshop Reports, pages 129–134. Mathematisches Forschungsinstitut Oberwolfach, 2023

2023
[18]

Externally definable fsg groups in NIP theories.Preprint, arXiv:2506.23265, 2025

Artem Chernikov. Externally definable fsg groups in NIP theories.Preprint, arXiv:2506.23265, 2025

work page arXiv 2025
[19]

Cutting lemma and Zarankiewicz’s problem in distal structures.Selecta Mathematica, New Series, 26(2):8, 2020

Artem Chernikov, David Galvin, and Sergei Starchenko. Cutting lemma and Zarankiewicz’s problem in distal structures.Selecta Mathematica, New Series, 26(2):8, 2020

2020
[20]

Definable convolution and idempotent Keisler measures.Israel Journal of Mathematics, 248(1):271–314, 2022

Artem Chernikov and Kyle Gannon. Definable convolution and idempotent Keisler measures.Israel Journal of Mathematics, 248(1):271–314, 2022

2022
[21]

Definable convolution and idempo- tent Keisler measures III

Artem Chernikov, Kyle Gannon, and Krzysztof Krupiński. Definable convolution and idempo- tent Keisler measures III. Generic stability, generic transitivity, and revised Newelski’s conjecture. Preprint, arXiv:2406.00912, 2024

work page arXiv 2024
[22]

Mekler’s construction and generalized stability.Israel Journal of Mathematics, 230(2):745–769, 2019

Artem Chernikov and Nadja Hempel. Mekler’s construction and generalized stability.Israel Journal of Mathematics, 230(2):745–769, 2019

2019
[23]

Onn-dependent groups and fields II.Forum of Mathematics, Sigma, 9:e38, 2021

Artem Chernikov and Nadja Hempel. Onn-dependent groups and fields II.Forum of Mathematics, Sigma, 9:e38, 2021. ONn-DISTALITY,n-TRIVIALITY AND HYPERGRAPH REGULARITY IN NIP THEORIES 43

2021
[24]

Onn-dependent groups and fields III

Artem Chernikov and Nadja Hempel. Onn-dependent groups and fields III. Multilinear forms and invariant connected components.Preprint, arXiv:2412.19921, 2024

work page arXiv 2024
[25]

Forking and dividing in NTP2 theories.The Journal of Symbolic Logic, 77(1):1–20, 2012

Artem Chernikov and Itay Kaplan. Forking and dividing in NTP2 theories.The Journal of Symbolic Logic, 77(1):1–20, 2012

2012
[26]

Semi-equational theories.The Journal of Symbolic Logic, 90(1):391–422, 2025

Artem Chernikov and Alex Mennen. Semi-equational theories.The Journal of Symbolic Logic, 90(1):391–422, 2025

2025
[27]

On n-dependence.Notre Dame Journal of Formal Logic, to appear, 2019

Artem Chernikov, Daniel Palacin, and Kota Takeuchi. On n-dependence.Notre Dame Journal of Formal Logic, to appear, 2019

2019
[28]

Model-theoretic Elekes–Szabó for stable ando-minimal hypergraphs.Duke Mathematical Journal, 173(3):419–512, 2024

Artem Chernikov, Ya’acov Peterzil, and Sergei Starchenko. Model-theoretic Elekes–Szabó for stable ando-minimal hypergraphs.Duke Mathematical Journal, 173(3):419–512, 2024

2024
[29]

Externally definable sets and dependent pairs II.Transactions of the American Mathematical Society, 367(7):5217–5235, 2015

Artem Chernikov and Pierre Simon. Externally definable sets and dependent pairs II.Transactions of the American Mathematical Society, 367(7):5217–5235, 2015

2015
[30]

Regularity lemma for distal structures.Journal of the European Mathematical Society, 20(10):2437–2466, 2018

Artem Chernikov and Sergei Starchenko. Regularity lemma for distal structures.Journal of the European Mathematical Society, 20(10):2437–2466, 2018

2018
[31]

Definable regularity lemmas for NIP hypergraphs.The Quarterly Journal of Mathematics, 72(4):1401–1433, 2021

Artem Chernikov and Sergei Starchenko. Definable regularity lemmas for NIP hypergraphs.The Quarterly Journal of Mathematics, 72(4):1401–1433, 2021

2021
[32]

Model-theoretic Elekes–Szabó in the strongly minimal case

Artem Chernikov and Sergei Starchenko. Model-theoretic Elekes–Szabó in the strongly minimal case. Journal of Mathematical Logic, 21(02):2150004, 2021

2021
[33]

Ramsey growth in some NIP structures.Journal of the Institute of Mathematics of Jussieu, 20(1):1–29, 2021

Artem Chernikov, Sergei Starchenko, and Margaret EM Thomas. Ramsey growth in some NIP structures.Journal of the Institute of Mathematics of Jussieu, 20(1):1–29, 2021

2021
[34]

Hypergraph regularity and higher arity VC-dimension

Artem Chernikov and Henry Towsner. Hypergraph regularity and higher arity VC-dimension. Preprint, arXiv:2010.00726, 2020

work page arXiv 2010
[35]

Perfect stable regularity lemma and slice-wise stable hyper- graphs.Preprint, arXiv:2402.07870, 2024

Artem Chernikov and Henry Towsner. Perfect stable regularity lemma and slice-wise stable hyper- graphs.Preprint, arXiv:2402.07870, 2024

work page arXiv 2024
[36]

Averages of hypergraphs and higher arity stability

Artem Chernikov and Henry Towsner. Averages of hypergraphs and higher arity stability. Preprint, arXiv:2508.05839, 2025

work page arXiv 2025
[37]

Higher-arity PAC learning, VC dimension and packing lemma

Artem Chernikov and Henry Towsner. Higher-arity PAC learning, VC dimension and packing lemma. Preprint, arXiv:2510.02420, 2025

work page arXiv 2025
[38]

Generic stability, randomizations and NIP formulas.Journal of Mathematical Logic, page 2550016, 2025

Gabriel Conant, Kyle Gannon, and James E Hanson. Generic stability, randomizations and NIP formulas.Journal of Mathematical Logic, page 2550016, 2025

2025
[39]

Structure and regularity for subsets of groups with finite VC-dimension.Journal of the European Mathematical Society, 24(2):583–621, 2021

Gabriel Conant, Anand Pillay, and Caroline Terry. Structure and regularity for subsets of groups with finite VC-dimension.Journal of the European Mathematical Society, 24(2):583–621, 2021

2021
[40]

Coregliano and Maryanthe Malliaris

Leonardo N. Coregliano and Maryanthe Malliaris. Sample completion, structured correlation, and Netflix problems.Preprint, arXiv:2509.20404, 2025

work page arXiv 2025
[41]

Les corps faiblement algébriquement clos non séparablement clos ont la propriété d’indépendance

Jean-Louis Duret. Les corps faiblement algébriquement clos non séparablement clos ont la propriété d’indépendance. InModel Theory of Algebra and Arithmetic: Proceedings of the Conference on Applications of Logic to Algebra and Arithmetic Held at Karpacz, Poland, September 1–7, 1979, pages 136–162. Springer, 2006

1979
[42]

Overlap properties of geometric expanders.Journal für die Reine und Angewandte Mathematik, 2012(671), 2012

Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, and János Pach. Overlap properties of geometric expanders.Journal für die Reine und Angewandte Mathematik, 2012(671), 2012

2012
[43]

Erdős-Hajnal-type results on intersection patterns of geometric objects

Jacob Fox and János Pach. Erdős-Hajnal-type results on intersection patterns of geometric objects. InHorizons of combinatorics, pages 79–103. Springer, 2008

2008
[44]

A polynomial regularity lemma for semialgebraic hy- pergraphs and its applications in geometry and property testing.SIAM Journal on Computing, 45(6):2199–2223, 2016

Jacob Fox, János Pach, and Andrew Suk. A polynomial regularity lemma for semialgebraic hy- pergraphs and its applications in geometry and property testing.SIAM Journal on Computing, 45(6):2199–2223, 2016

2016
[45]

Erdős–Hajnal conjecture for graphs with bounded VC- dimension.Discrete & Computational Geometry, 61(4):809–829, 2019

Jacob Fox, János Pach, and Andrew Suk. Erdős–Hajnal conjecture for graphs with bounded VC- dimension.Discrete & Computational Geometry, 61(4):809–829, 2019

2019
[46]

Regularity for hypergraphs with bounded VC2 dimension.Preprint, arXiv:2508.09969, 2025

Lior Gishboliner, Asaf Shapira, and Yuval Wigderson. Regularity for hypergraphs with bounded VC2 dimension.Preprint, arXiv:2508.09969, 2025

work page arXiv 2025
[47]

Some trivial considerations.The Journal of symbolic logic, 56(2):624–631, 1991

John B Goode. Some trivial considerations.The Journal of symbolic logic, 56(2):624–631, 1991

1991
[48]

James E. Hanson. Indiscernible extraction at small large cardinals from a higher-arity stability notion. Preprint, arXiv:2506.19147, 2025

work page arXiv 2025
[49]

Sphere packing numbers for subsets of the booleann-cube with bounded Vapnik- Chervonenkis dimension.Journal of Combinatorial Theory, Series A, 69(2):217–232, 1995

David Haussler. Sphere packing numbers for subsets of the booleann-cube with bounded Vapnik- Chervonenkis dimension.Journal of Combinatorial Theory, Series A, 69(2):217–232, 1995

1995
[50]

On n-dependent groups and fields.Mathematical Logic Quarterly, 62(3):215–224, 2016

Nadja Hempel. On n-dependent groups and fields.Mathematical Logic Quarterly, 62(3):215–224, 2016

2016
[51]

Distal and non-distal pairs.The Journal of Symbolic Logic, 82(1):375–383, 2017

Philipp Hieronymi and Travis Nell. Distal and non-distal pairs.The Journal of Symbolic Logic, 82(1):375–383, 2017

2017
[52]

Extension bases in Henselian valued fields.Preprint, arXiv:2210.01567, 2022

Akash Hossain. Extension bases in Henselian valued fields.Preprint, arXiv:2210.01567, 2022

work page arXiv 2022
[53]

Groups, measures, and the NIP.Journal of the American Mathematical Society, 21(2):563–596, 2008

Ehud Hrushovski, Ya’acov Peterzil, and Anand Pillay. Groups, measures, and the NIP.Journal of the American Mathematical Society, 21(2):563–596, 2008. 44 ARTEM CHERNIKOV AND FRANCIS WESTHEAD

2008
[54]

On NIP and invariant measures.Journal of the European Math- ematical Society, 13(4):1005–1061, 2011

Ehud Hrushovski and Anand Pillay. On NIP and invariant measures.Journal of the European Math- ematical Society, 13(4):1005–1061, 2011

2011
[55]

Generically stable and smooth measures in NIP theories.Transactions of the American Mathematical Society, 365(5):2341–2366, 2013

Ehud Hrushovski, Anand Pillay, and Pierre Simon. Generically stable and smooth measures in NIP theories.Transactions of the American Mathematical Society, 365(5):2341–2366, 2013

2013
[56]

Additivity of the dp-rank.Transactions of the American Mathematical Society, 365(11):5783–5804, 2013

Itay Kaplan, Alf Onshuus, and Alexander Usvyatsov. Additivity of the dp-rank.Transactions of the American Mathematical Society, 365(11):5783–5804, 2013

2013
[57]

Artin-Schreier extensions in NIP and simple fields.Israel Journal of Mathematics, 185(1):141–153, 2011

Itay Kaplan, Thomas Scanlon, and Frank O Wagner. Artin-Schreier extensions in NIP and simple fields.Israel Journal of Mathematics, 185(1):141–153, 2011

2011
[58]

ItayKaplan, SaharonShelah, andPierreSimon.ExactsaturationinsimpleandNIPtheories.Journal of Mathematical Logic, 17(01):1750001, 2017

2017
[59]

Strict independence.Journal of Mathematical Logic, 14(02):1450008, 2014

Itay Kaplan and Alexander Usvyatsov. Strict independence.Journal of Mathematical Logic, 14(02):1450008, 2014

2014
[60]

Measures and forking.Annals of Pure and Applied Logic, 34(2):119–169, 1987

H Jerome Keisler. Measures and forking.Annals of Pure and Applied Logic, 34(2):119–169, 1987

1987
[61]

Munehiro Kobayashi. A generalization of the PAC learning in product probability spaces.RIMS Kokyuroku (Proceedings of the workshop Model theoretic aspects of the notion of independence and dimension), http://hdl.handle.net/2433/223742, 1938:33–37, 2015

1938
[62]

Takayuki Kuriyama and Kota Takeuchi. On theP AC n learning.RIMS Kokyuroku (Proceed- ings of the workshop Model theoretic aspects of the notion of independence and dimension), http://hdl.handle.net/2433/223742, 1938:54–58, 2015

1938
[63]

Extensions of measure.Fundamenta Mathematicae, 36(1):267– 276, 1949

Jerzy Łoś and Edward Marczewski. Extensions of measure.Fundamenta Mathematicae, 36(1):267– 276, 1949

1949
[64]

Regularity partitions and the topology of graphons

László Lovász and Balázs Szegedy. Regularity partitions and the topology of graphons. InAn Irreg- ular Mind: Szemerédi is 70, pages 415–446. Springer, 2010

2010
[65]

Distal expansions of the integers and thep-adic fields.Preprint, arXiv:2603.19786, 2026

Koki Okura. Distal expansions of the integers and thep-adic fields.Preprint, arXiv:2603.19786, 2026

work page arXiv 2026
[66]

Théories d’arbres.The Journal of Symbolic Logic, 47(4):841–853, 1982

Michel Parigot. Théories d’arbres.The Journal of Symbolic Logic, 47(4):841–853, 1982

1982
[67]

Oxford University Press, 1996

Anand Pillay.Geometric stability theory. Oxford University Press, 1996

1996
[68]

Type-definability, compact Lie groups, ando-minimality.Journal of Mathematical Logic, 4(02):147–162, 2004

Anand Pillay. Type-definability, compact Lie groups, ando-minimality.Journal of Mathematical Logic, 4(02):147–162, 2004

2004
[69]

Generic stability, regularity, and quasiminimality.Models, logics, and higher-dimensional categories, 53:189–211, 2011

Anand Pillay and Predrag Tanovic. Generic stability, regularity, and quasiminimality.Models, logics, and higher-dimensional categories, 53:189–211, 2011

2011
[70]

On the linear complexity of subsets ofFn p of bounded VC2- dimension.Preprint, arXiv:2512.02001, 2025

Hannah Sheats and Caroline Terry. On the linear complexity of subsets ofFn p of bounded VC2- dimension.Preprint, arXiv:2512.02001, 2025

work page arXiv 2025
[71]

Minimal bounded index subgroup for dependent theories.Proceedings of the Amer- ican Mathematical Society, 136(3):1087–1091, 2008

Saharon Shelah. Minimal bounded index subgroup for dependent theories.Proceedings of the Amer- ican Mathematical Society, 136(3):1087–1091, 2008

2008
[72]

Strongly dependent theories.Israel J

Saharon Shelah. Strongly dependent theories.Israel J. Math., 204(1):1–83, 2014

2014
[73]

Definable groups for dependent and 2-dependent theories.Sarajevo J

Saharon Shelah. Definable groups for dependent and 2-dependent theories.Sarajevo J. Math., 13(25)(1):3–25, 2017

2017
[74]

Finding generically stable measures.The Journal of Symbolic Logic, 77(1):263–278, 2012

Pierre Simon. Finding generically stable measures.The Journal of Symbolic Logic, 77(1):263–278, 2012

2012
[75]

Distal and non-distal NIP theories.Annals of Pure and Applied Logic, 164(3):294–318, 2013

Pierre Simon. Distal and non-distal NIP theories.Annals of Pure and Applied Logic, 164(3):294–318, 2013

2013
[76]

Cambridge University Press, 2015

Pierre Simon.A guide to NIP theories. Cambridge University Press, 2015

2015
[77]

Regularity lemma for distal structures

Pierre Simon. A note on “Regularity lemma for distal structures”.Proceedings of the American Mathematical Society, 144(8):3573–3578, 2016

2016
[78]

On 2-order property.Slides from a talk given at the Asian Logic Conference 2017, Daejeon, Korea, 2017

Kota Takeuchi. On 2-order property.Slides from a talk given at the Asian Logic Conference 2017, Daejeon, Korea, 2017

2017
[79]

On the quadratic complexity of subsets ofFn p of bounded VC2-dimension

C Terry and J Wolf. On the quadratic complexity of subsets ofFn p of bounded VC2-dimension. Preprint, arXiv:2510.12767, 2025

work page arXiv 2025
[80]

The structure of subsets ofF n p of bounded VC 2-dimension.Preprint, arXiv:2510.12867, 2025

C Terry and J Wolf. The structure of subsets ofF n p of bounded VC 2-dimension.Preprint, arXiv:2510.12867, 2025

work page arXiv 2025

Showing first 80 references.