{"slug":"hunter-satisfying-reason-source","identifier":"hunter-satisfying-reason-source","title":"Satisfying Reason Rather Than Incredulity","author":"Maclain Hunter","sourceSha256":"f41703305a2b7f2048c629ba6354b0d83c8ebe2f96ce5f20de3e5914474b1524","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:18.658Z","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:28.694Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P -> S, S -> R} |= (P & S) -> R","sourceOffset":247,"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","R","S"],"premises":["P -> S","S -> R"],"conclusion":"(P & S) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((!v0) || v2) && ((!v2) || v1))) || ((!(v0 && v2)) || 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":"ca060cde65d9ad09b63aa4444a1e7562552557e124b58884ec7e872131c23bc2","bytes":867},"Proof.lean":{"sha256":"053062db7892a8b28ee853f8670b2096d229b7a9c144ef7ae23a918689f78461","bytes":487},"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":"f41703305a2b7f2048c629ba6354b0d83c8ebe2f96ce5f20de3e5914474b1524","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-satisfying-reason-source","jsonUrl":"/proof-verification/hunter-satisfying-reason-source.json","leanUrl":"/proof-verification/hunter-satisfying-reason-source.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://4p-engine.com/proof-verification/hunter-satisfying-reason-source#lean","name":"Lean 4 witness: Satisfying Reason Rather Than Incredulity","url":"https://4p-engine.com/proof-verification/hunter-satisfying-reason-source","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:41:28.694Z","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":"Satisfying Reason Rather Than Incredulity","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://4p-engine.com/proof-knowledge/hunter-satisfying-reason-source","identifier":"hunter-satisfying-reason-source"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://4p-engine.com/proof-verification/hunter-satisfying-reason-source.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":"f41703305a2b7f2048c629ba6354b0d83c8ebe2f96ce5f20de3e5914474b1524"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-02T23:10:18.658Z"},{"@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"}]}}