{"slug":"hunter-self-evident-credibility","identifier":"hunter-self-evident-credibility","title":"Self-Evident Credibility by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"9e6ed5b79cad673caddf7be748f5c39379e2a5a35babdceebc146f87932c2557","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:42:29.554Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:41:39.501Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, R -> P, R -> Q} |= R -> (P & Q)","sourceOffset":984,"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"],"premises":["P","Q","R","R -> P","R -> Q"],"conclusion":"R -> (P & Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((((v0 && v1) && v2) && ((!v2) || v0)) && ((!v2) || v1))) || ((!v2) || (v0 && v1))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"fdefa4436a0f8e89d152555c80382d95ade72ecf05323778d1e14d6a76a5fa7b","bytes":2695},"Proof.lean":{"sha256":"410f0ae11cf3dbda46afbe967ce01ee667b1d474fb2a3b636db2d48517f3f843","bytes":512},"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":"9e6ed5b79cad673caddf7be748f5c39379e2a5a35babdceebc146f87932c2557","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-self-evident-credibility","jsonUrl":"/proof-verification/hunter-self-evident-credibility.json","leanUrl":"/proof-verification/hunter-self-evident-credibility.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://4p-mcb.com/proof-verification/hunter-self-evident-credibility#lean","name":"Lean 4 witness: Self-Evident Credibility by Maclain Hunter","url":"https://4p-mcb.com/proof-verification/hunter-self-evident-credibility","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:41:39.501Z","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":"Self-Evident Credibility by Maclain Hunter","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://4p-mcb.com/proof-knowledge/hunter-self-evident-credibility","identifier":"hunter-self-evident-credibility"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://4p-mcb.com/proof-verification/hunter-self-evident-credibility.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":"9e6ed5b79cad673caddf7be748f5c39379e2a5a35babdceebc146f87932c2557"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-02T20:42:29.554Z"},{"@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"}]}}