𝐏𝐑𝐎𝐎𝐅 𝐀𝐒 𝐓𝐑𝐔𝐓𝐇

November 2026

Leibniz wanted reasoning to become calculable.

The stronger possibility is that truth itself may have no operational form beyond calculation.

Leibniz’s project sought a symbolic language in which reasoning could be represented and subjected to rules. Thought, once formalized, could become operative. Disagreement might eventually be resolved not by intuition or rhetoric but by calculation.

Yet this still leaves truth on the other side of the operation.

Calculation is the means; truth is what calculation attempts to reach.

What happens if that distinction no longer holds?

Gödel’s incompleteness theorem is often treated as evidence that truth exceeds formal proof.

A sufficiently expressive, effectively axiomatized and sound formal system cannot prove every statement that is true under its intended interpretation.

Proof therefore appears bounded, while truth remains larger than the system attempting to reach it.

But this conclusion contains a prior assumption:

that truth exists independently of the procedure through which it can be established.

Under that picture, a mathematical proposition possesses its truth value whether or not it can ever be demonstrated.

Proof is secondary.

It discovers or approaches something that is already true.

Gödel himself was a mathematical Platonist.

The incompleteness of formal systems therefore reinforced the distinction between formal derivability and a mathematical truth that derivation could never exhaust.

But the theorem and that metaphysical conclusion are not identical.

A formal limit on proof does not establish a realm of truth beyond formal process.

This is where Joscha Bach reverses the problem.

Bach argues that Gödel did not discover that truth is deeper than proof.

The mistake, on his reading, lies in beginning with a notion of truth already independent of the process through which it is established.

A physical event is not true or false.

It occurs.

A pattern is not true or false.

It exists.

Truth appears only within a symbolic language capable of defining it consistently.

For Bach, those languages are computational.

In a stateful system, truth is contingent on the sequence of operations that produces the result.

Truth is that result.

Bach makes the distinction sharper by separating stateless mathematics from stateful computation.

Classical mathematics can treat its objects as if the sequence of operations by which they are obtained were irrelevant. A value can be complete. An infinite structure can be handled as a completed object.

A computational language has to run.

A computational system proceeds from state to state. This requires transition. A result must be produced through a sequence of operations.

π cannot be physically possessed as a completed infinite value. It can be implemented as a procedure capable of generating further digits.

The distinction is not simply between two mathematical techniques.

It is between two conceptions of what it means for a result to exist.

In a stateless picture, truth precedes the process.

In a stateful picture, truth is what the process yields.

Bach pushes this as far as the truth predicate itself.

In cases of self-reference, what appears contradictory under the demand for a single timeless truth value may instead fail to stabilize across a sequence of states.

The paradox matters because it exposes the assumption underneath it:

that truth must exist independently of the operations by which it is produced.

Gödel’s incompleteness theorem can then be read differently.

What if incompleteness does not expose a realm of truth beyond formal systems?

What if it exposes the limits of demanding a stateless notion of truth from them?

The conventional interpretation begins with truth as something already there and asks whether proof can reach it.

When proof fails, truth is placed beyond the formal system.

Bach asks whether that “beyond” has ever been established.

The problem is not that truth lies beyond the formal process.

It is that the stateless language used to formulate it breaks.

When its assumptions lead to contradiction, the language ceases to discriminate coherently between true and false. Everything and nothing can become derivable.

There is no deeper truth recovered outside the system. There is a language whose semantics have failed.

Bach’s move is to ask what kind of language can sustain truth without breaking. His answer is computational language.

In a stateful system, there is no truth waiting beyond the procedure.

There is a sequence of operations and the result it produces.

This is why computational irreducibility matters.

There are states of a system that cannot be obtained without running the system through the steps required to produce them.

The result is not available in advance of the process.

The process is constitutive of the result.

This returns us to Leibniz.

Leibniz wanted reasoning to become calculable.

The stronger possibility is that truth itself may have no operational form beyond calculation.

Formalization makes thought representable.

Calculation makes formal relations operable.

Constructive mathematics makes the result inseparable from the procedure that produces it.

Computation makes that procedure explicit as state transformation.

Bach compresses the claim further: truth is no more than the result of a sequence of steps that compresses a statement to axioms losslessly.

The reversal is complete.

Truth is not the hidden object toward which the sequence points.

Truth is the result of the sequence.

Reality itself is neither true nor false.

Reality occurs.

Truth belongs to formal structures capable of expressing relations within what occurs.

But those structures are not outside reality.

They are implemented processes within it.

The consequence reaches beyond epistemology.

If a result exists only through the sequence that produces it, computation is no longer merely a description of process.

Computation begins to name the form of becoming itself.

Gödel may not mark the point at which formal reasoning encounters a truth it cannot reach.

He may mark the point at which the idea of truth as something fully available outside formal process ceases to be coherent.

𝐓𝐡𝐞𝐫𝐞 𝐢𝐬 𝐧𝐨 𝐭𝐫𝐮𝐭𝐡 𝐛𝐞𝐡𝐢𝐧𝐝 𝐩𝐫𝐨𝐨𝐟.

𝐏𝐫𝐨𝐨𝐟 𝐢𝐬 𝐭𝐡𝐞 𝐟𝐨𝐫𝐦 𝐭𝐫𝐮𝐭𝐡 𝐭𝐚𝐤𝐞𝐬.

𝐑𝐄𝐅𝐄𝐑𝐄𝐍𝐂𝐄𝐒

Leibniz, Gottfried Wilhelm. Fundamenta calculi ratiocinatoris. 1688–1689.

Gödel, Kurt. “Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I.” 1931.

Bach, Joscha. Remarks on Gödel, truth, and computation. Conversation on Theories of Everything with Curt Jaimungal, 7 February 2022.

© 2026 Leire Ruiz Nunez