Papers · Preprint
One Meta-Theory, Three Clay-Problem Closures
What three conditional closures of Clay problems have in common.
In plain words
Six Birds produced conditional closures of Navier Stokes regularity, the Riemann hypothesis and P versus NP. This paper does not reprove them. It extracts the shape they share.
The negative half shows any attempted proof of a target conjecture falls into one of four typed states. The positive half gives a seven stage route that imports the hard source as a named recognition rather than deriving it.
A calibration family makes the comparison uniform: typed detectors, bridges as theorems, coverage geometry and named gates.
What it shows
- A finite state space for attempted proofs.
- The recognition mode landing route.
- A catalog of calibrations shared by the three problems.
What it does not claim
It adds no new substrate results and reproves nothing.
Cite
Tsiokos, I. (2026). One Meta-Theory, Three Clay-Problem Closures. Zenodo. https://doi.org/10.5281/zenodo.20713144