PARIS-HARRINGTON
15 / 16
The Philosophical Core
n=4 · k=2-subsets · 3 colors
SCENARIO
Consider: 'Every sufficiently large structure contains a well-organized, relatively large substructure.' This is true, but first-order arithmetic cannot see why.
RAMSEY CONTEXT
Ramsey theory is the mathematics of inevitable order in large structures. PH shows this order sometimes exceeds formal proof.
PA ANALYSIS
PA's induction schema can only 'see' ordinals below ε₀. The combinatorial complexity of PH requires seeing exactly at ε₀.
The boundary between provable and unprovable runs through the heart of finitary mathematics — not at its exotic margins.
True but unprovable in PA · ε₀ boundary · rotates daily