{"slug":"hunter-logic-climbs-ladders","identifier":"hunter-logic-climbs-ladders","title":"Logic Climbs Ladders by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"dfae1077e78c02aeacecafa74b5408ac906e4ca2237ed0d251d49e1617572f4e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:22.164Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:39:19.509Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q} |= P & Q","sourceOffset":553,"scope":"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.","variables":["P","Q"],"premises":["P","P <-> Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && (v0 == v1))) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"7ed39a519484b1d5b185a0bd3d76e2b0dd4fcc7c563a93d158da2eebf6f8f5b2","bytes":1559},"Proof.lean":{"sha256":"2f2d66e372537e48e2b86bfad6e806987e9e187d6d8d0e8799474a64148a6582","bytes":443},"lean-check.txt":{"sha256":"283a8aa40f54008e4bfc528069537344fae9f76a8d2f62b37f48d942b98ba62c","bytes":115}},"boundary":"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.","currentSourceSha256":"dfae1077e78c02aeacecafa74b5408ac906e4ca2237ed0d251d49e1617572f4e","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-logic-climbs-ladders","jsonUrl":"/proof-verification/hunter-logic-climbs-ladders.json","leanUrl":"/proof-verification/hunter-logic-climbs-ladders.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://mcbcore.net/proof-verification/hunter-logic-climbs-ladders#lean","name":"Lean 4 witness: Logic Climbs Ladders by Maclain Hunter","url":"https://mcbcore.net/proof-verification/hunter-logic-climbs-ladders","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:39:19.509Z","creator":{"@type":"Organization","name":"Replit Agent"},"programmingLanguage":{"@type":"ComputerLanguage","name":"Lean","version":"Lean (version 4.7.0, commit v4.7.0, Release)"},"author":{"@type":"Organization","name":"Replit Agent"},"description":"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.","isBasedOn":{"@type":"CreativeWork","name":"Logic Climbs Ladders by Maclain Hunter","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://mcbcore.net/proof-knowledge/hunter-logic-climbs-ladders","identifier":"hunter-logic-climbs-ladders"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://mcbcore.net/proof-verification/hunter-logic-climbs-ladders.lean"},"subjectOf":{"@type":"DigitalDocument","name":"Independently verified RFC 3161 existence timestamp","dateCreated":"2026-10-03T10:42:55.000Z","url":"https://mcbcore.net/proof-verification/timestamp.json"},"additionalProperty":[{"@type":"PropertyValue","name":"verificationStatus","value":"verified"},{"@type":"PropertyValue","name":"axiomFree","value":"true"},{"@type":"PropertyValue","name":"axiomDependencies","value":"[]"},{"@type":"PropertyValue","name":"theorems","value":"[\"HunterAuthored.inference_1\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"dfae1077e78c02aeacecafa74b5408ac906e4ca2237ed0d251d49e1617572f4e"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-03T01:37:22.164Z"},{"@type":"PropertyValue","name":"sourceDateMeaning","value":"Database registration time, not a claim of original handwritten authorship."},{"@type":"PropertyValue","name":"originalAuthoredAt","value":"null"},{"@type":"PropertyValue","name":"timestampAuthority","value":"https://www.freetsa.org"},{"@type":"PropertyValue","name":"timestampScope","value":"Independent cryptographic existence timestamp for the manifest and its content-addressed artifacts. Not legal notarization, an authorship adjudication, or a retroactive timestamp for handwritten work."},{"@type":"PropertyValue","name":"governingGround","value":"Logic / Logos / God"},{"@type":"PropertyValue","name":"formalizationAttribution","value":"Machine formalization by Replit Agent of Maclain Hunter's unchanged authored source"}]}}