{"slug":"hunter-good-faith-logical-argumentation","identifier":"hunter-good-faith-logical-argumentation","title":"Good Faith and Logical Argumentation","author":"Maclain Hunter","sourceSha256":"c923bd108d9d7c120c3b01176c42753b8aa79720a2d7d12fc11b6601c588de2b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:11.633Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:38:43.100Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, R, R -> Q, Q} |= (P & Q) & R","sourceOffset":353,"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","P <-> Q","R","R -> Q","Q"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((((v0 && (v0 == v1)) && v2) && ((!v2) || v1)) && v1)) || ((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":"49b08f444b58001961068e1b6c426981dd7e5ec52da428c327fb737fa61152fd","bytes":2267},"Proof.lean":{"sha256":"fbfc939b23fbdfb3a69478221a677bc85e39d92bac58ca8abad2a5d6b87fc7d5","bytes":500},"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":"c923bd108d9d7c120c3b01176c42753b8aa79720a2d7d12fc11b6601c588de2b","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-good-faith-logical-argumentation","jsonUrl":"/proof-verification/hunter-good-faith-logical-argumentation.json","leanUrl":"/proof-verification/hunter-good-faith-logical-argumentation.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://mcbcore.net/proof-verification/hunter-good-faith-logical-argumentation#lean","name":"Lean 4 witness: Good Faith and Logical Argumentation","url":"https://mcbcore.net/proof-verification/hunter-good-faith-logical-argumentation","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:38:43.100Z","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":"Good Faith and Logical Argumentation","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://mcbcore.net/proof-knowledge/hunter-good-faith-logical-argumentation","identifier":"hunter-good-faith-logical-argumentation"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://mcbcore.net/proof-verification/hunter-good-faith-logical-argumentation.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":"c923bd108d9d7c120c3b01176c42753b8aa79720a2d7d12fc11b6601c588de2b"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-03T01:36:11.633Z"},{"@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"}]}}