The truth that outruns proof has no fixed ground
The Ascent proved there is no top: no system proves everything, so truth outruns proof at every level. But the unprovable truths are true — true in the standard model ℕ. That opens a question the climb never asked: what is ℕ, and can it be pinned down? It cannot. No first-order theory fixes an infinite model; every attempt to secure the ground from outside needs a richer ground, itself unsecured. There is no roof, and there is no floor.
the intended model · nonstandard numbers · the ground that recedes
The Ascent ended on a line it did not examine. Truth outruns proof, it said — the Gödel sentence is true though unprovable. But true where? A sentence is not true or false in the void; it is true in a model. The Gödel sentence is true in ℕ, the standard natural numbers — the structure 0, 1, 2, … that every child counts and every mathematician means. The whole of the previous panel was syntax: which marks on paper follow from which. The instant we call a sentence true, we have left syntax for semantics, and stepped onto ground we have not yet inspected.
This panel inspects it, and finds it will not hold still. The intended model ℕ exists and is unique — but only in second-order logic, which pins it down at a price we will have to pay. In the first-order logic that actually carries Gödel's and Tarski's theorems, ℕ is not unique at all: there are nonstandard models, dense with infinite numbers, in which the very sentences true of ℕ come out false. And the obvious remedy — climb to a richer logic that fixes the intended model — relocates the problem exactly as the reflection ladder did, into a ground that is itself unfixed.
The result mirrors the last one with eerie precision. The Ascent's engine was that the repair operator has no fixed point: no consistent system proves its own soundness, so the climb up never ends. The Descent's engine is that no first-order theory with an infinite model is categorical: it cannot fix its own model up to isomorphism, so the dig down never reaches bedrock. There the missing thing was completeness; here it is the intended model; in both, you cannot reach it from inside, and reaching from outside needs an outside without end. The edifice has no roof and no floor. We descend in three movements.
The Gödel sentence is true — true in the standard model. In second-order logic that model is unique. The truth that outruns proof is truth in a structure.
The Gödel sentence G says, of itself, that it has no proof in T. If T is consistent, G indeed has no proof — so what G says is the case. G is true. But this "true" is not a verdict of the proof system; it is a claim about a structure, ℕ, in which G's arithmetic comes out right. So the gap the Ascent opened — truth beyond proof — is a gap between a theory and a model. Everything now turns on the model. What secures ℕ as a single, definite object?
So far the ground is firm — suspiciously so. Categoricity says the axioms admit no rival to ℕ; the unprovable Gödel sentence has a definite truth value because there is a definite structure to be true in. The trouble is hidden in four words: quantifies over all subsets. That phrase is what makes second-order induction strong enough to exclude every impostor — and, as the next movement shows, it is exactly the phrase the first-order logic of Gödel and Tarski cannot say. Drop it, and the impostors flood in.
First-order arithmetic cannot pin down ℕ. By compactness, it has nonstandard models — full of infinite numbers, in which truths of ℕ go false. Truth is model-relative.
First-order induction is a schema: one axiom per definable property, not a single axiom quantifying over all subsets. That is a weaker net, and it cannot hold ℕ alone. The proof is a machine you can run. Introduce a fresh constant c and the axioms c > 0, c > 1, c > 2, …. Any finite batch of them is satisfiable in plain ℕ — just interpret c as a number bigger than the largest bound used. The compactness theorem then forces the whole infinite set to be satisfiable too — in a model where c is bigger than every numeral at once.
The model the machine produces is no curiosity. Every countable nonstandard model of arithmetic has the same shape: the standard ray ℕ, and then — past every finite number — a procession of ℤ-chains (each running …, c−1, c, c+1, … with no first or last), packed together as densely as the rationals, no chain first and no chain last. And the sentences change their minds across the gap. Since PA ⊬ Con(PA), the theory PA + ¬Con(PA) is consistent — so it has a model, a nonstandard one harboring a "proof of 0=1" of infinite length. In ℕ, arithmetic is consistent; in M, a number codes its refutation. True was never a property of the sentence alone.
It is not only arithmetic. By the downward Löwenheim–Skolem theorem, any consistent first-order theory in a countable language has a countable model — set theory included. So ZFC, if consistent, has a model with only countably many objects, even though ZFC proves there are uncountable sets. The resolution is exact and unsettling: the bijection that would count that model's "reals" exists outside the model, not within it. "Uncountable" is not absolute; it is relative to a model. The most basic notions of size — like the most basic notions of truth — recede when you formalize them.
To fix ℕ you ascend to a richer logic or theory — which has its own unfixed model. Grounding has no bottom, for the same shape of reason the ascent has no top.
The remedy is the one we already named: if first-order logic is too weak to pin down ℕ, use second-order logic, which by Dedekind does. But second-order logic exacts two payments, and together they end the hope of standing on solid ground.
payment one — no grip The logic strong enough to fix ℕ is exactly the logic with no effective hold on its own truths.
payment two — borrowed definiteness And the categoricity itself rests on an account that is empty. Second-order induction excludes the nonstandard models only by quantifying over all subsets of the domain — it presupposes that "all subsets of ℕ," the full powerset, is a single definite totality. But that is exactly what set theory cannot settle: the size of the powerset, the continuum, is independent of ZFC (Cohen, 1963), and ZFC has its own teeming multitude of models. The definiteness of ℕ was purchased with the definiteness of the powerset — and that, in turn, must be purchased one level up, in a set theory no more uniquely fixed than the arithmetic it was meant to ground.
To fix the model of a theory, interpret it in a richer metatheory. That metatheory has its own unfixed model — so it needs another beneath it. The regress descends without end.
Bedrock would be a theory that fixes its own intended model while staying first-order and effective — categorical, with an infinite model.
Set the two engines side by side and they are one. The Ascent: the operation add the soundness you lack has no fixed point — so no theory is complete, and there is no roof. The Descent: the operation add the strength to fix your model has no self-grounding base — so no first-order theory is categorical, and there is no floor. Both are the diagonal worn at the level of systems: the thing you reach for is unreachable from inside, and reaching from outside opens an outside without end. To demand a final proof is to ask negation for a fixed point. To demand a final ground is to ask the same question, turned downward.
the seam the dispute turns on This does not settle whether ℕ is "really" a definite thing. It locates, precisely, the seam where that ancient argument runs — and shows why neither side can dislodge the other.
The standard model is a definite reality the axioms grope toward. The unprovable truths are facts about ℕ that our formal nets fail to land — incompleteness is a limit on us, not on the numbers. We see that G is true.
"ℕ" is only ever specified by theories, and no theory we can write distinguishes it from its nonstandard rivals. To say G is "true" is to have already chosen a model the formalism cannot single out. The reference of ℕ is not pinned by anything we can say.
The Ascent found no roof: no system proves everything. The Descent finds no floor: no system fixes everything it means. Between a truth it cannot finish proving and a ground it cannot finish fixing, mathematics hangs — and holds. The standard model is real to the one who works in it and unreachable to the one who formalizes the reaching; both are right, because every net fine enough to catch ℕ catches infinitely much besides. No top, no bottom — and the suspension is the structure.