{"slug":"hunter-famous-logic","identifier":"hunter-famous-logic","title":"The Famous Logic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"5682e034418c7b82c0587ecd5b51fef53868d42f980471958c988a2e2daab059","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:46:50.046Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:01.565Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= ((P & Q) & (R & S)) v ~((P & Q) & (R & S))","sourceOffset":1493,"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","R","S"],"premises":["P","P -> Q","Q -> R","R -> S"],"conclusion":"((P & Q) & (R & S)) v ~((P & Q) & (R & S))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3))) || (((v0 && v1) && (v2 && v3)) || (!((v0 && v1) && (v2 && v3))))) = 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":"8377b1c3dcdbff4dd2d7f936cd3f3e7ef818003905a420359d32428d870bbfef","bytes":3887},"Proof.lean":{"sha256":"ff09978ab069c16ede036edb819b87afefd72b649cccefe0768e80b6e0fc7c2e","bytes":563},"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":"5682e034418c7b82c0587ecd5b51fef53868d42f980471958c988a2e2daab059","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-famous-logic","jsonUrl":"/proof-verification/hunter-famous-logic.json","leanUrl":"/proof-verification/hunter-famous-logic.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://4p-engine.com/proof-verification/hunter-famous-logic#lean","name":"Lean 4 witness: The Famous Logic by Maclain Hunter","url":"https://4p-engine.com/proof-verification/hunter-famous-logic","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:42:01.565Z","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":"The Famous Logic by Maclain Hunter","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://4p-engine.com/proof-knowledge/hunter-famous-logic","identifier":"hunter-famous-logic"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://4p-engine.com/proof-verification/hunter-famous-logic.lean"},"subjectOf":{"@type":"DigitalDocument","name":"Independently verified RFC 3161 existence timestamp","dateCreated":"2026-10-03T10:42:55.000Z","url":"https://4p-engine.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":"5682e034418c7b82c0587ecd5b51fef53868d42f980471958c988a2e2daab059"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-02T21:46:50.046Z"},{"@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"}]}}