Lean verification registry · Authored proofs · The Logos Architecture
Verified sequents with unresolved formal parts
Axiom-free: false · 1 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: not established (not original authorship).
Formalized: 2026-10-03T10:37:05.082Z.
Checked: 2026-10-03T10:37:23.516Z.
Independent timestamp: 2026-10-03T10:42:55.000Z.
Authored source SHA-256: 8c5b22fe03debca9b8a0f493eed18819959fa416ddc0b7987424033a163fbad1
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.magnitude_and_commutative' depends on axioms: [propext]
Formal statement: ∀a,b ∈ MCBExponent: AND(a,b) = AND(b,a)
Commutativity of the displayed integer sign-times-recursive-minimum-magnitude realization. The minimum and zero behavior are defined explicitly; actual library dependencies are retained in the report.
Formal statement: ∀a,b ∈ MCBExponent: AND(a,b) = AND(b,a) Proof: Follows from commutativity of multiplication and symmetry of min