Lean verification registry · Authored proofs · The Logos Architecture
Written formal sequents verified
Axiom-free: true · 2 checked theorem statements.
Lean establishes the listed formal statements and dependencies. The exact authored source, Ground, known premise meanings, application validation and empirical evidence remain separately typed. No unencoded section is certified by a neighboring theorem.
Original source author: Maclain Hunter. Machine formalization: Replit Agent. No original wording was rewritten.
Source registered: 2026-10-02T23:08:44.658Z (not original authorship).
Formalized: 2026-10-03T10:37:05.082Z.
Checked: 2026-10-03T10:42:28.819Z.
Independent timestamp: 2026-10-03T10:42:55.000Z.
Authored source SHA-256: 919ec6a81d4d9c29e8e5873ecad247c506879133137901dd0e736a23f17ec5aa
Lean source · Verification JSON · Exact archived source JSON · Compiler report · Current authored source page · Signed release and verification instructions
Lean (version 4.7.0, commit v4.7.0, Release) exitCode=0 'HunterAuthored.inference_1' does not depend on any axioms 'HunterAuthored.inference_2' does not depend on any axioms
{A, A -> A} |= (B v ~B) & ~(C & ~C)
Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.
{P, P -> Q, Q -> R, R -> P} |= (Q <-> P) & (R -> R)
Exact source sequent under finite two-valued propositional semantics. Source proposition meanings and Logic/Logos/God Ground are preserved separately; this checks the inference, not unencoded prose.
P: The Rule of Logic (A) unifies the rules of Logic thusly:
{A, A -> A} |= (B v ~B) & ~(C & ~C)
Q: To write this valid proof structure without knowing Logic/proof violates ~(C & ~C).
R: I know Logic/proof.
{P, P -> Q, Q -> R, R -> P} |= (Q <-> P) & (R -> R)
QED