Actus Specialis — Pre-Zero Foundation

Actus Specialis — Pre-Zero Foundation 道可道, 非常道;名可名, 非常名 “The Dao that can be spoken is not the constant Dao; the name that can be named is not the constant name. ”— Laozi, Dao De Jing, Chapter 1 Actus Specialis asks a simple but fundamental question: what must happen before a system can meaningfully produce zero? Mathematics and computation usually begin after zero, bit, point, position, distinction, and classification are already available. They may legitimately treat these objects as primitives inside an established formal system, but they do not normally ask how the system first becomes capable of using them. Actus Specialis addresses this earlier structural problem, called the pre-zero problem. The central claim is that zero is not an ontological beginning. Zero is the result of a classification. Before a system can lawfully say “zero, ” something must occur, the occurrence must enter an order, the ordered process must reach a bounded completion, and its consequence must remain accessible as a trace. That trace must then become localizable, remain held as a position, enter into relation with another position, and preserve a difference that can be classified. Only after this sequence has been completed can zero, one, a bit, or another digit appear as a stable numerical output. The dependency chain is: AS → Actus Specialis → Ordered sequence in τ → Transition → Trace → Point → Position → Relation → Third Position → Distinction → Classification → Zero / Bit / Digit Here, AS means Absolute Something. It is a minimal formal reference to an unclassified ground and is not identified with zero, emptiness, matter, energy, information, God, Dao, or any other completed doctrine. Actus Specialis is the first admissible act in the theory. The theory then derives transition, trace, point, position, relation, distinction, classification, and numerical projection in their required order. The final principle is: NO ZERO PRECEDES CLASSIFICATION. This principle does not reject zero or challenge its ordinary use in mathematics. It states that zero can become meaningful only inside a system that already has a domain, a reference, a boundary, an available distinction, and a rule for classification. A computer output of zero may mean an empty register, a successful termination, a failure, an absent signal, a reset state, or an unknown result. The visible symbol may be identical while the full underlying states remain different. This difference is expressed by the principle of projection non-identity: π (Q) ≠ Q, unless identity is separately proven. A projection of a state is not automatically the whole state. Two different full states may produce the same visible result: π (Q₁) = π (Q₂) ⇏ Q₁ = Q₂. For example, two bank accounts may both display a balance of zero, although one has never been used, another has completed a long sequence of transactions, and a third has been frozen. Their visible values are equal, but their histories, risks, and admissible future operations are not. In the same way, knowing the present state of a system does not by itself determine its future trajectory: Q (τ₀) ⇏ Q (τ): τ > τ₀. The theory has direct relevance to artificial intelligence and computational architecture. Many systems are required to produce a definite answer even when their evidence is incomplete, inconsistent, unavailable, or unverifiable. When a system is forced to classify before it possesses sufficient trace and a stable distinction, it may generate an unsupported answer or collapse an unfinished state into zero, falsehood, failure, null, or termination. The structural condition is: insufficient trace + mandatory classification + no lawful unresolved state → forced closure To prevent this failure, Actus Specialis introduces HOLD, a lawful unresolved state in which classification is postponed while source trace, boundary conditions, pending evidence, and admissible continuation are preserved. HOLD does not mean arbitrary indecision. It is a bounded operational status that records why closure is not yet justified and what must occur before the process can continue. The same structure appears in distributed systems. A transaction may be prepared while remaining neither committed nor aborted: PREPARED ≠ COMMITTED PREPARED ≠ ABORTED A coordinator, durable decision record, or equivalent validating mechanism must hold the relation until lawful closure becomes possible. This operational function corresponds to the Third Position, which preserves and validates a relation without collapsing into either side. The theory therefore explains why premature binary closure can produce inconsistency, data loss, and unstable system behavior. The formal foundation contains 12 axioms, 18 definitions, 12 theorems, 3 rules, and one Final Principle. Block I, Incoming Formation, establishes the primacy of act, the system’s own temporal order, transition closure, and trace necessity. Block II, Crystallization, derives point, position, relation, and the priority of distinction over classification. Block III, Closure, establishes that classification is itself an act, that stable classification requires a non-collapsed Third Position, that zero, bit, and digit are late projections, and that the formal problem passes to Zero Foundation when Pre-Zero Closure is reached. This revised Academic Edition presents the same mathematical architecture in a more readable form. The formal core remains unchanged, while the explanation of the dependency chain, the glossary, operational examples, treatment of HOLD, comparative evidence, technical applications, navigation, and authorial afterword have been expanded and reorganized. The complete mathematical foundation, including the axioms, definitions, theorem statements, proofs, rules, and formal closure, is preserved in Appendix A. The corpus position is: Actus Specialis → Zero Foundation → Zero Principle → Digits Principle → Theory of Projection Transformation Actus Specialis explains how a lawful zero projection first becomes possible. Zero Foundation begins after zero has become admissible and examines why equal projected zeros do not necessarily represent identical full states. Author: Andrey Stanko · ORCID: 0009-0002-8081-6917 · CC BY 4. 0 · 2026Corpus Root DOI: 10. 5281/zenodo. 19108892 · keelcore. org