Manuscript OpenAI@2026-10-07 · OpenAI.tex · remark · 6a931f8f
Remark: Family 240. Shelah's eventual categoricity conjecture
Family claims › Mathematical logic · lines 1606–1611
OpenAI@2026-10-07#rem:oai-240
Proves Shelah's eventual categoricity conjecture in ZFC: for each bound on the Löwenheim–Skolem number, a uniform threshold makes categoricity of an abstract elementary class in one cardinal above that threshold imply categoricity throughout the same tail. Categoricity means uniqueness up to isomorphism at a given cardinality. Under the continuum hypothesis, a proposed specific Hanf threshold need not suffice.
The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.
Nearby in this section
- remark: Remark: Family 241. Rigidity of the Turing degrees
- remark: Remark: Family 242. Single-fold Diophantine representations
- remark: Remark: Family 243. Choiceless counting does not capture polynomial time
- remark: Remark: Family 244. The partition principle does not imply choice
- remark: Remark: Family 245. The β -Barendregt–Geuvers–Klop conjecture