Abstract: Any continuous completed block time (where all truths co-exist timelessly as actually true) forces consequential outcomes to exist without generative realization—creating logical contradiction with threshold computational irreducibility (e.g., Sudoku constraint-resolution work). The proof is domain-neutral and blocks common escapes.
Central Puzzle: Consider a Sudoku puzzle with a unique solution. Even efficient algorithms must perform some constraint-verification work that cannot be eliminated—checking that numbers satisfy row/column/box constraints and ruling out invalid placements. In a timeless block universe H: ℝ → S, where does this irreducible verification work live? If H timelessly specifies “solved grid” at H(t_final), how is this outcome fixed as the unique valid solution without performing any constraint-resolution work whatsoever?
Visual Comparison:
Generative (allowed): t₁ → t₂ → … → tₙ → [constraint checks] → Solved Sudoku
Timeless Block (question): H: ℝ → S with "Solved Sudoku" already there at t_final
↑
Either the exclusion structure is present (and computation is in the block)
or it isn't (and 'solved' is uninterpreted as mere arrangement)Core Thesis: Continuous completed block time—targeting the common eternalist thesis that “all truths are equally actual; becoming is not ontological” combined with continuous temporal parameterization—cannot accommodate processes with threshold irreducibility. This creates formal logical incompatibility, not mere conceptual tension.
Formal Strategy: Establish axioms about foundational versus consequential truth, derive strengthening lemmas, then prove theorem showing continuous completion forces logical contradiction.
Key Definition - Performed Computation: The constraint-resolution work required to eliminate inconsistent possibilities and fix an outcome as the unique solution. Even with efficient algorithms, this work has a threshold of irreducibility—it can be optimized but not eliminated entirely. This is not temporal execution but ontological exclusion—the informational work that rules out alternatives must exist somewhere as an ontological fact, whether enacted dynamically or encoded statically.
Constraint-Fixing Irreducibility: The uniqueness of a solution cannot be established without non-eliminable exclusion/verification structure. For many natural families of nontrivial constraint-satisfaction instances (including NP-complete families), establishing uniqueness tends to require search-like exclusion of alternatives.
Formal Target: Let Solved(G,C) mean “Grid G satisfies constraints C and G is the unique completion consistent with the clues.” The central puzzle concerns Solved(G,C) being actual, not mere constraint satisfaction.
Critical Warning - Primitive Exclusion Collapse: One cannot escape this argument by declaring exclusion facts “primitive” or “brute.” Making constraint-exclusions primitive destroys the foundational/consequential distinction entirely—if all exclusions just “exist” without work, then all consequential truths become foundational-by-brute. This collapses the distinction into meaninglessness and commits one to saying that everything is foundational, which makes “solution” vs “arbitrary arrangement” an empty distinction.
Foundational truths (axioms, rule-sets, initial conditions) may exist timelessly as potential structure. Consequential truths are generated from other truths via entailment processes and require generative realization for actual truth.
This argument targets any view that (i) treats consequential truths as actually co-existing timelessly, and (ii) denies that any entailment/exclusion structure is constitutive of those truths. This applies across domains (physical spacetime, divine intellect, Platonic realm, modal space) without exemptions for the views under analysis.
Dependency Structure: The logical chain proceeds: (L2) truthmaker bridge principle → (L3) no free actuality → (L4) constitutive dependence creates asymmetry → (L6) timeless co-existence eliminates constitutive dependence → (L7) completed specification forces co-existence → therefore contradiction with (L1/L8).
If outcome O exhibits threshold irreducibility (requiring constraint-resolution work that can be optimized but not eliminated), then O is consequential truth requiring generative realization for actual truth rather than foundational truth existing through structural specification.
Proof: Threshold irreducibility means O’s truth depends on constraint-resolution work that, while optimizable through efficient algorithms, cannot be completely eliminated—some verification/exclusion work remains necessary. This makes O consequential (dependent on this irreducible core of constraint-resolution) rather than foundational (derivable from axioms alone without any resolution work). The residual work-dependence makes O consequential by Axiom 1. ∎
If proposition P is consequential (depends on entailment/transformation from other truths), then P’s actual truth requires a truthmaker containing the relevant entailment structure, not mere static correlation.
Proof: If you want your talk of “consequential” to mean anything, you don’t get consequential actuality for free. If P’s truthmaker contains only static mapping H(t) = P with no constitutive entailment structure, you’ve reclassified consequential truths as foundational-by-brute. This collapses the foundational/consequential distinction (Axiom 1) entirely, making “consequential” an empty category. To maintain semantic coherence, P’s truthmaker must include the entailment structure doing the generative work. By Axiom 2 (scope), this requirement applies in any domain without exception.
Optional Commitment: This is the bridge from formal derivability to ontological generation. Denying this lemma forces collapse of ontological irreducibility into epistemic irreducibility—making “derived” purely epistemic rather than ontological. The cost: adopting purely extensional semantics where constraint-resolution work has no ontological reality. ∎
If P is consequential, then P is not actual unless its truthmaker includes the generating entailment/exclusion structure.
Proof: Immediate from Lemma 2 (Truthmaker Bridge Principle). ∎
Remark: This establishes that potential truth (specified by foundational structure) does not entail eternal actual truth. Actual generated consequential truths cannot co-exist timelessly prior to generative realization that constitutes their truthmaking.
If the actuality of T₂ constitutively depends on the realization of T₁, then the domain containing that dependence has an asymmetric order relation T₁ ≺ T₂.
Proof: Constitutive dependence is asymmetric by definition—if T₂ depends on T₁ in the truthmaking sense, the dependence relation cannot be reversed without changing its nature. Any domain containing real asymmetric dependence must contain a real ordering relation. For any view in the target class (Axiom 2), this ordering requirement applies to domains containing actual consequential truths. Therefore, constitutive dependence induces ontological ordering, not merely descriptive correlation.
Rejection Cost: Denying this lemma commits you to “dependence without asymmetry”—an incoherent position where T₂ depends on T₁ but no ordering exists between them. ∎
If realization of consequential truth T₂ depends on realization of T₁, the domain in which realization occurs is ordered with respect to T₁ and T₂. Purely logical or descriptive ordering is insufficient for generative realization; if new truths become actual, the ordering is ontological, not merely conceptual.
Proof: By Lemma 4, constitutive dependence creates asymmetric ordering. Generative realization requires actual actualization sequence where T₁ becomes actual, then T₂ becomes actual through the generative process. Purely logical ordering (like mathematical structure H: ℝ → S) provides only structural correlation without actual actualization sequence. By Lemma 2, consequential truths require truthmakers with entailment structure, not mere correlation. Therefore, any domain containing generative realization must exhibit ontological ordering through actual before/after asymmetry in actualization. ∎
If all actual generated consequential truths co-exist timelessly within any domain, then no generative realization occurs within that domain—consequential truths exist without the constitutive entailment processes required for their actual truth.
Proof: By Lemma 2, consequential truths require truthmakers containing entailment structure. Timeless co-existence makes all truths exist through the same mechanism (domain specification), eliminating the asymmetric generative dependence required by Lemma 4. This violates the truthmaking requirement for consequential truths. ∎
Completed block time H: T → S (whether continuous or discrete)—any domain where all consequential truths co-exist as actually true without generative ordering—makes all computational outcomes actually true simultaneously, eliminating generative dependence.
Proof: For any computational sequence s₁ → s₂ → … → s_N resulting in outcome O, function H: T → S must specify H(t_N) = O timelessly as part of its total specification. This makes O exist through H’s mathematical structure rather than through the generative sequence required by Lemma 2, violating the truthmaking requirement for consequential truth O. By Lemma 5, this eliminates the ontological ordering required for generative realization. ∎
Let O be outcome of threshold-irreducible constraint-resolution process (like a uniquely solved Sudoku). No timeless domain can render an ontologically irreducible outcome O actually true as the unique solution without either (a) containing the irreducible core of constraint-resolution/exclusion work or (b) collapsing irreducibility by permitting a shortcut. A domain that merely “contains” the completed outcome without verification structure has not fixed O but only selected one arrangement among many.
Proof: By Lemma 1, O is consequential truth requiring constraint-resolution for actual truth. A fixed outcome with threshold irreducibility means the irreducible core of exclusion work has been performed—even efficient algorithms must verify constraints and rule out alternatives. If a timeless domain makes O actually true without containing any verification structure, then either: (a) O is not actually fixed (no exclusion work performed), or (b) the domain contains the irreducible core of constraint-resolution work, or (c) the threshold irreducibility is denied entirely. Options (a) and (c) contradict the assumption that O is a fixed threshold-irreducible outcome. Therefore option (b): the domain must contain the performed computation as ontological exclusion work. By Axiom 2, applies to any domain under analysis. ∎
A consequential truth cannot be actually true prior to the realization of the entailment that generates it.
Proof: Direct consequence of Lemma 3 (No Free Actuality). If consequential truth T exists actually before its generating entailment is realized, then T co-exists timelessly with its generating conditions, violating Lemma 3’s prohibition on actuality without constitutive structure. ∎
Completed block time H: T → S (whether continuous or discrete) cannot accommodate processes with threshold irreducibility because it forces timeless co-existence of all actual consequential truths, eliminating even the irreducible core of constraint-resolution work required for their actual truth.
Proof:
Let O be computational outcome requiring exactly N irreducible steps (Lemma 1: O is consequential truth requiring generative realization for actual truth).
By Lemma 2 (Truthmaker Bridge Principle), O’s actual truth requires a truthmaker containing the relevant N-step entailment structure, not mere static correlation.
Completed block time H: T → S must specify H(t_final) = O timelessly (by definition: domain where all consequential truths co-exist as actually true).
By Lemma 7 (Completed Global Specification Forces Co-existence), H forces O to exist actually through timeless specification rather than through N-step generative sequence, violating the truthmaking requirement from step (2).
By Lemma 8 (Anti-Representation), H cannot make O actually true as a fixed outcome without either containing the irreducible core of constraint-resolution work or collapsing irreducibility—contradicting the timeless specification claim.
Therefore: O is both actually true (H’s timeless specification) AND cannot be actually true without constraint-resolution structure (Lemmas 2, 7, 8).
Logical contradiction. ∎
Strategic Note: Rejecting this conclusion forces eternalists to choose between semantic coherence and their position. They must explicitly deny either:
Each denial is a visible, expensive metaphysical move rather than a technical objection.
The Epistemic Collapse Trap: If eternalists claim “the block just IS the solved Sudoku,” they must accept that the block contains, as ontological fact, the exclusion of all invalid grids. This exclusion work IS the performed computation—they’ve implicitly accepted option (C) in the trilemma. There is no escape through epistemic reduction because constraint-exclusion is structural, not epistemic.
Response: Violates Axiom 1 and Lemma 2. See Lemma 7.
Response: Misapplies Axiom 1. π is foundational truth via axioms; irreducible constraint-resolution outcomes like uniquely solved Sudokus are consequential truths requiring elimination work to fix the solution (Lemma 8). The completed grid exists as one logical possibility among many; what requires work is the exclusion of all other possibilities.
Response: Abandons the ontological reality of irreducible constraint-resolution cores. Violates Axiom 2 (scope) (domain neutrality) by claiming consequential truths with threshold irreducibility exist as foundational truths without any verification work.
Response: Destroys the foundational/consequential distinction entirely. If constraint-exclusions are primitive rather than generated, then all consequential truths become foundational-by-brute, collapsing the distinction into meaninglessness. This commits one to saying that “solved Sudoku” vs “arbitrary number grid” is a primitive distinction rather than one established through constraint-verification work. The metaphysical cost is accepting that everything is foundational.
C1. Determinism Compatibility: Deterministic laws (foundational truths) compatible with discrete generative realization.
C2. Divine Foreknowledge: Omniscience as potential structure permitted; actual co-existence of generated truths in divine intellect violates Axiom 2.
C3. Relational Implication: Threshold irreducibility preserves genuine freedom for authentic ‘yes’ or ‘no’ in relationship, supporting open/relational theism over classical eternalist models where outcomes are timelessly fixed.
C4. Domain-Neutral Application: By Axiom 2 (scope), any domain (Platonic, divine, modal, physical) claiming timeless co-existence of actual generated truths cannot accommodate ontological computational irreducibility.
C5. Continuous vs Discrete Completion:
Why Discreteness Alone Cannot Save Completed Eternalism: A discrete but completed block time that timelessly specifies all computational outcomes at discrete points still makes outcomes actually true through structural specification rather than generative realization. Lemma 7 applies equally: discrete global specification H: {t₁, t₂, …} → S making irreducible outcome O actually true at t_final must encode the computation or collapse irreducibility. Discreteness changes representation but not the fundamental specification problem.
Any view that rejects constraint-resolution actuality by treating all consequential truths as timelessly foundational thereby denies ontological irreducibility. Given Lemma 7, there is no coherent position in which irreducible outcomes are both (a) fixed as actual truths and (b) not resolved via equivalent exclusion work.
One must deny either:
(A) Threshold irreducibility (constraint-fixing work has no ontological reality), or (B) Continuous completed block time (not all truths are equally actual), or (C) Computation-free specification (accept the block contains performed computation)
Interpretations:
Note: (C1) is not an escape hatch; it is an admission that the block is computation-laden. A timeless block doesn’t remove computation; it relocates it into structure.
Note: “Rejecting generative truth” falls under option (A). No fourth option is coherent.
Thus, any theory preserving continuous completed block time must either deny ontological computational irreducibility or accept that the block contains performed computation.
Work-Structure Non-Equivalence: Mathematical structure encoding final states ≠ constraint-resolution work that excludes alternatives (Lemma 7). A completed Sudoku grid without any verification structure is not a fixed solution but one number arrangement among many possible grids. Even efficient algorithms must perform the irreducible core of constraint-checking work.
Eternalist Responses:
Physics: Landauer’s Principle, Assembly Theory, and Quantum Computation all support work requirements for computational outcomes.
Compatible Frameworks: Growing Block Theory, Discrete Substrates, Process Ontology may preserve computational generation.
Research Direction: Discrete generative models (causal sets, growing blocks) remain open—they avoid completed precomputation.
Read and subscribe on Substack