`CompilationAsRecognition`

definition

show as: view math explainer →

module: IndisputableMonolith.RRF.Foundation.SelfReference
domain: RRF
line: 172 · github
papers citing: none yet

open explainer

Generate a durable explainer page for this declaration.

open lean source

IndisputableMonolith.RRF.Foundation.SelfReference on GitHub at line 172.

browse module

All declarations in this module, on Recognition.

explainer page

Tracked in the explainer inventory; generation is lazy so crawlers do not trigger LLM jobs.

open explainer

depends on

used by

formal source

 169When Lean type-checks this file, it is performing a recognition:
 170verifying that the propositions are consistent with the type theory.
 171-/
 172structure CompilationAsRecognition where
 173  /-- The code being compiled. -/
 174  code : LeanCode
 175  /-- Compilation succeeds. -/
 176  compiles : TypeCheckResult
 177  /-- Success means the propositions are recognized as valid. -/
 178  recognized : Bool
 179
 180/-- This compilation is a recognition event. -/
 181def this_is_recognition : CompilationAsRecognition := {
 182  code := { source := "SelfReference.lean", module := "RRF.Foundation.SelfReference" },
 183  compiles := .success,
 184  recognized := true
 185}
 186
 187
 188/-- Recognition event exists. -/
 189theorem recognition_event_exists : Nonempty CompilationAsRecognition :=
 190  ⟨this_is_recognition⟩
 191
 192/-! ## Summary -/
 193
 194/-- The complete self-reference structure. -/
 195structure SelfReferenceComplete where
 196  /-- The Meta-RRF exists. -/
 197  meta_rrf : MetaRRF
 198  /-- It's a fixed point. -/
 199  is_fixed_point : DescriptiveFixedPoint
 200  /-- It's internally consistent. -/
 201  is_consistent : InternalConsistency
 202  /-- Compilation is recognition. -/

papers checked against this theorem

No papers in the current corpus map onto this theorem yet.