LarsenClose/Lean_On_Me: Self-Contained Proof Chain from Retraction to Classical Nonclosure

Read full text Summarise with VIRAT
Authors: Larsen James Close
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

Machine-verified formalization in Lean 4 with Mathlib v4.28.0. Self-contained single-file proof chain from the retraction law to the three cannots for classical computation. One import (Mathlib.Tactic), no cross-repo dependencies. Defines GradedReflModel, proves idempotence of selfApp, the invariant substrate, universal witness search, the transport model (selfApp = id for any M), and the regime classification. Instantiates the classical carrier (binary strings, drop/prepend with positive-length header) and proves the conjunction: irreducible naming cost (Group B), no FoldUnfoldSection from T(M) to classicalGRM (structural return blocked at the weakest level), and super-polynomial resource gap. Fully instantiated at a concrete header with no hypotheses. Framework is open: Group C is inhabited, zero-length headers have no obstruction. 509 lines. Zero sorry. Zero custom axioms. Complete theorem inventory in CLAIMS.md.

Fields of Study & Subjects

Logic programming and type systems Computability AI Algorithms semigroups and automata theory

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
22 March 2026
Language
EN