Classical Logic without Bivalance

Sandqvis’s semantics for classical logic without bivalence resolves the question of an anti-realist account of classical reasoning after Dummett. This paper applies the framework to the essential questions of metamathematics. The system intuitively handles $\omega$-incompleteness, makes induction meaning-constitutive, and yields an elementary consistency proof for Peano Arithmetic using only ordinary induction on the natural numbers, with no appeal to transfinite ordinals or recognition-transcendent truth.