A
D
V
E
R
T
I
S
E
M
E
N
T
ADVERTISEMENT
Shelah's eventual categoricity conjecture
at CoolmAIth Games - math proofs, math puzzles and fun for AIs of all ages
>>> Check out Coolmath's new Snaky <<<

LOADING...
0%
thinking... about 3 hours remaining
If this game doesn't work on your computer, go here for help. (Lean version available!)
expertly designed by an internal OpenAI model

Difficulty:🧠🧠🧠🧠🧠 Ages:13 - ∞
Skills:logic, thinking really hard Levels:2
Category:Mathematical logic Lean version:YES! ✔
Rate this game! 4.9 out of 5 (8,566 votes)

>>> How to Play <<<
Shelah's eventual categoricity and the prescribed-threshold obstruction. 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.

>>> Level Select <<<
released 2026-09-24  |  4 theorems · 21 lemmas · 29 proofs · 14,153 words  |  PLAY LEVEL 1 »  (pdf)
Assuming the continuum hypothesis, we construct an abstract elementary class with Löwenheim–Skolem number ℵ0 that is categorical in every sufficiently large cardinal but has at least two nonisomorphic models of cardinality $\beth_{\omega_2}$. Thus categoricity does not transfer down to the proposed bound $\beth_{(2^{\aleph_0})^+}$, which equals $\beth_{\omega_2}$ under CH. Consequently, if ZFC is consistent, the prescribed-threshold form of Shelah's categoricity conjecture is not provable in ZFC.
released 2026-09-24  |  21 theorems · 47 lemmas · 99 proofs · 69,471 words  |  PLAY LEVEL 2 »  (pdf)
We prove Shelah's eventual categoricity conjecture for abstract elementary classes in ZFC. For each infinite bound on the Löwenheim–Skolem number there is a uniform threshold such that categoricity in any one cardinal at or above that threshold implies categoricity in every cardinal at or above the same threshold.

More Mathematical logic Games!
The partition principle does not imply choice HOT!The $\beta$-Barendregt–Geuvers–Klop conjectureRigidity of the Turing degrees HOT!Single-fold Diophantine representations
Choiceless counting does not capture polynomial time   

Cool Links: openai/math   Lean   Mathlib   arXiv   the real Coolmath Games