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:11:08.902Z (not original authorship).
Formalized: 2026-10-03T10:37:05.082Z.
Checked: 2026-10-03T10:37:43.359Z.
Independent timestamp: 2026-10-03T10:42:55.000Z.
Authored source SHA-256: 89b07f0baabcfe1b6518306e58ae5c4da75df51e58367187132d58f25c21bb35
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.source_identity_rule' does not depend on any axioms
{P, P -> Q, Q -> R, R -> S} |= (P & Q) & (R & S)
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.
A is A
The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.
P: CH invalidly says set S may not exist as S.
Q: CH -> ~((A is A) & (S -> S)); (CH -> ~S) -> (S -> ~CH)
R: S -> S |= S -> S
S: Flaws (ie - ZFC; ~(Logos = Axiom)) |= CH’s denial of A is A. S is valid. CH is CH in absurdity.
{P, P -> Q, Q -> R, R -> S} |= (P & Q) & (R & S)