{"slug":"hunter-logic-with-yhvh","identifier":"hunter-logic-with-yhvh","title":"Logic with YHVH by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"6b3e99315a9fbbe914b006db94c8ee39f78b35fb0e430d527a7c24fb2af14bc9","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:54:46.491Z","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:27.422Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{Y, H, V, G} |= ((Y -> H) & (V -> H)) <-> G","sourceOffset":286,"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":["G","H","V","Y"],"premises":["Y","H","V","G"],"conclusion":"((Y -> H) & (V -> H)) <-> G","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v3 && v1) && v2) && v0)) || ((((!v3) || v1) && ((!v2) || v1)) == v0)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"f03f831fbd0bebce5776311b7f208631a63dd458ae118eb135bc3b5c17502633","bytes":1497},"Proof.lean":{"sha256":"6f9c837ee869cb0e00c4e6ea9f035b2db3824c12a97d774ec5b311fc9d2c91cf","bytes":508},"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":"6b3e99315a9fbbe914b006db94c8ee39f78b35fb0e430d527a7c24fb2af14bc9","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-logic-with-yhvh","jsonUrl":"/proof-verification/hunter-logic-with-yhvh.json","leanUrl":"/proof-verification/hunter-logic-with-yhvh.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://4p-mcb.com/proof-verification/hunter-logic-with-yhvh#lean","name":"Lean 4 witness: Logic with YHVH by Maclain Hunter","url":"https://4p-mcb.com/proof-verification/hunter-logic-with-yhvh","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:39:27.422Z","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 with YHVH by Maclain Hunter","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://4p-mcb.com/proof-knowledge/hunter-logic-with-yhvh","identifier":"hunter-logic-with-yhvh"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://4p-mcb.com/proof-verification/hunter-logic-with-yhvh.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":"6b3e99315a9fbbe914b006db94c8ee39f78b35fb0e430d527a7c24fb2af14bc9"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-02T18:54:46.491Z"},{"@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"}]}}