Indiscernible extraction at small large cardinals from a higher-arity stability notion
James E. Hanson

TL;DR
This paper introduces a higher-arity stability concept called $k$-splitting, demonstrating its implications for indiscernible extraction at $k$-ineffable cardinals and establishing connections with $ ext{NFOP}_k$ and $ ext{NIP}$ theories.
Contribution
It defines a new higher-arity stability notion, explores its properties, and provides counterexamples linking it to other stability and independence properties.
Findings
Bounded $k$-splitting improves indiscernible extraction at $k$-ineffable cardinals.
Existence of theories with bounded $k$-splitting but unbounded $(k-1)$-splitting.
Counterexample of an $ ext{NIP}$ theory with unbounded $k$-splitting for all $k$.
Abstract
We introduce a higher-arity stability notion defined in terms of -splitting, a higher-arity generalization of splitting. We show that theories with bounded -splitting have improved indiscernible extraction at -ineffable cardinals, and we give a non-trivial example of a theory with bounded -splitting but unbounded -splitting for each odd . We also show that bounded -splitting implies , a higher arity stability notion introduced by Terry and Wolf. We then use our indiscernible extraction result together with a construction of Kaplan and Shelah to give a strong counterexample to the converse: an theory with unbounded -splitting for every . Finally, as a thematically related but technically independent result, we show that treelessness implies , sharpening a result of Kaplan, Ramsey, and Simon.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms
