The Guarded Line: What Metacircular Proof Theory and Self-Model Dynamics Share

Formal calculi capable of hosting their own reduction divide by a clean triangle. In the hosted case, reduction terminates: cut elimination for sequent calculi, normalization for natural deduction, strong normalization for the simply typed λ-calculus. Under self-application through the untyped fixpoint, termination is lost; the system can always take one more step and need never deliver anything. With the guarded fixpoint — recursion through the later modality — termination is deliberately given up and replaced by something better behaved: productivity, one constructor per interval. Dynamical systems that represent their own states divide by a corresponding triangle: dissolution (reduction to a normal form carried by a host), the retention loop (self-examination kept in play, converging on a holdable self-representation), and the interval structure that keeps self-examination stable instead of divergent. This paper states, as a thesis with a proof sketch, a structural correspondence between the two triangles, and traces the single line that runs through all three vertices — the guarded line: in proof theory the later modality, in the dynamics the interval. The formal side is developed with machine-checked anchors in a companion Lean 4 mechanization of a sorted linear λ-calculus with guarded recursion; the dynamical side is developed from a control-theoretic model of self-monitoring systems whose thresholds are derived and unfitted. The correspondence types the self-model as a lens rather than a noun (guarded machinery, sustained one interval at a time), assigns the model's thresholds the role of semantic values — dynamical denotations of proof-theoretic distinctions — and predicts nothing about any mind. The paper closes with structural analyses of historical figures who reached self-reference without metacircular representation and were held by external containers: the evidence that the correspondence is not a restatement of the contemplative literature it must be distinguished from.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-12
DOI
https://doi.org/10.5281/zenodo.24148640
Primary Topic
Logic, programming, and type systems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Guarded Line: What Metacircular Proof Theory and Self-Model Dynamics Share

Jaye Timothy Marshall
Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
preprint

The Guarded Line: What Metacircular Proof Theory and Self-Model Dynamics Share

Jaye Timothy Marshall
preprint en

Abstract

Formal calculi capable of hosting their own reduction divide by a clean triangle. In the hosted case, reduction terminates: cut elimination for sequent calculi, normalization for natural deduction, strong normalization for the simply typed λ-calculus. Under self-application through the untyped fixpoint, termination is lost; the system can always take one more step and need never deliver anything. With the guarded fixpoint — recursion through the later modality — termination is deliberately given up and replaced by something better behaved: productivity, one constructor per interval. Dynamical systems that represent their own states divide by a corresponding triangle: dissolution (reduction to a normal form carried by a host), the retention loop (self-examination kept in play, converging on a holdable self-representation), and the interval structure that keeps self-examination stable instead of divergent. This paper states, as a thesis with a proof sketch, a structural correspondence between the two triangles, and traces the single line that runs through all three vertices — the guarded line: in proof theory the later modality, in the dynamics the interval. The formal side is developed with machine-checked anchors in a companion Lean 4 mechanization of a sorted linear λ-calculus with guarded recursion; the dynamical side is developed from a control-theoretic model of self-monitoring systems whose thresholds are derived and unfitted. The correspondence types the self-model as a lens rather than a noun (guarded machinery, sustained one interval at a time), assigns the model's thresholds the role of semantic values — dynamical denotations of proof-theoretic distinctions — and predicts nothing about any mind. The paper closes with structural analyses of historical figures who reached self-reference without metacircular representation and were held by external containers: the evidence that the correspondence is not a restatement of the contemplative literature it must be distinguished from.

Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon