{"slug":"hunter-logical-halting-model","identifier":"hunter-logical-halting-model","title":"Logical Model for Solving the Halting Problem","author":"Maclain Hunter","sourceSha256":"575e25556558c29a0487f6d1886bd4f96068b28fd8b65ce85c7f7db70d2258d1","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:15.544Z","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:44.460Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, I} |= (P v Q)","sourceOffset":3377,"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":["I","P","Q"],"premises":["P","Q","I"],"conclusion":"(P v Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v1 && v2) && v0)) || (v1 || v2)) = 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":"47e6f7d68056684acb843fd152ea278daea68e62c8399cf9c9d598e83f26839a","bytes":4431},"Proof.lean":{"sha256":"44510c5653a316295bb3f429221a75e8742e1f8949bc2f724fc87115c80b2d53","bytes":466},"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":"575e25556558c29a0487f6d1886bd4f96068b28fd8b65ce85c7f7db70d2258d1","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-logical-halting-model","jsonUrl":"/proof-verification/hunter-logical-halting-model.json","leanUrl":"/proof-verification/hunter-logical-halting-model.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://mcbcore.net/proof-verification/hunter-logical-halting-model#lean","name":"Lean 4 witness: Logical Model for Solving the Halting Problem","url":"https://mcbcore.net/proof-verification/hunter-logical-halting-model","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:39:44.460Z","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":"Logical Model for Solving the Halting Problem","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://mcbcore.net/proof-knowledge/hunter-logical-halting-model","identifier":"hunter-logical-halting-model"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://mcbcore.net/proof-verification/hunter-logical-halting-model.lean"},"subjectOf":{"@type":"DigitalDocument","name":"Independently verified RFC 3161 existence timestamp","dateCreated":"2026-10-03T10:42:55.000Z","url":"https://mcbcore.net/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":"575e25556558c29a0487f6d1886bd4f96068b28fd8b65ce85c7f7db70d2258d1"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-03T01:30:15.544Z"},{"@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"}]}}