The Fixed-Point and Consistency Engine: A Referee for Self-Referential Systems, Built from Thirty-Three Proven Laws
Year: 2026
Type: preprint
Abstract: A self-referential system is a system that talks about itself: a sentence that says 'this sentence is false', a rule that updates itself, a walk that reads its own fresh footprints. Such systems can settle to one answer, explode into infinitely many answers, or admit no answer at all — and telling those three cases apart by staring at the rule does not work. This paper builds the machine that tells them apart. The engine takes a self-referential system as input and returns one verdict: HOLDS (the system settles, certified by a theorem, with its fixed points named exactly), FLOODS (the system admits a whole interval of answers and selects nothing — a real vulnerability, not a numerical artefact), REFUSED (a proven law of the program forbids the request as written, with the law and the reason named), or UNGRADEABLE (the system cannot be cast in the classification's terms, named, never forced). Alongside the verdict it returns the exact numbers, the laws applied, and the cheapest next test — a compact payload a paired artificial intelligence can consume as premises and continue from. That last part is the engine's second job: it is built to pair with an AI as a focuser. What is new here is the machine itself, not the laws: the thirty-three laws it implements were proven elsewhere and are cited to their print home, the third edition of Thirty-Three New and Novel Laws of Mathematics (Zenodo record 24215717). What this paper proves in full, in its own pages, is the engine's own new material: the closed-form hitting-time law for the Curry conditional (Section 5.1), the resolution of the sealed census figure of 1,599 cells (Section 5.2), the exact reproduction of the torus sweep numbers (Section 5.3), the theorized input schema for the exact-zero theorem (Section 5.4, labelled THEORIZED, with its gap stated), and the verification of the two-adic union construction (Section 5.5). Everything the engine claims, the gate in Section 6 re-checks by independent exact computation, and Section 7 tries to kill both the engine and the gate. What the engine cannot do is stated in Section 8, in the paper itself, not buried: the mode-sum behind the exact-zero theorem is not in hand; one half of one consistency claim rests on a cited anchor rather than a re-run; and laws 34 through 56 of the census are not built here.
Author: Baillargeon, Adrian Alan
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7237260267
