Machine-checked Lean 4 proofs for "Recursive Language Models Through the Admissibility-Dynamics Framework." Covers RLM sub-call architecture, three sufficient conditions for bounded-inconsistency deployment (safe abstention, bounded-decomposable predicates, runtime depth verification), training class closure, and the deployment-boundary synthesis.

• Updated May 19, 2026
• Lean

Machine-checked Lean 4 proofs for "Language Model Hallucinations: An Impossibility Theorem and Its Architectural Consequences." Covers Theorem 1 (impossibility of guaranteed consistency), certification-depth lower bounds, mitigation boundaries for CoT / grammar / rerank, and intrinsic/extrinsic DCF taxonomy.

• Updated May 19, 2026
• Lean

Machine-checked Lean 4 proofs for "Projection Insufficiency and Trajectory Realization." Establishes that no function on a non-injective projection can recover a trajectory-dependent property, with specializations to language-model hallucination, planning, RL, POMDPs, and constraint propagation.

• Updated May 19, 2026
• Lean

A Constructive Formalization of Discrete Entanglement-Geometry Duality in Cubical Agda

• Updated Apr 19, 2026
• Agda

Lean 4 + Mathlib formalization of the Λ aggregator — Λ uniqueness as Conjecture 1 (not a closed theorem). 749 declarations · 14 axioms · 163 tracked sorries. Backs the SZL governance gate. Doctrine v11 LOCKED · DOI 10.5281/zenodo.20434308

• Updated Jun 17, 2026
• Lean