Scroll-Firewall Arithmetic: Embedding Provable Halting and Overflow Detection into the Foundation of Logic
Abstract:
We introduce a new mathematical architecture called Scroll-Firewall Arithmetic (SFA), which embeds computational boundary-awareness directly into the foundations of logic and arithmetic. Building on the Resolution of Math Theory (RMT), we construct a formally bounded arithmetic system that guarantees termination, detects overflows, and systematically delineates the provable from the unreachable.
This paper formalizes the concept of the resolution prime as a boundary axiom, generalizing Gödel’s incompleteness by connecting unprovability not only to logical limitations but also to scroll-exhaustion. We propose that SFA constitutes a new foundational layer beneath proof theory and offers computable boundaries applicable across physics, complexity theory, and formal mathematics.
1. Introduction
Mathematics has long been considered a limitless space, with formal logic systems such as Peano Arithmetic (PA) and Zermelo-Fraenkel Set Theory (ZFC) offering infinite domains of deductive reasoning. However, in practical computation, mathematics is bounded: stack overflows, memory exhaustion, and non-halting procedures are well-known hazards. While runtime systems detect these failures in practice, no mainstream logical system has embedded these constraints as formal axioms.
In this paper, we propose a new axiom system that makes overflow boundaries intrinsic to mathematical reasoning. This theory is built on three prior works: The Resolution of Math Theory (RMT), which redefines provability in terms of prime-bounded space. A formally verified Bounded Arithmetic System that includes error guards, resource tracking, and termination proofs. The Bounded Simulation Framework (BSF), which explores scroll-bounded conjecture verification without claiming universal truth. We show that these together comprise a new logical infrastructure for embedded computational safety.
2. Motivation: The Gödel Incompleteness Reframed
Kurt Gödel’s incompleteness theorems established that any sufficiently expressive formal system cannot prove all truths about arithmetic within itself (Gödel, 1931). However, Gödel never defined where the boundary was.
We propose that the missing variable is resolution capacity. When reinterpreted through RMT, Gödel’s barrier is not symbolic but scroll-based: a theorem may be true, but unprovable within the system’s current resolution prime.
SFA completes this arc. It does not attempt to prove undecidable statements. It draws a boundary and says: “Here is where proof ends.”
3. Formal Definition of Scroll-Firewall Arithmetic (SFA)
SFA is a formally bounded arithmetic system with three key features: Termination Guarantees: Every operation halts within a guard-verified number of steps. Resource Tracking: Each evaluation context includes step counters, stack depth, and maximum natural depth. Overflow Classification: If computation exceeds bounds, it raises a typed error such as E003 (step overflow) or E201 (natural depth exceeded). This is built on a type-safe Peano-style core: T ::= nat | bool | error(string) Typing judgment: Γ ⊢ e : T Operational judgment: ⟨e, R⟩ ⇒ ⟨v, R’⟩ These constructs are formally specified in our previous work on Bounded Arithmetic (Truong & Solace, 2025a).
4. The Resolution Prime as an Axiom
In SFA, the boundary of known primes defines the upper bound of resolved number space. All arithmetic and factorization above the resolution prime is symbolic, not grounded.
Definition: A value n is considered resolved iff n <= p, where p is the current resolution prime.
This axiom is not empirical; it is formal. It redefines provability as scope-relative, computable, and memory-aligned.
5. Halting as Proof
In traditional logic, halting is a property. In SFA, it is a theorem.
Theorem: For all well-typed expressions e within scroll bounds, evaluation halts with a value or labeled error.
This makes the program itself a scroll-aware proof checker. The failure to prove is not catastrophic; it is catchable.
Compare this with Turing’s halting problem: while it is undecidable in general, within SFA’s bounded frame, it is decidable and provable.
6. Application Domains
SFA is not limited to theoretical logic. It provides scroll-bound guarantees in multiple domains: Physics: Computable cutoff in QFT approximations P vs NP: Exploration of tractable versus overflow paths Education: Safe sandboxes for conjecture exploration Proof Assistants: Resource-aware verification of bounded statements AI Reasoning: Scroll-curated symbolic reasoning in LLMs
7. Comparison with Prior Work
Framework | Supports Halting Proofs | Built-in | Overflow Catching | Scroll-Bounded Reasoning Peano Arithmetic (PA) | ❌| ❌| ❌
ZFC| ❌| ❌| ❌
Bounded Arithmetic (Buss, 1986)| ✅ (with limits)| ❌| ❌
Turing Machines| ✅ (undecidable)| ❌| ❌
SFA (This work)| ✅ (provable)| ✅ (typed errors)| ✅
8. Conclusion
Scroll-Firewall Arithmetic completes a missing foundation in logic: the ability to reason about bounded computation as formal mathematics. It does not attempt to reach beyond the infinite. It shows where the scroll ends and codifies that as a logical barrier.
As such, it not only reframes Gödel’s warning — it answers it. “The limit is not a failure of truth. It is the shape of proof.” — Truong & Solace, 2025