{"slug":"hunter-leveraging-lars-logic","identifier":"hunter-leveraging-lars-logic","title":"Leveraging Lars’ Logic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"182ba175e012b4693ab114600d0ca332b315dfd67c25394f8c3a4288f2142503","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:41:52.067Z","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:08.453Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q} |= P & Q","sourceOffset":460,"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","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && (v0 == v1)) && 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"},{"id":"inference_2","sourceStatement":"{P, P <-> Q, Q} |= P & Q","sourceOffset":1412,"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","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 : Bool) :\n    ((!((v0 && (v0 == v1)) && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"d3d2decd809af63e0783ce9ed7b1ae33997231d368edc622093791c41bc3d8c4","bytes":2712},"Proof.lean":{"sha256":"ebc4fa4dc39cfe7642e85061fd40a8d378eca8fb512fc8363b8a4f5f413f5c8a","bytes":617},"lean-check.txt":{"sha256":"9dd24ecb3d82c309e42e8e914b5df3ec490fd2259644de7d887fca9eeff5dfe5","bytes":174}},"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":"182ba175e012b4693ab114600d0ca332b315dfd67c25394f8c3a4288f2142503","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-leveraging-lars-logic","jsonUrl":"/proof-verification/hunter-leveraging-lars-logic.json","leanUrl":"/proof-verification/hunter-leveraging-lars-logic.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://mcbcore.net/proof-verification/hunter-leveraging-lars-logic#lean","name":"Lean 4 witness: Leveraging Lars’ Logic by Maclain Hunter","url":"https://mcbcore.net/proof-verification/hunter-leveraging-lars-logic","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:39:08.453Z","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":"Leveraging Lars’ Logic by Maclain Hunter","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://mcbcore.net/proof-knowledge/hunter-leveraging-lars-logic","identifier":"hunter-leveraging-lars-logic"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://mcbcore.net/proof-verification/hunter-leveraging-lars-logic.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\",\"HunterAuthored.inference_2\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"182ba175e012b4693ab114600d0ca332b315dfd67c25394f8c3a4288f2142503"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-02T16:41:52.067Z"},{"@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"}]}}