{"slug":"hunter-logic-most-logical","identifier":"hunter-logic-most-logical","title":"Logic is Most Logical by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"a4063aabf0f78749c4b38282b01008e0acd28ad226f6667f26c88ab7115cad39","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:20.586Z","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:23.008Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P <-> P} |= P <-> P","sourceOffset":354,"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"],"premises":["P <-> P"],"conclusion":"P <-> P","status":"candidate","leanStatement":"theorem inference_1 (v0 : Bool) :\n    ((!(v0 == v0)) || (v0 == v0)) = true := by\n  cases v0 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"60150159d23ae677ff3df0c2b4bde44e9a9446922b5a2dd4ad836857336a7592","bytes":1616},"Proof.lean":{"sha256":"36ccaa6137904f362def1dfbee42f6b5454814a19a7e013ea00c2a21075afe1b","bytes":420},"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":"a4063aabf0f78749c4b38282b01008e0acd28ad226f6667f26c88ab7115cad39","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-logic-most-logical","jsonUrl":"/proof-verification/hunter-logic-most-logical.json","leanUrl":"/proof-verification/hunter-logic-most-logical.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://4p-mcb.com/proof-verification/hunter-logic-most-logical#lean","name":"Lean 4 witness: Logic is Most Logical by Maclain Hunter","url":"https://4p-mcb.com/proof-verification/hunter-logic-most-logical","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:39:23.008Z","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 is Most Logical by Maclain Hunter","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://4p-mcb.com/proof-knowledge/hunter-logic-most-logical","identifier":"hunter-logic-most-logical"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://4p-mcb.com/proof-verification/hunter-logic-most-logical.lean"},"subjectOf":{"@type":"DigitalDocument","name":"Independently verified RFC 3161 existence timestamp","dateCreated":"2026-10-03T10:42:55.000Z","url":"https://4p-mcb.com/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":"a4063aabf0f78749c4b38282b01008e0acd28ad226f6667f26c88ab7115cad39"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-03T01:36:20.586Z"},{"@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"}]}}