{"slug":"hunter-scientific-testing-with-logic","identifier":"hunter-scientific-testing-with-logic","title":"Scientific Testing w/ Logic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"ba1c02f0d73b38a62a4481b4b41131e9e2582d22f614911db206a2e6b3c1cf63","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:30.786Z","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:32.411Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.inference_3"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (P & Q) & (R & S)","sourceOffset":2163,"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)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!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"},{"id":"inference_2","sourceStatement":"{A, A <-> B, B <-> C, D, D -> A, A, B, C} |= (A & B) & (C & D)","sourceOffset":5332,"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":["A","B","C","D"],"premises":["A","A <-> B","B <-> C","D","D -> A","A","B","C"],"conclusion":"(A & B) & (C & D)","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 : Bool) :\n    ((!(((((((v0 && (v0 == v1)) && (v1 == v2)) && v3) && ((!v3) || v0)) && v0) && v1) && v2)) || ((v0 && v1) && (v2 && v3))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{P1, P2} |= (P1 & P2)","sourceOffset":6924,"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":["P1","P2"],"premises":["P1","P2"],"conclusion":"(P1 & P2)","status":"candidate","leanStatement":"theorem inference_3 (v0 v1 : Bool) :\n    ((!(v0 && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_3\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_3"}],"files":{"source.json":{"sha256":"efa6900f14be635efda61ec11468e522fd23e8cb6980b9f78c9ead474f7ee726","bytes":9681},"Proof.lean":{"sha256":"83832efc715e9be875243ee23d285a560a953f1e2d5d42fac21431b96c42867d","bytes":954},"lean-check.txt":{"sha256":"d131b333b863df4d5d5c7567649c22c57355691beead3b363ceaaf7bf31ab6ea","bytes":233}},"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":"ba1c02f0d73b38a62a4481b4b41131e9e2582d22f614911db206a2e6b3c1cf63","timestamp":"2026-10-03T10:42:55.000Z","timestampAuthority":"https://www.freetsa.org","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","url":"/proof-verification/hunter-scientific-testing-with-logic","jsonUrl":"/proof-verification/hunter-scientific-testing-with-logic.json","leanUrl":"/proof-verification/hunter-scientific-testing-with-logic.lean","graph":{"@context":"https://schema.org","@type":"SoftwareSourceCode","@id":"https://4p-engine.com/proof-verification/hunter-scientific-testing-with-logic#lean","name":"Lean 4 witness: Scientific Testing w/ Logic by Maclain Hunter","url":"https://4p-engine.com/proof-verification/hunter-scientific-testing-with-logic","dateCreated":"2026-10-03T10:37:05.082Z","dateModified":"2026-10-03T10:41:32.411Z","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":"Scientific Testing w/ Logic by Maclain Hunter","author":{"@type":"Person","name":"Maclain Hunter"},"url":"https://4p-engine.com/proof-knowledge/hunter-scientific-testing-with-logic","identifier":"hunter-scientific-testing-with-logic"},"encoding":{"@type":"MediaObject","encodingFormat":"text/plain","contentUrl":"https://4p-engine.com/proof-verification/hunter-scientific-testing-with-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\",\"HunterAuthored.inference_2\",\"HunterAuthored.inference_3\"]"},{"@type":"PropertyValue","name":"sourceSha256","value":"ba1c02f0d73b38a62a4481b4b41131e9e2582d22f614911db206a2e6b3c1cf63"},{"@type":"PropertyValue","name":"releaseManifestSha256","value":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4"},{"@type":"PropertyValue","name":"sourceRecordedAt","value":"2026-10-03T01:33:30.786Z"},{"@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"}]}}