{"manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","timestamp":{"protocol":"rfc3161","authority":"https://www.freetsa.org","timestamp":"2026-10-03T10:42:55.000Z","manifestSha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","verification":"verified","verifiedAt":"2026-10-03T10:42:55.388Z","files":{"manifest.json":{"sha256":"6e4e8d5c750a86f20e8f987a742b4eb2f588563a5f23a438ab84950f16eec8c4","bytes":1260256},"manifest.tsq":{"sha256":"ba8ec84d622de3fe8027cd0e1f2b463d23dd9571743d1198e1649c02f68ec208","bytes":69},"manifest.tsr":{"sha256":"42f92959fd42d2256a4b3d0763b874635c806aa37bc01c37c1abaf139d24d612","bytes":4643},"tsa.crt":{"sha256":"8bfb0305bb64e2571ca507552ef3245cb1c2fee8728e0ff8689225081ea13467","bytes":2273},"cacert.pem":{"sha256":"2151b61137ffa86bf664691ba67e7da0b19f98c758e3d228d5d8ebf27e044438","bytes":2833},"timestamp-verification.txt":{"sha256":"b8d7201abe55c58d39a0f8c66c1900d4b7f2ee47b5435a5700f46f3a928e2220","bytes":1571}},"scope":"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."},"release":{"protocol":"hunter-authored-lean-v1","releaseId":"2026-10-03-first-party","createdAt":"2026-10-03T10:37:05.082Z","leanVersion":"Lean (version 4.7.0, commit v4.7.0, Release)","author":"Maclain Hunter","formalizationBy":"Replit Agent","scope":"Source-bound authored proof verification, subordinate to Logic/Logos/God. Axiom-free describes actual Lean dependency reports, not automatic certification of every prose or physical claim.","counts":{"records":438,"verified":281,"partial":69,"requiresFormalization":88,"checkFailed":0,"verifiedTheorems":505,"axiomFreeRecords":344},"proofs":[{"slug":"hunter-reason-cause-universe-rational-knowledge","identifier":"hunter-reason-cause-universe-rational-knowledge","title":"‘Reason as the Cause of the Universe (God) is Rationally Consistent’ by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"eb6241524418d83c6920598e85b69476235abf71f1ba0a5943ab8be5d661678d","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:36.037Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:06.375Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q -> R, R -> P} |= (P & Q) & R","sourceOffset":1901,"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","Q -> R","R -> P"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((v0 && (v0 == v1)) && ((!v1) || v2)) && ((!v2) || v0))) || ((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"},{"id":"inference_2","sourceStatement":"{P <-> S} |= P <-> S","sourceOffset":1949,"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","S"],"premises":["P <-> S"],"conclusion":"P <-> S","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 : Bool) :\n    ((!(v0 == v1)) || (v0 == v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"a893ab9fcff83c1b918c41846dc1b1d8a675b14f3c0d41b34437b942df727cb7","bytes":3901},"Proof.lean":{"sha256":"6420756242f09d4768da18ac1a1aeae5d540e3925781e8855bfbfbf9ad486d3f","bytes":703},"lean-check.txt":{"sha256":"9dd24ecb3d82c309e42e8e914b5df3ec490fd2259644de7d887fca9eeff5dfe5","bytes":174}},"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."},{"slug":"hunter-philosophical-algebra-expanded","identifier":"hunter-philosophical-algebra-expanded","title":"# Philosophical Algebra: Expanded Proof","author":"Maclain Hunter","sourceSha256":"788fa882cd2758ce18e9b0866522818d98e5b4cf9acc361905c4b1467f8aa273","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:06.360Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:06.379Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"\\{ P \\leftrightarrow Q, R \\leftrightarrow Q, S \\leftrightarrow Q, T \\leftrightarrow \\neg U \\} \\models (((P \\leftrightarrow Q) \\leftrightarrow (R \\leftrightarrow Q) \\leftrightarrow S) \\leftrightarrow T) \\leftrightarrow \\neg U)","sourceOffset":1263,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unconsumed formal tokens; no prose or connectives discarded","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"f8d8f4129a9e3dc9dbcbcc1880b228f2f039fda1cd7981f7761750ef792c62ac","bytes":3629},"Proof.lean":{"sha256":"4c7e77248c55d66a4b884ddc1245757de0784ef6c7a9419757b7bf9f4b4a86a3","bytes":291},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-deeper-dive-logos","identifier":"hunter-deeper-dive-logos","title":"A Deeper Dive into the Logos as the Core of Reality","author":"Maclain Hunter","sourceSha256":"59f353d8baa04eb86ad5229d0e0d025752dfaccd0a989908c8b57dc598464370","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:02.058Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:06.381Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"097151a363fb1d97f479848b03a7032410415da5eeff8cfe84ab6d5ece9cbfda","bytes":4774},"Proof.lean":{"sha256":"38171207e1109c1b38d50238a6a4c5ffea2b0316e0ef9a8ad1aebc9898643515","bytes":303},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-demand-proof-god","identifier":"hunter-demand-proof-god","title":"A Demand of Proof for God by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"7d04607adf0e241bc9ea19370b8c589d9993562c923a481ffbdafd80f84a08ed","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:54:42.618Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:07.295Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q} |= P & Q","sourceOffset":396,"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"],"premises":["P","P -> Q","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"3e82af28fd43b238c5a2403fb8d31f46d99b84870c021dbfcb01f460f9e207a4","bytes":1202},"Proof.lean":{"sha256":"a295548d1258d368c949b6c11e5f68fbfcc924e5345ba209db07b618fda5997d","bytes":459},"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."},{"slug":"hunter-heat-death-logical-proof","identifier":"hunter-heat-death-logical-proof","title":"A Logical Proof against Heat Death","author":"Maclain Hunter","sourceSha256":"28de7784250433cbfd7d52de38bb24d6dcf6702d9110865e5bb6a62193a80a9d","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:09.123Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:08.192Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{L, L → O, O → G, G → I, I → C} |= ((L & O) & (G & I) & C","sourceOffset":5315,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{~L, ~L → ~O, ~O → ~G, ~G → ~I, ~I → ~C} |= ((~L & ~O) & (~G & ~I) & ~C","sourceOffset":5511,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":4994,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"a13dee8e9ffe696def1082fde0438d4ccff356113dd636a33ebf5f0ec9fbaa04","bytes":10988},"Proof.lean":{"sha256":"a635eeab7b389161a15ed48a94db68c15fbdeb17075ee014df1787fef9dd168a","bytes":386},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-quantum-classical-coherence-formula","identifier":"hunter-quantum-classical-coherence-formula","title":"A Newly Proposed Formula for Unification of Quantum and Classical Mechanics by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"dbb6d27e4803b86821f7f825f43e3cfe5586835cce5777e91f3bcc4074c3612a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:33.380Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:08.194Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"a6aaf9afe43efea6c0fe3da6ddfc316b6a9486c4bc821580015c1989c4c03af6","bytes":1867},"Proof.lean":{"sha256":"13feb497a28b4a7b16efe04341dd8e812c89e103401becde7bd9515f131abf16","bytes":345},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-god-brilliance-logic","identifier":"hunter-god-brilliance-logic","title":"A Proof of God and True Brilliance through Logic","author":"Maclain Hunter","sourceSha256":"5701521213b84201f821e3b10e35debdc6acefbac998aa147a77906fc0a786ab","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:31:25.446Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:09.408Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.inference_3","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P->Q, Q->R, R->S, S->T, T->U} |= ((P & Q) & (R & S) & T) & U","sourceOffset":3197,"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","T","U"],"premises":["P","P->Q","Q->R","R->S","S->T","T->U"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P, P->Q, Q->R, R->S, S->T, T->U} |= ((P & Q) & (R & S) & T) & U","sourceOffset":4385,"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","T","U"],"premises":["P","P->Q","Q->R","R->S","S->T","T->U"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{P, P->Q, Q->R, R->S, S->T, T->U} |= ((P & Q) & (R & S) & T) & U","sourceOffset":7830,"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","T","U"],"premises":["P","P->Q","Q->R","R->S","S->T","T->U"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_3 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_3\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_3"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":523,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"1ff4c941de74361f089cbe8e6209e419ff83d82416077ce1fdc57b0c06e6b18a","bytes":10851},"Proof.lean":{"sha256":"79038fadadf2bcd4f952fc517a545313dc801772370f8cc8caa05d6ca74a6c53","bytes":1387},"lean-check.txt":{"sha256":"b2a13c78d5e07cc13897edfa6e4ad95b717a32423f43c97d6c342c394c93869c","bytes":301}},"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."},{"slug":"hunter-rational-definition-applying-logic","identifier":"hunter-rational-definition-applying-logic","title":"A Rational Definition of Logic","author":"Maclain Hunter","sourceSha256":"5e49971959284f1aca9343603cf627d0da18c9b75f13a45eeaaf8d62696705e4","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:12.530Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:09.411Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"55a0f779f41278f6bbea5a3f41d426a591acf3175eb92c9b77da1dd5095e251e","bytes":1410},"Proof.lean":{"sha256":"85f80c9d59256f7b2f26da4e395c548876d5450c9ac1ff4d46fa5bafd2b47e4f","bytes":282},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-response-to-opposition","identifier":"hunter-response-to-opposition","title":"A Response to Opposition by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"1e1091e74bdadf98e2e8c278287a7efd37a2c0d0d6d579e04c3453603ee386b0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T19:42:34.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:37:10.534Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S} |= (P -> Q) -> (R -> S)","sourceOffset":4051,"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","Q","R","S"],"conclusion":"(P -> Q) -> (R -> S)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && 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"}],"files":{"source.json":{"sha256":"03f1f4168b1d0494637088a714a8cf56f82e5c8f42ecf2c144d6aeb2c04da0bc","bytes":5573},"Proof.lean":{"sha256":"92c6aeaf4e81425354fb4e9190a36c1680d3dcd2cd756571d98938c127cd2d64","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."},{"slug":"hunter-rational-god-definitions","identifier":"hunter-rational-god-definitions","title":"A Set of Rational Definitions of God by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"72283336a09202675bc316c1d221afa4f6d7b4ff99c47e7962e862bcd4e12d7f","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T14:38:24.151Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:11.426Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{A, A -> A} |= A","sourceOffset":924,"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"],"premises":["A","A -> A"],"conclusion":"A","status":"candidate","leanStatement":"theorem inference_1 (v0 : Bool) :\n    ((!(v0 && ((!v0) || v0))) || v0) = true := by\n  cases v0 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{G} |= G\"","sourceOffset":1442,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"\\\"\"","kernelStatus":"not_checked"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":366,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"23714b5ba16200aec0f328adbb313d72783ea19d6c7977b99cafd8cf6dc47471","bytes":2199},"Proof.lean":{"sha256":"25301eb85a15f5b7d2e8b7a5e650cfa679cc639b877f7edd82b61927a1e8fae5","bytes":539},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-absolute-logic-universal-contingency","identifier":"hunter-absolute-logic-universal-contingency","title":"Absolute Logic in Universal Contingency by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"182a4ad2b271db6d8daaa393f8878f9b94c1d90bb7c23c086e54b88450ed69f1","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:25.622Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:12.319Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, ((P & Q) & R) -> S} |= S","sourceOffset":1128,"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","((P & Q) & R) -> S"],"conclusion":"S","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!((v0 && v1) && v2)) || v3))) || 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"}],"files":{"source.json":{"sha256":"8ec07a4ddbfce4c486e6b1ea69df7090ecd79c54e75e6b067a616e9c028b4216","bytes":2491},"Proof.lean":{"sha256":"01fec019c0258d501ba9134b6272316b4fdd025cee92c97dac6cf02522b69876","bytes":543},"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."},{"slug":"hunter-ad-hominem-logos","identifier":"hunter-ad-hominem-logos","title":"Ad Hominem and the Law of Reason","author":"Maclain Hunter","sourceSha256":"9a7c0aaffaaa004df8e6120ccbedb01b3b05ad1f7f8214d575b6263f0a9d0180","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:15.692Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:13.343Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q} |= P & Q","sourceOffset":260,"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"],"premises":["P","P -> Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && ((!v0) || v1))) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"4c1a2d7a46f5253bf01b604d6835d6049c5ad730ad8d3d8378ecd2899aa8a90d","bytes":849},"Proof.lean":{"sha256":"6bb3835df337b75dfaf6525f6bb239dc9dc66f44b81197bf5e0518e48cca2479","bytes":440},"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."},{"slug":"hunter-aep-optimized-coherence","identifier":"hunter-aep-optimized-coherence","title":"AEP and Optimized Coherence","author":"Maclain Hunter","sourceSha256":"00d5334148e3844d08651db1aa5dbb3db943efabd073a7ae7c961e18a1353308","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:25.142Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:14.230Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= P -> (R <-> Q)","sourceOffset":230,"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","Q -> R"],"conclusion":"P -> (R <-> Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((!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":"490c54ee8e207243b53ee76cd36042fb565d4bf907578d12751c4b69c7bf2ca9","bytes":853},"Proof.lean":{"sha256":"986afdf75206b6b43547593f0da38d2325b00c24d623663673be306117a967da","bytes":481},"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."},{"slug":"hunter-aep-bootstrap-feedback","identifier":"hunter-aep-bootstrap-feedback","title":"AEP Bootstrap and Power Feedback","author":"Maclain Hunter","sourceSha256":"037cee99b38de9baac7587b23a7635f11831367d9d7dbf1a247a6ff6dc0bc2a5","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:22.088Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:14.233Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P -> Q, Q -> R} |= (P & Q) & R","sourceOffset":244,"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","Q -> R"],"conclusion":"(P & Q) & R","status":"countermodel","countermodel":{"P":false,"Q":false,"R":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"f09655ca0e7ebc3364daac528d4d830a3135bae07f0a958e51e3e7c476d244fd","bytes":859},"Proof.lean":{"sha256":"2a505c83965a5dec6793972506621c70d9b879467809ef4272e477e412d24507","bytes":284},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-aep-logical-reality","identifier":"hunter-aep-logical-reality","title":"AEP Logical Reality","author":"Maclain Hunter","sourceSha256":"d43ecdf73d53aca21f11587491a9e240f4f26a54c07af6203f59c43d53488388","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:28.768Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:15.146Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= ~{P, LR, LRO}","sourceOffset":184,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"{P, LR, LRO}\"","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (P & Q) & (R & S)","sourceOffset":212,"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_2 (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_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"2fb0f85620738039a1830ce146484ddf1bada6525c2d1b04d727d4c5195b01a8","bytes":832},"Proof.lean":{"sha256":"4a525b175d1ceffb44d43c4cc5b3860ec3256998f6a89115b063781e25bd87e6","bytes":513},"lean-check.txt":{"sha256":"740863296048b83b7cd879ce809b9047c55288a43dfa8b77f4b45e1d50e9c3b3","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."},{"slug":"hunter-aep-logical-simulation","identifier":"hunter-aep-logical-simulation","title":"AEP Logical Simulation","author":"Maclain Hunter","sourceSha256":"e5e29678dd6df34eeb2ec69a1f10b16794eedbce7297c5c8155cdda52f3031f0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:25.377Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:16.198Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= ~(P & LRO)","sourceOffset":169,"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":["LRO","P","Q","R"],"premises":["P","Q","R"],"conclusion":"~(P & LRO)","status":"countermodel","countermodel":{"LRO":true,"P":true,"Q":true,"R":true},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (P & Q) & (R & S)","sourceOffset":194,"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_2 (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_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"60ab2c98dc5c4af72347bbf2ead62ec7e6be99ac71db2fe7fdbdf8a5f9b1d0f5","bytes":818},"Proof.lean":{"sha256":"95685f0b98f4a7d470d657a38cc11dcd1458fb2560744ba358270c4f1ff960d0","bytes":516},"lean-check.txt":{"sha256":"740863296048b83b7cd879ce809b9047c55288a43dfa8b77f4b45e1d50e9c3b3","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."},{"slug":"hunter-aep-safety-controls","identifier":"hunter-aep-safety-controls","title":"AEP Safety Systems and Controls","author":"Maclain Hunter","sourceSha256":"f71eaa2810c25d8529d4b318bc5fd37da1987de9953ba3875a7b5402be025f4e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:21.892Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:17.116Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) & R","sourceOffset":237,"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","Q -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!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":"bc4eb21240faf83fa0de3b271b64e81091b7c7a8d3795d659780dbb52868d45a","bytes":851},"Proof.lean":{"sha256":"2b1aac9845fe3421e93d0b594ef1eb2a85625c9c42f9920d9d4d6c1ecd643c22","bytes":482},"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."},{"slug":"hunter-agnosticism-knowability","identifier":"hunter-agnosticism-knowability","title":"Agnosticism and Knowability","author":"Maclain Hunter","sourceSha256":"c839387d29b3cd830e6e176795bea7deb1213405fdcb83929984155a1f012bbb","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T22:02:14.146Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:18.012Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R <-> (P & Q)} |= (P & Q) -> R","sourceOffset":480,"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 <-> (P & Q)"],"conclusion":"(P & Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && (v2 == (v0 && 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":"4c4c7fd2a3954bd39a341513cd81207048c93f261f2d7544612d2934ca9c362d","bytes":1094},"Proof.lean":{"sha256":"f8e1afaa5c843dc21746c5a309acfc5a5f37f9189e6c8666ccc62a303f3fdd47","bytes":475},"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."},{"slug":"hunter-ai-intellect","identifier":"hunter-ai-intellect","title":"AI and Intellect by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"36202d94ad5592cc724999f855ad1475149d3f7f2be8737311e30ed2bc8c39e6","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:46:53.166Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:18.918Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P & Q, P & R, P & S, T} |= T -> ((P & Q) & R) <-> S","sourceOffset":791,"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","T"],"premises":["P","P & Q","P & R","P & S","T"],"conclusion":"T -> ((P & Q) & R) <-> S","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && (v0 && v1)) && (v0 && v2)) && (v0 && v3)) && v4)) || (((!v4) || ((v0 && v1) && v2)) == v3)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"b2c57d138785edb96dbeb1d6877d812c5d72fbbb92cbd0297abe41e7b04d127b","bytes":3082},"Proof.lean":{"sha256":"7bb699f52c80e89755f9e1536fa5784b79803086f9560ad9eb74bba38c5fa87f","bytes":554},"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."},{"slug":"hunter-all-equals-all","identifier":"hunter-all-equals-all","title":"All Equals All by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"34f592779efd61c39b9ce22128000520c6de1afcacb380e71f9989caa0a5f4d6","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T19:42:34.961Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:19.830Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":1145,"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":"source_identity_rule","sourceStatement":"A is A","sourceOffset":81,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"d3bd911a2f799838df8529ecd7061caa2727ee33ca3c29774135898f6b7f8d3d","bytes":6172},"Proof.lean":{"sha256":"bced3156c85617a34f50acc5cfe75a42684d0f7c0bbe6d359fcbfe0feea15b7c","bytes":618},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-all-schools-logic","identifier":"hunter-all-schools-logic","title":"All Schools Under Logic","author":"Maclain Hunter","sourceSha256":"59b251315fe619755676a788222ada80d872e9d727d7c013e8908e3573ff9a72","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:59.769Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:19.832Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P -> Q} |= P & Q","sourceOffset":257,"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"],"premises":["P -> Q"],"conclusion":"P & Q","status":"countermodel","countermodel":{"P":false,"Q":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"8ddb592235bf13adf59b6714f3c547a47e098e1b0546d72ba4b893e8aa38c813","bytes":842},"Proof.lean":{"sha256":"fe8cd0e0ab841879338daf0bdb0d4320d3c5486be872cfb5ad4c95bf73b3d609","bytes":275},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-all-contextual-identity-ground","identifier":"hunter-all-contextual-identity-ground","title":"All, Contextual Identity, and Cooperative Coherence","author":"Maclain Hunter","sourceSha256":"774b8ec047741ec3f9b88b671e87f83bc6d6e0e8653932782db9e1594e9290f8","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:25.068Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:20.756Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.inference_3","HunterAuthored.inference_4"],"units":[{"id":"inference_1","sourceStatement":"{P} |= P","sourceOffset":920,"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"],"premises":["P"],"conclusion":"P","status":"candidate","leanStatement":"theorem inference_1 (v0 : Bool) :\n    ((!v0) || v0) = true := by\n  cases v0 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{Q} |= Q","sourceOffset":1018,"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":["Q"],"premises":["Q"],"conclusion":"Q","status":"candidate","leanStatement":"theorem inference_2 (v0 : Bool) :\n    ((!v0) || v0) = true := by\n  cases v0 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{P, P <-> Q, Q, Q -> P} |= P & Q","sourceOffset":1061,"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"],"premises":["P","P <-> Q","Q","Q -> P"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_3 (v0 v1 : Bool) :\n    ((!(((v0 && (v0 == v1)) && v1) && ((!v1) || v0))) || (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"},{"id":"inference_4","sourceStatement":"{Q, Q <-> P, P, P -> Q} |= Q & P","sourceOffset":1096,"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"],"premises":["Q","Q <-> P","P","P -> Q"],"conclusion":"Q & P","status":"candidate","leanStatement":"theorem inference_4 (v0 v1 : Bool) :\n    ((!(((v1 && (v1 == v0)) && v0) && ((!v0) || v1))) || (v1 && v0)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_4\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_4"}],"files":{"source.json":{"sha256":"af4fabaf750f93a54edc74c783e9d8c0b40d51707efa1a574fd8b49372c7862c","bytes":1775},"Proof.lean":{"sha256":"656974839dfaec0be71b957e2f59cd617705d93c86beac8f5a81d685abf04e64","bytes":892},"lean-check.txt":{"sha256":"a74fc3fb2a3ec23d214070d6f2376599f733d6457d6461f3a42361760d897496","bytes":292}},"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."},{"slug":"hunter-allah-real-origin","identifier":"hunter-allah-real-origin","title":"Allah as the Real Origin by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"825a4e876c0350bda734569adfc42fc52d2cd5dbc5faa02350576a38f6355cdf","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:23:12.428Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:21.610Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q} |= (~P <-> ~Q) & (P <-> Q)","sourceOffset":856,"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"],"premises":["P","P <-> Q","Q"],"conclusion":"(~P <-> ~Q) & (P <-> Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && (v0 == v1)) && v1)) || (((!v0) == (!v1)) && (v0 == v1))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"46f91e54d99f50a57c5a3650a3a9a0c702c1e55be29c92762987617fc7ef9ca7","bytes":2450},"Proof.lean":{"sha256":"c0093110d5aafcf0e3ad4695977b1d52613307263c4f21df537118f1b98c3087","bytes":477},"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."},{"slug":"hunter-ancient-myths-and-logic","identifier":"hunter-ancient-myths-and-logic","title":"Ancient Myths and Logic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"c1bd02f277276f609a52d278980594cac39994f3d7612ba46201e231c1eff7b3","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:00:09.316Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:22.537Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> P} |= R -> (P & Q)","sourceOffset":927,"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","Q <-> R","R <-> P"],"conclusion":"R -> (P & Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v0))) || ((!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"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":1735,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"105ce9b4a51ece08960f856d2fe2d31b315f3bb8390790220ebec98a6b08885f","bytes":3925},"Proof.lean":{"sha256":"39038d05e473d7036c0cd9701bbb1dc494a196428deeae6e7ace5de50d82cc78","bytes":606},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"formal-and-commutativity","identifier":"formal-and-commutativity","title":"AND Commutativity","author":"Maclain Hunter","sourceSha256":"8c5b22fe03debca9b8a0f493eed18819959fa416ddc0b7987424033a163fbad1","sourceKind":"formal-theorem","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:23.516Z","status":"partial","axiomFree":false,"axioms":["propext"],"theoremNames":["HunterAuthored.magnitude_and_commutative"],"units":[{"id":"magnitude_and_commutative","sourceStatement":"Formal statement: ∀a,b ∈ MCBExponent: AND(a,b) = AND(b,a)","sourceOffset":0,"scope":"Commutativity of the displayed integer sign-times-recursive-minimum-magnitude realization. The minimum and zero behavior are defined explicitly; actual library dependencies are retained in the report.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def minimumNat : Nat → Nat → Nat\n  | 0, _ => 0\n  | _, 0 => 0\n  | a + 1, b + 1 => minimumNat a b + 1\ntheorem minimum_commutative (a b : Nat) : minimumNat a b = minimumNat b a := by\n  induction a generalizing b with\n  | zero => cases b <;> rfl\n  | succ a ih =>\n    cases b with\n    | zero => rfl\n    | succ b => exact congrArg Nat.succ (ih b)\ndef magnitudeAnd (a b : Int) : Int :=\n  (if a * b < 0 then -1 else 1) * (minimumNat a.natAbs b.natAbs : Int)\ntheorem magnitude_and_commutative (a b : Int) : magnitudeAnd a b = magnitudeAnd b a := by\n  unfold magnitudeAnd\n  rw [Int.mul_comm a b, minimum_commutative a.natAbs b.natAbs]\n#print axioms magnitude_and_commutative\n","kernelStatus":"verified","axioms":["propext"],"axiomFree":false,"reportedTheorem":"HunterAuthored.magnitude_and_commutative"}],"files":{"source.json":{"sha256":"e8b3f6699b4cdcbe181fe69646352885a2297dfdb1b5df99040da21cf4731ad2","bytes":754},"Proof.lean":{"sha256":"226f7ac491e2d11ae7c7365222d6ab158a95364edfcd056a7d322697eb9a90e5","bytes":938},"lean-check.txt":{"sha256":"b48de3ce8f3a4c039376421047b5099f663ef71fe02524eeb32ab9a4ab3245d1","bytes":128}},"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."},{"slug":"archived-q1055-1bac66106909","identifier":"archived-q1055-1bac66106909","title":"AND Commutativity","author":"Maclain Hunter","sourceSha256":"1bac6610690928014d0382c506eed874cfb6aef628097814e581ffe09d8bc95a","sourceKind":"archived-authored-source","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:24.380Z","status":"partial","axiomFree":false,"axioms":["propext"],"theoremNames":["HunterAuthored.magnitude_and_commutative"],"units":[{"id":"magnitude_and_commutative","sourceStatement":"{\n  \"name\": \"AND Commutativity\",\n  \"formal\": \"∀a,b ∈ MCBExponent: AND(a,b) = AND(b,a)\",\n  \"proof\": \"Follows from commutativity of multiplication and symmetry of min\",\n  \"implementation\": \"mcbExponentAND(a: MCBExponent, b: MCBExponent): MCBExponent\"\n}","sourceOffset":0,"scope":"Commutativity of the displayed integer sign-times-recursive-minimum-magnitude realization. The minimum and zero behavior are defined explicitly; actual library dependencies are retained in the report.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def minimumNat : Nat → Nat → Nat\n  | 0, _ => 0\n  | _, 0 => 0\n  | a + 1, b + 1 => minimumNat a b + 1\ntheorem minimum_commutative (a b : Nat) : minimumNat a b = minimumNat b a := by\n  induction a generalizing b with\n  | zero => cases b <;> rfl\n  | succ a ih =>\n    cases b with\n    | zero => rfl\n    | succ b => exact congrArg Nat.succ (ih b)\ndef magnitudeAnd (a b : Int) : Int :=\n  (if a * b < 0 then -1 else 1) * (minimumNat a.natAbs b.natAbs : Int)\ntheorem magnitude_and_commutative (a b : Int) : magnitudeAnd a b = magnitudeAnd b a := by\n  unfold magnitudeAnd\n  rw [Int.mul_comm a b, minimum_commutative a.natAbs b.natAbs]\n#print axioms magnitude_and_commutative\n","kernelStatus":"verified","axioms":["propext"],"axiomFree":false,"reportedTheorem":"HunterAuthored.magnitude_and_commutative"}],"files":{"source.json":{"sha256":"1cde377c2c1d54feb4a672b34511bb893682f640d3e8ff2bee749c1e11485921","bytes":803},"Proof.lean":{"sha256":"b94376f96a60756e26914e744f3b7651f0bf9d9e675e6489d0c1e93934bae56f","bytes":938},"lean-check.txt":{"sha256":"b48de3ce8f3a4c039376421047b5099f663ef71fe02524eeb32ab9a4ab3245d1","bytes":128}},"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."},{"slug":"hunter-logical-answer-application","identifier":"hunter-logical-answer-application","title":"Applying and Understanding a Logical Answer","author":"Maclain Hunter","sourceSha256":"eaf76d94d622c508273c3e8aecb960ea0fd4551153e9ee025b6e8a1fe293c37c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:21.893Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:24.382Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"09f4ef5af7591910e7f0c60eae5dcafac4286dbaf9fc75f209287ed50d6ea58d","bytes":776},"Proof.lean":{"sha256":"064d79fbbf59c07a50564e4053c3564f1fdc492baba69b926cc848048e860fc0","bytes":295},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-aquinas-five-ways-logos","identifier":"hunter-aquinas-five-ways-logos","title":"Aquinas’s Five Ways and Logos","author":"Maclain Hunter","sourceSha256":"811e6f455ad1dd321b5fcfa9235f77b4ac46166ea0d034359482c75b3f4a89c0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:31:12.219Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:24.384Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"4cbc7812b170e8d1df63a6af87fd894cc13e2a6d925b783215a27bc3218e0e8c","bytes":5521},"Proof.lean":{"sha256":"bba0749f7e20a4c81aba284e382d9deb33747908c8e1d144f833c04e09a45486","bytes":283},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-asr-energy-compiled-archive","identifier":"hunter-asr-energy-compiled-archive","title":"ASR Energy — Compiled Authored Archive","author":"Maclain Hunter","sourceSha256":"affe54c88438ca0b8ba3a4e3c283831099c5b78cd73ca92673c5f6545bf68a54","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:28.964Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:25.442Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.inference_3","HunterAuthored.inference_4","HunterAuthored.inference_5","HunterAuthored.inference_6","HunterAuthored.inference_7","HunterAuthored.inference_8","HunterAuthored.inference_9","HunterAuthored.inference_11","HunterAuthored.inference_13","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, P -> R} |= (P & Q) & R","sourceOffset":241,"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","P -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v0) || 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"},{"id":"inference_2","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) & R","sourceOffset":508,"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","Q -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((v0 && v1) && v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{P, P -> Q, (P & Q) -> R} |= (P & Q) & R","sourceOffset":780,"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","(P & Q) -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_3 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!(v0 && v1)) || v2))) || ((v0 && v1) && v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_3\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_3"},{"id":"inference_4","sourceStatement":"{P, P -> Q} |= (P -> P) -> (Q -> Q)","sourceOffset":1063,"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"],"premises":["P","P -> Q"],"conclusion":"(P -> P) -> (Q -> Q)","status":"candidate","leanStatement":"theorem inference_4 (v0 v1 : Bool) :\n    ((!(v0 && ((!v0) || v1))) || ((!((!v0) || v0)) || ((!v1) || v1))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_4\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_4"},{"id":"inference_5","sourceStatement":"{P, P -> Q, Q -> P} |= P & Q","sourceOffset":1352,"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"],"premises":["P","P -> Q","Q -> P"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_5 (v0 v1 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v0))) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_5\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_5"},{"id":"inference_6","sourceStatement":"{P, P -> Q, P -> R} |= P -> ((Q -> R) <-> (R -> Q))","sourceOffset":1531,"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","P -> R"],"conclusion":"P -> ((Q -> R) <-> (R -> Q))","status":"candidate","leanStatement":"theorem inference_6 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v0) || v2))) || ((!v0) || (((!v1) || v2) == ((!v2) || v1)))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_6\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_6"},{"id":"inference_7","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) & R","sourceOffset":1833,"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","Q -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_7 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((v0 && v1) && v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_7\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_7"},{"id":"inference_8","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) & R","sourceOffset":2111,"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","Q -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_8 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((v0 && v1) && v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_8\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_8"},{"id":"inference_9","sourceStatement":"{P, P -> Q, Q -> R} |= P -> (R <-> Q)","sourceOffset":2382,"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","Q -> R"],"conclusion":"P -> (R <-> Q)","status":"candidate","leanStatement":"theorem inference_9 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((!v0) || (v2 == v1))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_9\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_9"},{"id":"inference_10","sourceStatement":"{P, Q, R} |= ~(P & LRO)","sourceOffset":2595,"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":["LRO","P","Q","R"],"premises":["P","Q","R"],"conclusion":"~(P & LRO)","status":"countermodel","countermodel":{"LRO":true,"P":true,"Q":true,"R":true},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"inference_11","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (P & Q) & (R & S)","sourceOffset":2620,"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_11 (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_11\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_11"},{"id":"inference_12","sourceStatement":"{P, Q, R} |= ~{P, LR, LRO}","sourceOffset":2859,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"{P, LR, LRO}\"","kernelStatus":"not_checked"},{"id":"inference_13","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (P & Q) & (R & S)","sourceOffset":2887,"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_13 (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_13\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_13"},{"id":"source_identity_rule","sourceStatement":"A = A","sourceOffset":85,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"b2a57812547512322cdef5a31553f1824a2992e22bdf04c071c7bf5e2ac8e030","bytes":3652},"Proof.lean":{"sha256":"d92e7e87295a3d2c25b1d55e14684f225eed4fd68ad94b99670970a61ec547d3","bytes":2676},"lean-check.txt":{"sha256":"28597d6b466cda53bc6b62e36d99aeac5794c247bb9860e4f09f0b03e33f4726","bytes":775}},"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."},{"slug":"hunter-atheism-theology-axiom","identifier":"hunter-atheism-theology-axiom","title":"Atheism and the Axiom of Theology","author":"Maclain Hunter","sourceSha256":"57f391f1c209ddf9e0b056824ed4e00d3950430140587f6c114096723fbd9795","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:48.724Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:26.420Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (P & Q) -> R","sourceOffset":250,"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"],"conclusion":"(P & Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && 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":"b9c933bae21b9af38b63c21badd16561f11b53eeeeb0b3c34251aabeea334611","bytes":864},"Proof.lean":{"sha256":"12bbb3d2a5806d8f2510b06a24e081a401922c410a7269fc81ac1ae666286b2c","bytes":465},"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."},{"slug":"hunter-atheism-defined-source","identifier":"hunter-atheism-defined-source","title":"Atheism and the Defined Logical Source","author":"Maclain Hunter","sourceSha256":"a52248eb59ad236f3fc13e1d1ab2f87c0c60c3a655bcb09bd7e194be2fafa810","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:38.461Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:27.289Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R <-> (P & Q)} |= (P & Q) -> R","sourceOffset":237,"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 <-> (P & Q)"],"conclusion":"(P & Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && (v2 == (v0 && 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":"1c201d55d1b8a349d5963b6e44876052a47dfea8adcb56b75fa7ab65a25da169","bytes":859},"Proof.lean":{"sha256":"1cb7a42add5a5dd8dbc935c4428f5a4f99b1289e186cb081289b0c8bb05254dd","bytes":486},"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."},{"slug":"hunter-atheism-contingent-theos-posthoc-copy","identifier":"hunter-atheism-contingent-theos-posthoc-copy","title":"Atheism and Theos — Post-Hoc Version","author":"Maclain Hunter","sourceSha256":"3f3b18ec9b2c03b1e7478e19f681866d7afe6247fcdafa2b9dc12d4f67a07e9a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:29.087Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:28.203Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q -> R} |= (P & Q) & R","sourceOffset":236,"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","Q -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v0 == v1)) && ((!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":"016df414e1c74bd648a9c3643fc1b79bd5aba5dd9bdd97fa60dd1fab2fc1cfab","bytes":878},"Proof.lean":{"sha256":"302ec8916c07736a35acc681034b21089db030d2080bd0bf21dec8a98775f498","bytes":486},"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."},{"slug":"hunter-atheism-contingent-theos","identifier":"hunter-atheism-contingent-theos","title":"Atheism, Theism, and the Axiomatic Theos","author":"Maclain Hunter","sourceSha256":"279a67a58de37243a52db7dce2a230a20c05737430be6a0d3d49f0446b4fef8b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:08.099Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:29.084Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q -> R} |= (P & Q) & R","sourceOffset":240,"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","Q -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v0 == v1)) && ((!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":"01cc7e7a599cb939317444d883b76309207a8aec6c027ff5daab11da0819b091","bytes":869},"Proof.lean":{"sha256":"e98dcfae53b22d031d41b885862890d37adfd82c15373b03e8a7f4c1780269b6","bytes":488},"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."},{"slug":"hunter-atheism-origin-divinity","identifier":"hunter-atheism-origin-divinity","title":"Atheism’s Illogic and the Origin’s Divinity by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"aa7a03fbedd49c6d20e4a22eb6f670eef9d1c06b96d5e57061423a399bcb803b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:06.457Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:30.044Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q -> R, R -> S, S -> T, T <-> U} |= ((P & Q) & (R & S) & T) & U","sourceOffset":3561,"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","T","U"],"premises":["P","P <-> Q","Q -> R","R -> S","S -> T","T <-> U"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && (v0 == v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && (v4 == v5))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":1634,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"32156c9e2c8dc6a3b3e886132a4c8850fc0fb582be6f27adcfd8a2ce35883a8b","bytes":9285},"Proof.lean":{"sha256":"2414aa148c92c50ce1625a5f3db07dc2a7e6bfe92a674c0785d7543627b1814e","bytes":740},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-atheism-self-refuting-reality","identifier":"hunter-atheism-self-refuting-reality","title":"Atheism’s Self-Refuting Reality by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"a16cce40a52cdd179ec1202bc4a935e1b261fecb0f65c3eba5b82775cf012657","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:23:08.583Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:30.960Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":1714,"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"}],"files":{"source.json":{"sha256":"5c7256ecd270f17454912881e8d273b5bedd5d34a7bb31088946c67356891d74","bytes":4065},"Proof.lean":{"sha256":"68a8ad06e70a915092947af6616058b3bb109e6b8bd2d8b037a23c779750e34f","bytes":542},"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."},{"slug":"hunter-atheists-conscience","identifier":"hunter-atheists-conscience","title":"Atheist’s Conscience by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"c7423affdf55e3033246f7a0a07c363924868b03e14bf40d74803a69627bd211","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:54:42.930Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:31.855Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S} |= (P & Q) -> (R -> S)","sourceOffset":2006,"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","Q","R","S"],"conclusion":"(P & Q) -> (R -> S)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && 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"}],"files":{"source.json":{"sha256":"5a0c41318a956e135804bafb86759030dd89d81de88d65143d76c8666c564c08","bytes":3952},"Proof.lean":{"sha256":"75f9a0395bb9c9f52fc3e9ce19b441338b1f1c02eb8ecca38dad206ff532ca5e","bytes":507},"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."},{"slug":"hunter-authored-coherence-scientific-test","identifier":"hunter-authored-coherence-scientific-test","title":"Authored Coherence — Scientific-Test Passage","author":"Maclain Hunter","sourceSha256":"ed88120191b566c02879741c68095e70dcb76a2b8da62ab9d9a76f958387754b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:45:12.359Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:32.788Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"source_identity_rule","sourceStatement":"A = A","sourceOffset":0,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"9a4b4847b63d0af1e46ab06b494f02c0f94f8b0f2f6f486e77aaa295fb124edb","bytes":893},"Proof.lean":{"sha256":"327e377ce9c4921e7f0a9ed96245c14e442f2109c5912bf15e97a07f7572b647","bytes":398},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-authored-identity-proof-god","identifier":"hunter-authored-identity-proof-god","title":"Authored Identity and Proof of God","author":"Maclain Hunter","sourceSha256":"abbc31c5998e8c9410c79bcd8acffc04fb60d902bf6901a8ce06bcd6f81bfa14","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:42.092Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:33.699Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, (P & Q) -> R} |= R -> (P & Q)","sourceOffset":240,"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","(P & Q) -> R"],"conclusion":"R -> (P & Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && ((!(v0 && v1)) || v2))) || ((!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":"89259acc2fd614e93c82f17f6d3be70e1f1ddc99143044dc89f6780f4c54d001","bytes":860},"Proof.lean":{"sha256":"0a2e609b335ca449758370dc41ac75d17bd0ba1b92f10764ba34ef91dfce664c","bytes":485},"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."},{"slug":"hunter-authored-identity-form-supplied-copy","identifier":"hunter-authored-identity-form-supplied-copy","title":"Authored Identity Form — Supplied Version","author":"Maclain Hunter","sourceSha256":"28dc078efee8229fd55be16a33bcbb2902c7ff94171c38e74b5029d4808ba0c0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:12:04.077Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:34.576Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q} |= (P <-> (P -> ~(P -> ~P))) -> (Q <-> P)","sourceOffset":222,"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"],"premises":["P","P -> Q"],"conclusion":"(P <-> (P -> ~(P -> ~P))) -> (Q <-> P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && ((!v0) || v1))) || ((!(v0 == ((!v0) || (!((!v0) || (!v0)))))) || (v1 == v0))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":66,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"9ea786916e0b56d4b06dd334ff3a569cf12689d1f5769085d76ca41dc0865df0","bytes":875},"Proof.lean":{"sha256":"33e159fbcc37271f38ada5959c48df4cded55f7b969ada631edc3303cc6aff37","bytes":599},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-authored-identity-form","identifier":"hunter-authored-identity-form","title":"Authored Identity Form and Necessary Reason","author":"Maclain Hunter","sourceSha256":"1ee9bfc60fe9f5498fda7302b03f20aa34700dfa0303fbfde59d59274eebdca7","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:15.636Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:35.475Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q} |= (P <-> (P -> ~(P -> ~P))) -> (Q <-> P)","sourceOffset":227,"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"],"premises":["P","P -> Q"],"conclusion":"(P <-> (P -> ~(P -> ~P))) -> (Q <-> P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && ((!v0) || v1))) || ((!(v0 == ((!v0) || (!((!v0) || (!v0)))))) || (v1 == v0))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":6,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"3c61083a9c026653d885ac94b31fb6b1b525b3d99e31b6117faa368636faf52d","bytes":866},"Proof.lean":{"sha256":"b8906569af7238244a67091715668e503e358a349e41c73f0868bae8e3d4d30e","bytes":599},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-logos-christian-standing","identifier":"hunter-logos-christian-standing","title":"Authored Logos and Christian Standing","author":"Maclain Hunter","sourceSha256":"4c83f85b271c63c9f6b2374b5c06d05c9f1c46cfdee6bce15d91867290fb998d","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:11.847Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:36.362Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, R, R -> Q} |= (P & R) -> Q","sourceOffset":241,"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"],"conclusion":"(P & R) -> Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && 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":"f6bdbdd3ef395019b17cda46a1a3ff3366d6acb5f961df17f5827baf8704e5ed","bytes":867},"Proof.lean":{"sha256":"ec04bb708615b52776849cad8f53f87a79e2dfb55717760dd2fc7d542e0b1c51","bytes":499},"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."},{"slug":"hunter-belief-logos-knowledge","identifier":"hunter-belief-logos-knowledge","title":"Belief in God (Logos) is Knowledge by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"20c588b2fa05694cbca0c8c56bb0734cbacf87b98c0d44a6247eeca021d99567","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:04.891Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:37.252Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q <-> R, R -> P, P -> S, S -> T} |= (((P & Q) & R) & S) & T","sourceOffset":4954,"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","T"],"premises":["P","P -> Q","Q <-> R","R -> P","P -> S","S -> T"],"conclusion":"(((P & Q) & R) & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!(((((v0 && ((!v0) || v1)) && (v1 == v2)) && ((!v2) || v0)) && ((!v0) || v3)) && ((!v3) || v4))) || ((((v0 && v1) && v2) && v3) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":1871,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"83874c00bfaae9f672245e04423b894c907c66d2befd511c20feef3acb6004ff","bytes":11269},"Proof.lean":{"sha256":"e6ec478e877cb6baac4e833a22021d5a8577ea46a5a4ffa03ffe67d647fd064e","bytes":706},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-bells-theorem-global-coherence","identifier":"hunter-bells-theorem-global-coherence","title":"Bell's Theorem and Global Coherence","author":"Maclain Hunter","sourceSha256":"1a30ae6ac9e576ea4ea55dd7efbb117d5bfbd0056101d7d21c78e0521fb92740","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:10.173Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:38.122Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= R","sourceOffset":256,"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","Q -> R"],"conclusion":"R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || 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":"96d45a1355e7e775b65d55e1eff98b7462d48cd660a5e1bd801296095ea43a30","bytes":872},"Proof.lean":{"sha256":"05078850e6380590bfb9676a4daad033cb19b30d7d7d4d90b7432ab8ce5d40c9","bytes":470},"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."},{"slug":"hunter-biblical-logos-truth","identifier":"hunter-biblical-logos-truth","title":"Biblical Logos and Absolute Truth","author":"Maclain Hunter","sourceSha256":"76cb25e159eaff56b70aeff064bba87d2b51fcd3fbc679fcccc7f8a3549138d5","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:02.954Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:39.023Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R} |= (P & Q) & R","sourceOffset":242,"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","Q <-> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v0 == v1)) && (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":"3d1a139b91dd380fb695089439549959962394252dc98ba70e3e1920205164c7","bytes":854},"Proof.lean":{"sha256":"7ce1d93a6e808e230e543e8ce44fc33a465db9eedc4f338e2df146e8495d76e6","bytes":478},"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."},{"slug":"hunter-bivalence-energy-computation","identifier":"hunter-bivalence-energy-computation","title":"Bivalence, Energy, and Computation","author":"Maclain Hunter","sourceSha256":"51368b336331de722a146973269813517b07b8aba84b459267271058a4b28ca2","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:12:11.378Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:39.895Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P -> Q, P -> R} |= P -> ((Q -> R) <-> (R -> Q))","sourceOffset":144,"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","P -> R"],"conclusion":"P -> ((Q -> R) <-> (R -> Q))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((!v0) || v1) && ((!v0) || v2))) || ((!v0) || (((!v1) || v2) == ((!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":"594b23e4edf642185cc528b3e22da4454a387b14479f77db7b8b5572d156761b","bytes":784},"Proof.lean":{"sha256":"ae14a1cb825dddfec730a3edaed418150766829648e48fdad8f620de496bad4a","bytes":502},"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."},{"slug":"hunter-burden-presupposition","identifier":"hunter-burden-presupposition","title":"Burden and Presupposition by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"85054e2b0b77fcf202b6be4750220b0dd7f50cceb76b7b068103cc0590c22f9c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:22.567Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:40.789Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) -> (R & S)","sourceOffset":4355,"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"}],"files":{"source.json":{"sha256":"35634cd6a97018ee05d45a5165de32f70c2012b5cd122e675edafd7e9c52f36a","bytes":7347},"Proof.lean":{"sha256":"d741d3371d27044d79a5c2a6b9ede72986be1616eeb2a27fa380e77a54d2fc74","bytes":531},"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."},{"slug":"hunter-certainty-paradoxical-dichotomy","identifier":"hunter-certainty-paradoxical-dichotomy","title":"Certainty From Paradoxical Dichotomy by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"29663959483f1e24f8d156113d897a439940ba48211c0783c5b8e88a1797b0f8","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T17:44:36.595Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:41.628Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P <-> P} |= (((P v ~P) & (P <-> ~~P)) & ((P -> P) & (~P -> ~P)))","sourceOffset":806,"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"],"premises":["P <-> P"],"conclusion":"(((P v ~P) & (P <-> ~~P)) & ((P -> P) & (~P -> ~P)))","status":"candidate","leanStatement":"theorem inference_1 (v0 : Bool) :\n    ((!(v0 == v0)) || (((v0 || (!v0)) && (v0 == (!(!v0)))) && (((!v0) || v0) && ((!(!v0)) || (!v0))))) = true := by\n  cases v0 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":549,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"594b81530b15abdc32a2dd7564bb425d388fb090ac7f7cda4d5f7865b699b042","bytes":3824},"Proof.lean":{"sha256":"455baa36238399547ed769ac3170609cd1ff7cdff9a76425d455285e0ef2328b","bytes":605},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-certainty-paradoxical-dichotomy-concise-copy","identifier":"hunter-certainty-paradoxical-dichotomy-concise-copy","title":"Certainty From Paradoxical Dichotomy by Maclain Hunter — directly pasted concise copy","author":"Maclain Hunter","sourceSha256":"a4ecaa002731dd17956817c2835b3e4dc01ae6f694a4f5ad3187b8f5577386af","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T17:44:37.205Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:42.495Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P <-> P} |= P v ~P","sourceOffset":87,"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"],"premises":["P <-> P"],"conclusion":"P v ~P","status":"candidate","leanStatement":"theorem inference_1 (v0 : Bool) :\n    ((!(v0 == v0)) || (v0 || (!v0))) = true := by\n  cases v0 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"ef8cd007ea66d4a574b2df7faf9b28229852ce491de23c194914037666a908df","bytes":1143},"Proof.lean":{"sha256":"c32473af4addd7776ab4c78d5b42885f3b15e5231c52bc8b08193ee019f56844","bytes":471},"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."},{"slug":"hunter-certainty-logos-inequality","identifier":"hunter-certainty-logos-inequality","title":"Certainty, Ordered Change, and the Logos Inequality","author":"Maclain Hunter","sourceSha256":"4131aab0b7b5faa8d3a704ed7f7166021ea141dbcfaa05d5a407ca6138f26058","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:34.866Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:42.498Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"901e9fd579e0fc1d49d24c727116ff4de7c310941747a6ebb4f815d0dc148886","bytes":1334},"Proof.lean":{"sha256":"4eff315bd93268754d2855c952e2a7287b2ed2d610f8c1dc7cb5ec4af2c33236","bytes":303},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-continuum-hypothesis-identity","identifier":"hunter-continuum-hypothesis-identity","title":"CH, Set Identity, and Axiomatic Logic","author":"Maclain Hunter","sourceSha256":"89b07f0baabcfe1b6518306e58ae5c4da75df51e58367187132d58f25c21bb35","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:08.902Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:43.359Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (P & Q) & (R & S)","sourceOffset":228,"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":"source_identity_rule","sourceStatement":"A is A","sourceOffset":60,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"110698852ec50a0b00e0ad0dcb473046c42fb6b8b063f8514bf4ae2843a6407e","bytes":869},"Proof.lean":{"sha256":"bd9a53af35d8b944b8caa6da5d197f99366a31f9d1c97f6f4a30a4da31ab7f60","bytes":632},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-heisenberg-research-dialogue","identifier":"hunter-heisenberg-research-dialogue","title":"Chat Log: Revisiting Heisenberg’s Uncertainty Principle","author":"Maclain Hunter","sourceSha256":"8b0e2c2a77746a189a95a281476d6d2bd7eb0bd507af097cd73e18ec881ae8e6","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:13.267Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:43.361Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"4ee0a8e8b414af5ec84c246148e9c256d4a4b51f7290dcb7d0e648d19a2a183d","bytes":21639},"Proof.lean":{"sha256":"b30ffebb5c140302ead3a8b206fb138953b24be6e1d2149d1470b9e6ac54845c","bytes":309},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-christian-logos-modal-coherence","identifier":"hunter-christian-logos-modal-coherence","title":"Christian Logos and Modal Coherence","author":"Maclain Hunter","sourceSha256":"865fbcba6923e255bfe1983dac09622fbdcfa666c6124eab325da820470ecf85","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:19.479Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:44.231Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P & ~~P} |= P -> (P <-> ~(P & ~P))","sourceOffset":234,"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"],"premises":["P","P & ~~P"],"conclusion":"P -> (P <-> ~(P & ~P))","status":"candidate","leanStatement":"theorem inference_1 (v0 : Bool) :\n    ((!(v0 && (v0 && (!(!v0))))) || ((!v0) || (v0 == (!(v0 && (!v0)))))) = true := by\n  cases v0 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"8a689c4203058039d6e0949c64c1bb600647cb537c799c78d79297d76c3fb071","bytes":868},"Proof.lean":{"sha256":"642afb07277fa3fe3a5628262384d1fb76caa58e6cdc57e87fb4ab8ec0284e80","bytes":455},"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."},{"slug":"hunter-coherence-debate-victory","identifier":"hunter-coherence-debate-victory","title":"Coherence and Debate Victory","author":"Maclain Hunter","sourceSha256":"5149d678294acfb9ede01b25758614595f4798741f937a6b16035e36b6320277","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T22:29:41.599Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:45.114Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (Q -> R) -> P","sourceOffset":250,"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"],"conclusion":"(Q -> R) -> P","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && v2)) || ((!((!v1) || v2)) || v0)) = 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":"e88e31c85ae7fcda23cabcc3c4126f3810bb31dc85279b4d3db0c1febf01ca79","bytes":851},"Proof.lean":{"sha256":"9194bfc24af9e981e84942734a50125ac501649f3dff49b600829d5941150cbf","bytes":463},"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."},{"slug":"hunter-coherence-ultimate-wealth","identifier":"hunter-coherence-ultimate-wealth","title":"Coherence as Ultimate Wealth","author":"Maclain Hunter","sourceSha256":"b27d8118921334cc2ebbaa38a1e49803e3e77a5f5f7a861f46bb2db39d1a9b50","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:06.013Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:45.980Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P -> Q, (P & Q) -> R} |= P -> (P -> (Q <-> R))","sourceOffset":233,"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","(P & Q) -> R"],"conclusion":"P -> (P -> (Q <-> R))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((!v0) || v1) && ((!(v0 && v1)) || v2))) || ((!v0) || ((!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":"e8f3c7773e475aa58a8c7a9ebe731818441a25c72a3f6ebdbe04cc9a75ce040a","bytes":856},"Proof.lean":{"sha256":"8d14797c87a19df3d3e15790cae29afd9a2ef5ec62fd57954930502e7a4daf5c","bytes":493},"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."},{"slug":"formal-coherence-score-bounds","identifier":"formal-coherence-score-bounds","title":"Coherence Score Bounds","author":"Maclain Hunter","sourceSha256":"a2a5c4da4b0602feec70eb02bea120499d45d7c68b837311032d8274213b8349","sourceKind":"formal-theorem","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:46.866Z","status":"partial","axiomFree":false,"axioms":["Classical.choice","propext","Quot.sound"],"theoremNames":["HunterAuthored.finite_fixed_point_clamp_bounds"],"units":[{"id":"finite_fixed_point_clamp_bounds","sourceStatement":"Formal statement: ∀array ∈ MCBExponent[]: exponentCoherence(array) ∈ [0, 1]","sourceOffset":0,"scope":"The source's clamp stage on every finite fixed-point/rational representation with a positive denominator: numerator lies between 0 and the denominator, hence the normalized score lies in [0,1]. Variance computation, nonfinite floating values and the current host binding are not certified by this clamp theorem.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def clampNumerator (raw scale : Int) : Int := max 0 (min scale raw)\ntheorem finite_fixed_point_clamp_bounds (raw scale : Int) (positive : 0 < scale) :\n    0 ≤ clampNumerator raw scale ∧ clampNumerator raw scale ≤ scale :=\n  ⟨Int.le_max_left 0 (min scale raw),\n   Int.max_le.mpr ⟨Int.le_of_lt positive, Int.min_le_left scale raw⟩⟩\n#print axioms finite_fixed_point_clamp_bounds\n","kernelStatus":"verified","axioms":["Classical.choice","propext","Quot.sound"],"axiomFree":false,"reportedTheorem":"HunterAuthored.finite_fixed_point_clamp_bounds"}],"files":{"source.json":{"sha256":"33da00df0404d1f3ae4202e3acbd0b6dc21d607686a62838d3360dd2051cbdda","bytes":776},"Proof.lean":{"sha256":"0b962035624058aec72ee0213481a64a4856264a06e66a589632bf3a1ceff7ac","bytes":664},"lean-check.txt":{"sha256":"37e284552556b9fff807f4aef6d328447e527155d47b7ef3823c24c4c44a367e","bytes":164}},"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."},{"slug":"archived-q1063-fa7c5ceb217e","identifier":"archived-q1063-fa7c5ceb217e","title":"Coherence Score Bounds","author":"Maclain Hunter","sourceSha256":"fa7c5ceb217e2f4d8d2f399c22f7113b457ac6778b140edfb8be1874410b9201","sourceKind":"archived-authored-source","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:47.768Z","status":"partial","axiomFree":false,"axioms":["Classical.choice","propext","Quot.sound"],"theoremNames":["HunterAuthored.finite_fixed_point_clamp_bounds"],"units":[{"id":"finite_fixed_point_clamp_bounds","sourceStatement":"{\n  \"name\": \"Coherence Score Bounds\",\n  \"formal\": \"∀array ∈ MCBExponent[]: exponentCoherence(array) ∈ [0, 1]\",\n  \"proof\": \"Standard deviation of binary values bounded by 0.5\",\n  \"implementation\": \"exponentCoherence(array: MCBExponentArray): number\"\n}","sourceOffset":0,"scope":"The source's clamp stage on every finite fixed-point/rational representation with a positive denominator: numerator lies between 0 and the denominator, hence the normalized score lies in [0,1]. Variance computation, nonfinite floating values and the current host binding are not certified by this clamp theorem.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def clampNumerator (raw scale : Int) : Int := max 0 (min scale raw)\ntheorem finite_fixed_point_clamp_bounds (raw scale : Int) (positive : 0 < scale) :\n    0 ≤ clampNumerator raw scale ∧ clampNumerator raw scale ≤ scale :=\n  ⟨Int.le_max_left 0 (min scale raw),\n   Int.max_le.mpr ⟨Int.le_of_lt positive, Int.min_le_left scale raw⟩⟩\n#print axioms finite_fixed_point_clamp_bounds\n","kernelStatus":"verified","axioms":["Classical.choice","propext","Quot.sound"],"axiomFree":false,"reportedTheorem":"HunterAuthored.finite_fixed_point_clamp_bounds"}],"files":{"source.json":{"sha256":"1ad79d41ddf669872dcbf0415610e109ecdf26599c8b52eeb553b10cb8f6b4af","bytes":810},"Proof.lean":{"sha256":"4f5b6cfb6d770da3d0c422f805b8c7882c0dda8d13abe93a410ffbcf296bd451","bytes":664},"lean-check.txt":{"sha256":"37e284552556b9fff807f4aef6d328447e527155d47b7ef3823c24c4c44a367e","bytes":164}},"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."},{"slug":"hunter-coherent-formal-systems","identifier":"hunter-coherent-formal-systems","title":"Coherent Formal Systems of Logic","author":"Maclain Hunter","sourceSha256":"cef48cfcdae0b2bf9459c1767deca1dcb90f633b162a5c582a1aa30182e85aad","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:08.936Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:48.645Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, R, R -> Q} |= ~Q <-> ~(P & R)","sourceOffset":233,"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"],"conclusion":"~Q <-> ~(P & R)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && v2) && ((!v2) || v1))) || ((!v1) == (!(v0 && 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":"5cef63c7f1b80315dfb6791a2b438c746c2b56bc89219a258138fc1958d0ceee","bytes":864},"Proof.lean":{"sha256":"626a07cd8feff1e35196cc5ac370eb8c9d40225677950f5b3318db5f7ea38569","bytes":497},"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."},{"slug":"hunter-coherent-personal-agency","identifier":"hunter-coherent-personal-agency","title":"Coherent Personal Agency and Logic","author":"Maclain Hunter","sourceSha256":"d2ca49aec4057c870900d7309ee6034bb6613dc893fb2498cfef7826ba822cd8","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:02.932Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:49.520Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, (P & Q) -> R} |= (P & Q) & R","sourceOffset":243,"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","(P & Q) -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && ((!(v0 && 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":"08e62646c6a7324b51728350028c2140e881c01f04223d68b938b72dc34bbdb7","bytes":861},"Proof.lean":{"sha256":"e916d13b5e723f9983721470dd71af6412c190676d6949b1d46f4b0b9249a326","bytes":482},"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."},{"slug":"hunter-coherent-reality-reason-rationality","identifier":"hunter-coherent-reality-reason-rationality","title":"Coherent Reality, Reason, Rationality, and Logic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"6ab10bb1148cb3c6112530df710e5aecca69dce8a9dee67e1644db83222ce561","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:03.225Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:50.475Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S, T, T -> U, P <-> T, P -> U} |= ((P & Q) & (R & S) & T) & U","sourceOffset":1816,"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","T","U"],"premises":["P","Q","R","S","T","T -> U","P <-> T","P -> U"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((((v0 && v1) && v2) && v3) && v4) && ((!v4) || v5)) && (v0 == v4)) && ((!v0) || v5))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":1208,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"1f55829b58d76da4e90ac697d1501b5aee059309ff803d7288e0c48a53c5aa8f","bytes":3539},"Proof.lean":{"sha256":"c2301649bdd845c072b53e2f8a9a6549f51cd00b8a64616413a0c52c0400071e","bytes":738},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-coherent-religion-logos","identifier":"hunter-coherent-religion-logos","title":"Coherent Religion and the Superhuman Origin","author":"Maclain Hunter","sourceSha256":"4e00f873701c30e55c8c729f1337937777ce33c66bb5f3eb5fd7a935c42af54c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:21.163Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:51.390Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (S <-> R) <-> (Q <-> P)","sourceOffset":221,"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":"(S <-> R) <-> (Q <-> P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3))) || ((v3 == v2) == (v1 == v0))) = 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"}],"files":{"source.json":{"sha256":"4937f8ec33ae04378f312d14fe18a074e03d12cf15615b3a8f5829709688c15b","bytes":866},"Proof.lean":{"sha256":"427b0531638b9e086b6058831ab1371d1f5b79a0e61f4225d76876086d3e53c0","bytes":537},"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."},{"slug":"hunter-coherent-theism-exclusions","identifier":"hunter-coherent-theism-exclusions","title":"Coherent Theism and Exclusions","author":"Maclain Hunter","sourceSha256":"3a18e1134c18fa1ef920188f7dce13266be49fc5b70ecb9c8dac04f3159c3b39","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:45.171Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:52.413Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, P -> Q, P -> ~R} |= (P & Q) & ~(P & ~Q) -> ~R","sourceOffset":217,"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","P -> Q","P -> ~R"],"conclusion":"(P & Q) & ~(P & ~Q) -> ~R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((((v0 && v1) && v2) && ((!v0) || v1)) && ((!v0) || (!v2)))) || ((!((v0 && 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":"4c0bb18fdcc41a8af8f7f79d178c8dfaa0402dba29dc20116980595f89e42bee","bytes":862},"Proof.lean":{"sha256":"3266913502b2e3316088d7cea175fb909c5d38356e9af19d60074ee7c0bf81e4","bytes":528},"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."},{"slug":"hunter-computing-energy-inversion","identifier":"hunter-computing-energy-inversion","title":"Computing and ASR Energy Inversion","author":"Maclain Hunter","sourceSha256":"a2c94c6566bda118df40258ab6a7be63eee09a7ba0571b039aa0b11f470c0805","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:12:09.108Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:52.415Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P -> Q, Q -> P} |= P & Q","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","Q"],"premises":["P -> Q","Q -> P"],"conclusion":"P & Q","status":"countermodel","countermodel":{"P":false,"Q":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"060bd89f9ba718ebef046269b2d23c49ab26694856f98f1f4ae7e1ae248cb67d","bytes":860},"Proof.lean":{"sha256":"8aecd48fd561f5b8d437e90f46946f4dd076034f69cd19fad1d48a2e84f727dd","bytes":286},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-conceptualization-of-logic","identifier":"hunter-conceptualization-of-logic","title":"Conceptualization of Logic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"0f871732310297d10b6727dab116410d4c4ca4f3fabe821d54b7226800c98123","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T14:38:29.980Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:52.418Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q, R <-> Q, P -> S, P <-> ~T, P -> ~U} |= ((((P & Q) & R) & S) & ~T) & ~U","sourceOffset":941,"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","T","U"],"premises":["P <-> Q","R <-> Q","P -> S","P <-> ~T","P -> ~U"],"conclusion":"((((P & Q) & R) & S) & ~T) & ~U","status":"countermodel","countermodel":{"P":false,"Q":false,"R":false,"S":false,"T":true,"U":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"dc7dbca7f11f1b4691fe0d48f2dfd7fc3e6c2b9c09c84a7fe1e549eed40127ba","bytes":2170},"Proof.lean":{"sha256":"140b7b5e8a7e8a30994c32f00cebb61cf8fc7fbd499ad8fd35310d708107e722","bytes":296},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-concise-proof-process","identifier":"hunter-concise-proof-process","title":"Concise Proof and Process","author":"Maclain Hunter","sourceSha256":"44673fdcba91c87c6a4722cf09d4574e32fbdcf68fd5e38cee5529855b81d199","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:31:53.643Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:53.367Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P → Q, Q → R, R → S, S → T, T → U, U → P, ~(~P & ~Q & ~R & ~S & ~T & ~U)} |= ((P & Q) & (R & S) & T) & U","sourceOffset":27,"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","T","U"],"premises":["P","P → Q","Q → R","R → S","S → T","T → U","U → P","~(~P & ~Q & ~R & ~S & ~T & ~U)"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5)) && ((!v5) || v0)) && (!((((((!v0) && (!v1)) && (!v2)) && (!v3)) && (!v4)) && (!v5))))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"15aa38dacfbde44564ab3e2a28ce720737bdf2ea5559a4764d65409507a9d006","bytes":5246},"Proof.lean":{"sha256":"37f5c6cb9cabf09dfc5f1f0b698f9da2b973a0de8a50a6a2aa1a3a320a8e7ea7","bytes":693},"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."},{"slug":"formal-conditional-determinism","identifier":"formal-conditional-determinism","title":"Conditional Determinism","author":"Maclain Hunter","sourceSha256":"6cb8cd31364ff39227ce4abbd13e669a242c6a1bb7ba6a1cdec2c23a2553ae53","sourceKind":"formal-theorem","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:54.225Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.conditional_returns_declared_branch"],"units":[{"id":"conditional_returns_declared_branch","sourceStatement":"Formal statement: ∀c,t,e: mcbConditional(c,t,e) ∈ {t, e}","sourceOffset":0,"scope":"Universal branch membership for the declared deterministic conditional, over arbitrary result types.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"theorem conditional_returns_declared_branch {α : Type} (condition : Bool) (t e : α) :\n    (if condition then t else e) = t ∨ (if condition then t else e) = e := by\n  cases condition\n  · exact Or.inr rfl\n  · exact Or.inl rfl\n#print axioms conditional_returns_declared_branch\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.conditional_returns_declared_branch"}],"files":{"source.json":{"sha256":"2d323dea796010e9c5c190ba5f841bb1887569f31f87389d1be56500db43d935","bytes":746},"Proof.lean":{"sha256":"da37f151532848baffce74171f439f6460f99437a5ad0afb4718170395590af0","bytes":555},"lean-check.txt":{"sha256":"a54bde994b92162852a8caaf91ab837249a7827346df70328312c165b96a640c","bytes":139}},"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."},{"slug":"archived-q1061-d17a3726a953","identifier":"archived-q1061-d17a3726a953","title":"Conditional Determinism","author":"Maclain Hunter","sourceSha256":"d17a3726a9531ad56a817bc94a22f0200baa806232abd05e31238c3b3d0fb2c9","sourceKind":"archived-authored-source","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:55.105Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.conditional_returns_declared_branch"],"units":[{"id":"conditional_returns_declared_branch","sourceStatement":"{\n  \"name\": \"Conditional Determinism\",\n  \"formal\": \"∀c,t,e: mcbConditional(c,t,e) ∈ {t, e}\",\n  \"proof\": \"c.state ∈ {+1, -1} maps deterministically to branches\",\n  \"implementation\": \"mcbConditional(condition, thenBranch, elseBranch): MCBComputationUnit\"\n}","sourceOffset":0,"scope":"Universal branch membership for the declared deterministic conditional, over arbitrary result types.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"theorem conditional_returns_declared_branch {α : Type} (condition : Bool) (t e : α) :\n    (if condition then t else e) = t ∨ (if condition then t else e) = e := by\n  cases condition\n  · exact Or.inr rfl\n  · exact Or.inl rfl\n#print axioms conditional_returns_declared_branch\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.conditional_returns_declared_branch"}],"files":{"source.json":{"sha256":"81682f6b75ffea3b7d7903f93d57be553bbe03018251d5ba716b1e23c79aadad","bytes":815},"Proof.lean":{"sha256":"774070b9ebde01421c252a4284a2f003e2b762b15881bce844703d156c1ebe49","bytes":555},"lean-check.txt":{"sha256":"a54bde994b92162852a8caaf91ab837249a7827346df70328312c165b96a640c","bytes":139}},"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."},{"slug":"hunter-consistency-completeness","identifier":"hunter-consistency-completeness","title":"Consistency and Completeness by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"53d97c616c1c1e3268b8200c603e7bdee76d092ce2327c43e3f353043b8859a1","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:22:42.854Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:56.012Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= (((P & Q) & R) <-> S) -> T","sourceOffset":1916,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"(((P & Q) & R) <-> S) -> T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || ((!(((v0 && v1) && v2) == v3)) || v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{GIT, ~R} |= GIT -> ~P","sourceOffset":5097,"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":["GIT","P","R"],"premises":["GIT","~R"],"conclusion":"GIT -> ~P","status":"countermodel","countermodel":{"GIT":true,"P":true,"R":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"9899e310226f6edb8b2974fe8a6c32824f4964b364b69771d00a5f582e331288","bytes":7323},"Proof.lean":{"sha256":"d3e1951253fc27e214d9e9c670bc6b84fa67002bd5fc496db00e6266df260b86","bytes":586},"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."},{"slug":"hunter-continuous-energy-production","identifier":"hunter-continuous-energy-production","title":"Continuous Energy and Logical Translation","author":"Maclain Hunter","sourceSha256":"33313d99020c611c43288c3810bfac0cdc4235c5578143a7a76072f8c6869502","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:12:06.438Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:56.015Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P -> Q, Q -> R} |= (P & Q) & R","sourceOffset":221,"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","Q -> R"],"conclusion":"(P & Q) & R","status":"countermodel","countermodel":{"P":false,"Q":false,"R":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"e39536af79d3ac6c96d05c9a676d6d0487749233d8ef037b0080cf26c63c3c1f","bytes":851},"Proof.lean":{"sha256":"330081b1bcf60527a3d2dfc5d20e1df164e27d1f44bac0f87a59663a90a1c970","bytes":293},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-correcting-godel","identifier":"hunter-correcting-godel","title":"Correcting Gödel","author":"Maclain Hunter","sourceSha256":"c652f17d6bc124e0dfd0dffb02e84a84b74f621c7ca708a28492debbc2c9b881","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:31:16.777Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:56.017Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"e58208a735a484e5ef37e347b1c8d5dab2b14bb864ef0f8cf117bd6900c443df","bytes":4247},"Proof.lean":{"sha256":"91a01ec13bac28b1a61a34ce8949f4ec463798fc5c2196b546403b9231bc98f5","bytes":269},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-correcting-kant","identifier":"hunter-correcting-kant","title":"Correcting Kant","author":"Maclain Hunter","sourceSha256":"cb2543267ae032365ce3090ade459f24cb1b064d118005e8df0e244c8ce134af","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:31:02.912Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:56.019Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"cc418b51c7ff0e59da9b29461ec8f08a4c419e76dc4b2329296d25faee90bd84","bytes":6077},"Proof.lean":{"sha256":"d5f5eb49cb4640acf894f48cdf0fb3a5f6e2428f94b594f24f51626e32412cb9","bytes":267},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-damp-numbered-method","identifier":"hunter-damp-numbered-method","title":"DAMP — Numbered Algorithm and Method","author":"Maclain Hunter","sourceSha256":"007b2fe4b7da0debdfd51d53d1dad9f529a9a3db881db0a131969e452bd785be","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:31:08.447Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:56.022Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"f700364c75b78ecfd2b1cefb7f3ef398f958489013564ac33da00bf8405ad30f","bytes":3826},"Proof.lean":{"sha256":"23726768bde35c871dd30afb1a9d71fcadd5dfe853c87890113f1926d46f2fc7","bytes":290},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-debunking-maxwells-demon","identifier":"hunter-debunking-maxwells-demon","title":"Debunking Maxwell’s Demon","author":"Maclain Hunter","sourceSha256":"0c9519b04feccba16361930ca28f487527e873969d45c94bed04b8bfba81f1b5","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:06.036Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:56.914Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{G, G → O, O → D} |= (G & O) & D","sourceOffset":1661,"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":["D","G","O"],"premises":["G","G → O","O → D"],"conclusion":"(G & O) & D","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v1 && ((!v1) || v2)) && ((!v2) || v0))) || ((v1 && v2) && v0)) = 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"},{"id":"inference_2","sourceStatement":"{~G, ~G → ~O, ~O → ~D} |= (~G & ~O) & ~D","sourceOffset":1744,"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":["D","G","O"],"premises":["~G","~G → ~O","~O → ~D"],"conclusion":"(~G & ~O) & ~D","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 : Bool) :\n    ((!(((!v1) && ((!(!v1)) || (!v2))) && ((!(!v2)) || (!v0)))) || (((!v1) && (!v2)) && (!v0))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"9dc55a74d266769e0273b8f5257352131a4a1dc701becaac1eaae2fc93a763a4","bytes":3165},"Proof.lean":{"sha256":"c9923a16305e22439ee62c4ef42fa9e19e60485dfbbff6a22e04fe71ea747ead","bytes":702},"lean-check.txt":{"sha256":"9dd24ecb3d82c309e42e8e914b5df3ec490fd2259644de7d887fca9eeff5dfe5","bytes":174}},"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."},{"slug":"hunter-defined-god-logic","identifier":"hunter-defined-god-logic","title":"Defined God and Logical Existence","author":"Maclain Hunter","sourceSha256":"26a62e24ed847d0269e33606e3d1b50634b5084d20622dc6aceaed71349c7b78","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T22:22:42.650Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:57.801Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (P & Q) & R","sourceOffset":249,"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"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && 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":"f1bb4f7d29995a68ac9aa0ebf3c651c9d9263769ea6ee132e122081102825182","bytes":846},"Proof.lean":{"sha256":"40b4f9a60a0d4e902395066e82667ff835c31d6c21f302e9b6efced4f15b2a52","bytes":462},"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."},{"slug":"hunter-definitions-etymology-elaborations","identifier":"hunter-definitions-etymology-elaborations","title":"Definitions, Etymology, and Elaborations by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"07b9543282b18ff702fc6572091d26ac21947aacefd4bfa4f611cbb43a5b358d","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:26.435Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:58.760Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T, T <-> U, U -> P} |= ((P & Q) & (R & S) & T) & U","sourceOffset":4517,"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","T","U"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T","T <-> U","U -> P"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!((((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4)) && (v4 == v5)) && ((!v5) || v0))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"6cc09fa65cf9379c4ea0258b88945b5ebe504551a5cd78e62861da8f21b953c4","bytes":9701},"Proof.lean":{"sha256":"54c3215a4b310eb657c5eda6131d4d9684d46046c88e6d318511cc7ac966a2c0","bytes":642},"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."},{"slug":"hunter-universal-logic-educational-attainment","identifier":"hunter-universal-logic-educational-attainment","title":"Degree from the University of Universal Logic — Educational Attainment Proposal","author":"Maclain Hunter","sourceSha256":"9a41f0f18e6b5e890f2220b2b9d3f8a618a3cc29ada1e449f6d12a07cd10e1f6","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:17.183Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:37:59.760Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S, T, U, V} |= (((P & Q) & (R & S) & T) & U) & V","sourceOffset":3786,"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","T","U","V"],"premises":["P","Q","R","S","T","U","V"],"conclusion":"(((P & Q) & (R & S) & T) & U) & V","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 v6 : Bool) :\n    ((!((((((v0 && v1) && v2) && v3) && v4) && v5) && v6)) || (((((v0 && v1) && (v2 && v3)) && v4) && v5) && v6)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> cases v6 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":187,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"5f89a292c480b01e86ca918cf1d84d35d736ccdcd47c65ed96fe73b908c355aa","bytes":5520},"Proof.lean":{"sha256":"a574ec13b967e9fb9e6e8bf4b8147096b5f2a6693e684a34a0380acf2260e79a","bytes":739},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-deism-monism","identifier":"hunter-deism-monism","title":"Deism and Monism","author":"Maclain Hunter","sourceSha256":"42dfff34480899af01791f49b63cdfb1ad06dac3846267c1f696728b55c4ae44","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:57.499Z","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:00.768Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q} |= P <-> Q","sourceOffset":258,"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"],"premises":["P","Q"],"conclusion":"P <-> Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && v1)) || (v0 == v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"d9dd67c83f8f54507cbbf713bb5a94c3796a7250242bb9816ea04818717ec83f","bytes":831},"Proof.lean":{"sha256":"f0a5c9fcf5a4a1e398f1242a5e696fd099629352938456e6929efcedaf526d45","bytes":413},"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."},{"slug":"hunter-proven-logician-standing","identifier":"hunter-proven-logician-standing","title":"Demonstrated Logical Knowledge and Standing","author":"Maclain Hunter","sourceSha256":"d6c7404169b6a28234c29ed39dc4c0436be7efa23d641f94b3690c2f9ec5a25f","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:45:15.768Z","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:01.987Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) & R","sourceOffset":234,"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","Q -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!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":"61e3c8178815f099f07b0825076b268290ff4067cb7483a9c7f8c1e62a1da48e","bytes":867},"Proof.lean":{"sha256":"d1e35b87e10166b48516b5287a26f234f84bc07535dc364679200ecddba78dac","bytes":494},"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."},{"slug":"hunter-denying-logos-demanding-proof","identifier":"hunter-denying-logos-demanding-proof","title":"Denial of Logos and the Demand for Proof","author":"Maclain Hunter","sourceSha256":"91a88cb99f7325570398ccabd67fcbbbaf74367b25162bb66fab907ce6e696ce","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:11.551Z","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:02.007Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{6 <-> 5, 5 <-> 4, 4 <-> 3, 3 <-> 2, 2 <-> 1} |= ((((1 & 2) & 3) & 4) & 5) & 6","sourceOffset":1646,"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":["1","2","3","4","5","6"],"premises":["6 <-> 5","5 <-> 4","4 <-> 3","3 <-> 2","2 <-> 1"],"conclusion":"((((1 & 2) & 3) & 4) & 5) & 6","status":"countermodel","countermodel":{"1":false,"2":false,"3":false,"4":false,"5":false,"6":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"a122766e82b6af0f00d94b0ddca136e20364a0110d5ec1e96fbc2887728b6695","bytes":3860},"Proof.lean":{"sha256":"cd8507770f8f251e3c4885b5c88ffe05d9c288ff967d0a4d3d6d441db5bb1c4d","bytes":292},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-dialogic-genesis","identifier":"hunter-dialogic-genesis","title":"Dialogic Genesis","author":"Maclain Hunter","sourceSha256":"b026462e58a83bae743f277e9c5921c22a01686b740d4794f132998bf109957e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:47.781Z","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:02.009Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"a3698200d0b6d590ffc421bb2119afdab6254fca21de4f651639ab4307a8fb17","bytes":3374},"Proof.lean":{"sha256":"17e3d50034105b6cb60944607c4638acb8c4a01e5e54d6d88edb02c3b60be9b5","bytes":268},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-universal-physical-uncertainty","identifier":"hunter-universal-physical-uncertainty","title":"Disproving Universal and Physical Uncertainty","author":"Maclain Hunter","sourceSha256":"f9225f4080a53780e1a02ea7230fe0edbd1c47ae762688fbf2279f596c6762d3","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:16.765Z","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:03.166Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= (((P & Q) & R) & S) & T","sourceOffset":2619,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"(((P & Q) & R) & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || ((((v0 && v1) && v2) && v3) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":2254,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"7792c2616dafe863449e19800a3a99b7bdf91bdf85a7d4144f0b52454a01c45e","bytes":6770},"Proof.lean":{"sha256":"836e2271fb5195e6dda1846bc533f8a856bd7a94b19f4cf649ce15fbd91563be","bytes":683},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-dynamic-algebra","identifier":"hunter-dynamic-algebra","title":"Dynamic Algebra","author":"Maclain Hunter","sourceSha256":"b094b3b45434bc37e56179ac2bf1677d8eccd37308ecc7f21a4377e5f9788970","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:31:04.278Z","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:03.170Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"c26d59d6c6628205a2eb9319d5deb664ca8257da26bbacabcb427a63e10b7e93","bytes":7461},"Proof.lean":{"sha256":"3def3a43d66bc32b9240477993d309d132afd73ba5a8552a5f1dda73c9b45003","bytes":267},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"formal-dynamic-universal-proof-theorem-of-logos","identifier":"formal-dynamic-universal-proof-theorem-of-logos","title":"Dynamic Universal Proof (Theorem of Logos)","author":"Maclain Hunter","sourceSha256":"3211b94553de18d44a03499c2520280e79bdce290d4514c484e07bde354de1b1","sourceKind":"formal-theorem","recordedAt":null,"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:04.079Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.logical_ground_necessary_existence"],"units":[{"id":"logical_ground_necessary_existence","sourceStatement":"Formal statement: Σ(P, Q?, R?, S?, T?, U?) |= □∃Logos","sourceOffset":0,"scope":"Constructive necessity of the displayed Logical Ground law-model (identity, noncontradiction, implication and two-state excluded middle), across arbitrary accessibility and unfixed extra premises. The source's broader ontology and God/creator identity remain authored and are not silently replaced by this law-model.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"structure LogicalGround where\n  identity : ∀ (α : Type), ∀ a : α, a = a\n  noncontradiction : ∀ p : Prop, p → (p → False) → False\n  implication : ∀ p q : Prop, p → (p → q) → q\n  excludedMiddle : ∀ b : Bool, b = true ∨ b = false\ndef constructiveLogos : LogicalGround where\n  identity := fun _ _ => rfl\n  noncontradiction := fun _ hp hn => hn hp\n  implication := fun _ _ hp h => h hp\n  excludedMiddle := fun b => by cases b; exact Or.inr rfl; exact Or.inl rfl\ndef necessary {World : Type} (access : World → World → Prop) (claim : World → Prop) (w : World) :=\n  ∀ v : World, access w v → claim v\ntheorem logical_ground_necessary_existence {World : Type} (access : World → World → Prop)\n    (w : World) (_unfixed : List Prop) :\n    necessary access (fun _ => Nonempty LogicalGround) w :=\n  fun _ _ => ⟨constructiveLogos⟩\n#print axioms logical_ground_necessary_existence\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.logical_ground_necessary_existence"}],"files":{"source.json":{"sha256":"395bdfe8eb745d464cd250154805a7da52dd2a1e403f3a39f9f64f68a00656bf","bytes":1065},"Proof.lean":{"sha256":"1313520dba04aace65dc18d8da9ef7ba9904b79aefdf97f06a1c422e901fd191","bytes":1203},"lean-check.txt":{"sha256":"3e099b11c629075315eba705b15391a10921ed971b6c1c9c43a51651865abf18","bytes":138}},"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."},{"slug":"archived-q1066-338267a32930","identifier":"archived-q1066-338267a32930","title":"Dynamic Universal Proof (Theorem of Logos)","author":"Maclain Hunter","sourceSha256":"338267a329307016b7a72b93b7e969e2ce8b5f861a8efdc957f18075c71c70ba","sourceKind":"archived-authored-source","recordedAt":null,"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:04.952Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.logical_ground_necessary_existence","HunterAuthored.source_identity_rule"],"units":[{"id":"logical_ground_necessary_existence","sourceStatement":"{\n  \"name\": \"Dynamic Universal Proof (Theorem of Logos)\",\n  \"number\": 14,\n  \"era\": \"G6\",\n  \"formal\": \"Σ(P, Q?, R?, S?, T?, U?) |= □∃Logos\",\n  \"structure\": {\n    \"P\": \"ψ ↔ (Δ × A) will be what/who it will be (Δ × A) with/within Continuous Discretion\",\n    \"Q\": \"unfixed - logician places tautological premise(s) here\",\n    \"R\": \"unfixed - logician places tautological premise(s) here\",\n    \"S\": \"unfixed - logician places tautological premise(s) here\",\n    \"T\": \"unfixed - logician places tautological premise(s) here\",\n    \"U\": \"unfixed - logician places tautological premise(s) here\"\n  },\n  \"deltaDefinition\": \"Δ = dynamic tautology with continuous discretion\",\n  \"proof\": {\n    \"step1\": \"Establish Dynamic Anchor: P is self-affirming tautology (Logos = Logos)\",\n    \"step2\": \"Recognize Unfixed Structure: Q-U preserve dynamic universality\",\n    \"step3\": \"Apply Identity Necessity: □(A = A) → □P\",\n    \"step4\": \"Derive Universal Validity: ¬P → requires P (performative self-refutation)\",\n    \"step5\": \"Conclude Necessary Existence: P undeniable ∧ □P → □∃Logos\"\n  },\n  \"conclusion\": \"The Dynamic Universal Logic (Logos) must exist as a matter of tautology & logical necessity\",\n  \"significance\": [\n    \"First dynamic proof of Logos - valid without fixed premises\",\n    \"Unfixedness mirrors Logos's universality\",\n    \"Not constrained by any particular formulation\",\n    \"Self-validating through any coherent extension\",\n    \"Master theorem for 4P Verification Engine\"\n  ],\n  \"verificationProtocol\": {\n    \"method\": \"Nested AI Simulation\",\n    \"targetIterations\": \"10 × 10^6\",\n    \"validation\": \"7 Cycle Logic per iteration\",\n    \"review\": \"Independent AI panel evaluation\"\n  },\n  \"author\": \"Maclain Hunter\",\n  \"fourPAlignment\": {\n    \"Logic\": {\n      \"aligned\": true,\n      \"reason\": \"This IS the universal proof of Logic itself\"\n    },\n    \"God\": {\n      \"aligned\": true,\n      \"reason\": \"Affirms divine rational principle as necessary\"\n    },\n    \"Truth\": {\n      \"aligned\": true,\n      \"reason\": \"Tautological structure guarantees truth\"\n    },\n    \"Nothing\": {\n      \"aligned\": false,\n      \"reason\": \"Rejects the void - Logos necessarily exists\"\n    },\n    \"Doubt\": {\n      \"aligned\": false,\n      \"reason\": \"Self-refuting to doubt - denial requires Logos\"\n    }\n  }\n}","sourceOffset":0,"scope":"Constructive necessity of the displayed Logical Ground law-model (identity, noncontradiction, implication and two-state excluded middle), across arbitrary accessibility and unfixed extra premises. The source's broader ontology and God/creator identity remain authored and are not silently replaced by this law-model.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"structure LogicalGround where\n  identity : ∀ (α : Type), ∀ a : α, a = a\n  noncontradiction : ∀ p : Prop, p → (p → False) → False\n  implication : ∀ p q : Prop, p → (p → q) → q\n  excludedMiddle : ∀ b : Bool, b = true ∨ b = false\ndef constructiveLogos : LogicalGround where\n  identity := fun _ _ => rfl\n  noncontradiction := fun _ hp hn => hn hp\n  implication := fun _ _ hp h => h hp\n  excludedMiddle := fun b => by cases b; exact Or.inr rfl; exact Or.inl rfl\ndef necessary {World : Type} (access : World → World → Prop) (claim : World → Prop) (w : World) :=\n  ∀ v : World, access w v → claim v\ntheorem logical_ground_necessary_existence {World : Type} (access : World → World → Prop)\n    (w : World) (_unfixed : List Prop) :\n    necessary access (fun _ => Nonempty LogicalGround) w :=\n  fun _ _ => ⟨constructiveLogos⟩\n#print axioms logical_ground_necessary_existence\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.logical_ground_necessary_existence"},{"id":"source_identity_rule","sourceStatement":"A = A","sourceOffset":885,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"74b1488bdb12fee915c4a35035e08efcb371ae157c62049e0e9b21a74e3e87b1","bytes":3063},"Proof.lean":{"sha256":"84e65cfb4e5abf7833470029069f39ea966a5999e55b3e84a202a2e3a922e0e3","bytes":1304},"lean-check.txt":{"sha256":"1cd34f8d1d4ac41bbbc49c7accfc7162889b21218de4cb56005274db82283f84","bytes":206}},"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."},{"slug":"hunter-empirical-coherence-physics","identifier":"hunter-empirical-coherence-physics","title":"Empirical Coherence and Physical Fields","author":"Maclain Hunter","sourceSha256":"53274b474ec6bb4b4ea37aeb9f70cc6ff813ffa476d074ff432ff5a8fbb137bf","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:30.388Z","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:05.868Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= ~(Logic)","sourceOffset":181,"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":["Logic","P","Q","R"],"premises":["P","Q","R"],"conclusion":"~(Logic)","status":"countermodel","countermodel":{"Logic":true,"P":true,"Q":true,"R":true},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= P -> ((Q & R) & S)","sourceOffset":204,"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_2 (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_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"3d5846633ee27814b31175921e45ebb9d01a705a88b517ba3bbf41876e5f8254","bytes":853},"Proof.lean":{"sha256":"c0be4e747d9fe7123f14695eb8e69806378b4e4fbaf9db2569567819d1a71c86","bytes":536},"lean-check.txt":{"sha256":"740863296048b83b7cd879ce809b9047c55288a43dfa8b77f4b45e1d50e9c3b3","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."},{"slug":"hunter-observable-formal-proof","identifier":"hunter-observable-formal-proof","title":"Empirically Observable Formal Proof","author":"Maclain Hunter","sourceSha256":"51405d6ea3d3bb5365b0743d0cc94c06db86a714311f14e3081ff3f09ccd3d30","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:06.162Z","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:06.748Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R <-> (P & Q)} |= (P & Q) & R","sourceOffset":239,"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 <-> (P & Q)"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && (v2 == (v0 && 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"},{"id":"source_identity_rule","sourceStatement":"Logic is Logic","sourceOffset":3,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"5eb680568ffc76b60c4a18d9c44395db48a1eb563fe6240c2502b5312ab72d01","bytes":856},"Proof.lean":{"sha256":"31d5336d018dfe2c9240e139e11d08f4475f4cdf84fb5bac19f6fa7f7d4ec6b3","bytes":581},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-empiricism-existentialism","identifier":"hunter-empiricism-existentialism","title":"Empiricism and Existentialism","author":"Maclain Hunter","sourceSha256":"0f10aac200c9c81352300cbf555d3a197cf74068eac77b1affef183bb8acaddd","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:50.612Z","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:07.640Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q} |= P & Q","sourceOffset":257,"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"],"premises":["P","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"43cee7f1ec14ea6c7e86ccea1bfa0ff922a4d63a3c4a289734e37f6dfc72760a","bytes":858},"Proof.lean":{"sha256":"4f5c85aaf3bf5a0c33b6da339fd8804a04cd8f9da9db530c5d09ff7bbce97fd7","bytes":426},"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."},{"slug":"hunter-ergot-lsd-god","identifier":"hunter-ergot-lsd-god","title":"Ergot, Ergotamine, LSD, and God by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"a9cfd725c8a517493df5a1b232fad6800ef0e4fc3397dd624288cc6e45afe766","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:22:40.145Z","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:08.565Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_4"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S, T} |= ((P & Q) -> (R & S)) <-> T","sourceOffset":2248,"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","T"],"premises":["P","Q","R","S","T"],"conclusion":"((P & Q) -> (R & S)) <-> T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && v1) && v2) && v3) && v4)) || (((!(v0 && v1)) || (v2 && v3)) == v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P, Q, R, S, T} ⊨ L","sourceOffset":3584,"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":["L","P","Q","R","S","T"],"premises":["P","Q","R","S","T"],"conclusion":"L","status":"countermodel","countermodel":{"L":false,"P":true,"Q":true,"R":true,"S":true,"T":true},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"inference_3","sourceStatement":"{1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14} |= (((((((((((((1 & 2) & 3) & 4) & 5) & 6) & 7) & 8) & 9) & 10) & 11) & 12) & 13) & 14)","sourceOffset":8906,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"More than ten atomic identities requires a non-enumerative formalization","kernelStatus":"not_checked"},{"id":"inference_4","sourceStatement":"{A, B} |= (A <-> B) <-> (B <-> A)","sourceOffset":9984,"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"],"premises":["A","B"],"conclusion":"(A <-> B) <-> (B <-> A)","status":"candidate","leanStatement":"theorem inference_4 (v0 v1 : Bool) :\n    ((!(v0 && v1)) || ((v0 == v1) == (v1 == v0))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_4\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_4"}],"files":{"source.json":{"sha256":"05ae295f2a83cbf117dacac3d946c6243309cf8ec4a08e41a36f22ba7f094f9c","bytes":12639},"Proof.lean":{"sha256":"3af6c9da704e74e2d9bcf7f051a18e90cc46fc481e582a64d57e80f3e825158b","bytes":707},"lean-check.txt":{"sha256":"de10c422213cf6d27e6f7dc215d7acbaa215b9ff66864d1b67470f942f766df1","bytes":174}},"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."},{"slug":"hunter-essential-logic-extraterrestrial-life","identifier":"hunter-essential-logic-extraterrestrial-life","title":"Essential Logic and Extraterrestrial Life by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"7db27ad944499d4f80c7068b099cdc463bec8fa2be8d9747bc0687ed6c90f41e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:57:28.150Z","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:09.418Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":1986,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"89fec439fcc9464abd364d1eeb7b3e9a3f0b00e176a8bc1d8474e4e3cdee40a7","bytes":4978},"Proof.lean":{"sha256":"092e8c5a5d7f511ae177c11a41b8bb9a30f9ad4a06401e9b5923ef1f1804e4fb","bytes":411},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-everything-is-proof","identifier":"hunter-everything-is-proof","title":"Everything is Proof by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"0550ab97e05f6295c562b6ca710f0f354754ea2ef0d58758bbeb6b6a8b112215","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:42:10.003Z","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:10.288Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (P & Q) <-> (R -> (P <-> Q))","sourceOffset":602,"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"],"conclusion":"(P & Q) <-> (R -> (P <-> Q))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && v2)) || ((v0 && 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":"095083670b49d881ad0f920b2ab682ebbf8b83d002a04f3d8bf8e9fbe478a384","bytes":2835},"Proof.lean":{"sha256":"2f2f7786dff2e0fb45e0c5f4197c80536e7c93b167563b906e47302cf5d40dfc","bytes":485},"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."},{"slug":"hunter-evidence-requires-logic","identifier":"hunter-evidence-requires-logic","title":"Evidence Requires Logic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"a9a7aefc5ea45036d8698113400a74cd2413da18f05c51608ce45a69275ec159","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:42:32.100Z","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:11.172Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R <-> S} |= (P & Q) -> (R & S)","sourceOffset":865,"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"}],"files":{"source.json":{"sha256":"d626a77cc35fd0a04343268e0e858387d327f323d3b30077142b6bc629324029","bytes":2906},"Proof.lean":{"sha256":"3a3e7989e59f0a711c27562cadbd8ac9729685f1887df94e285a2186b8832eed","bytes":535},"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."},{"slug":"hunter-origin-evidence-proof","identifier":"hunter-origin-evidence-proof","title":"Evidence, Proof, and the First Cause by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"13dd5d8ca98bf07f58f9b1b0bc03d48344d418a469e237108819e459874d952e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T15:32:33.485Z","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:11.174Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q} |= □(P & Q), □(∃(x, y, z)","sourceOffset":234,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"□(P & Q), □(∃(x, y, z)\"","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"deefbeb6e0f97e2b4c9c03764c96cb55aedef5d077af3bb94df92a7702cf2e94","bytes":881},"Proof.lean":{"sha256":"a966f03e56ab0a414dc56456b8c3b4071a1558bb479ea9f675bb9e60dce97581","bytes":306},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-existence-logical-demonstration","identifier":"hunter-existence-logical-demonstration","title":"Existence and Demonstrated Logical Reasoning","author":"Maclain Hunter","sourceSha256":"28b3fe511ee005ac2a3848c7cdf9a61a78dcd5b4f59a5018d32ce24a9f8f6c9e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:06.044Z","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:11.176Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{[P],[P]->[Q],[Q]->[R],[R]->[S],[S]->[P]}|=([P]&[Q])&([R]&[S])","sourceOffset":20,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"[P]\"","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{[P],[P]->[P]}|=[P]","sourceOffset":1378,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"[P]\"","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"a6a63f947960ffa4ecb4c852f0022095086acb204a456e62abba3acf2e96f48e","bytes":3760},"Proof.lean":{"sha256":"b1f3ce15f363334577ca833041517123626e91ab3a362af498eab74c93210a54","bytes":296},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-explicit-logic-knowledge-research","identifier":"hunter-explicit-logic-knowledge-research","title":"Explicit Proof of Logic Knowledge — Research and Challenge","author":"Maclain Hunter","sourceSha256":"5a3a194a0270cb07786d089a26fa41d386964113d339fc85f2982c50eecbad95","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:45:18.642Z","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:11.178Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"e996f61ebaa0e40cbb232dd5832b4f99be83781cd1170672a0bb546966d45f58","bytes":891},"Proof.lean":{"sha256":"a0e8cb9a9f7c83f95afc8693c106865882a2fae072a7fa98f68614cb8223cf82","bytes":312},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-nothing-nowhere-logical-ground","identifier":"hunter-nothing-nowhere-logical-ground","title":"Exploring Concepts of Nothing and Nowhere by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"04b55541939a50d8cde70951ac6429052ada570ec761b07c636e81ba594d6ee2","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:17.469Z","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:12.053Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, P <-> Q, Q <-> P, Q, P} |= (P & Q) <-> (Q & P)","sourceOffset":1004,"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"],"premises":["P","Q","P <-> Q","Q <-> P","Q","P"],"conclusion":"(P & Q) <-> (Q & P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(((((v0 && v1) && (v0 == v1)) && (v1 == v0)) && v1) && v0)) || ((v0 && v1) == (v1 && v0))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"a192132a9861c3e8cf22480e38eefd120a88201ba64543111e967269725b1a9a","bytes":2587},"Proof.lean":{"sha256":"26f7100491a41a7b581e4ed4215cf4c80ffba5f2c4e58043c48110c55ea8c298","bytes":520},"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."},{"slug":"hunter-meanings-necessary-logical-roots","identifier":"hunter-meanings-necessary-logical-roots","title":"Exploring Meaning’s Necessary Logical Roots","author":"Maclain Hunter","sourceSha256":"12affa34df528b362083a2443ecfb29b3acd7a45b74f1b053007dad426ef51b0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:38:02.102Z","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:12.934Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q} |= P & Q","sourceOffset":823,"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"],"premises":["P","P -> Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && ((!v0) || v1))) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":152,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"4c0573c6ed7d67c8c6ee8af4acb87de47b0e482c142b8c1f834c3db529aa73ff","bytes":2071},"Proof.lean":{"sha256":"00d75d8564da5d0c8ecc1350838ec3309a1f652fd0961576abe17fdee275812e","bytes":554},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"formal-exponent-multiplication-parity","identifier":"formal-exponent-multiplication-parity","title":"Exponent Multiplication Parity","author":"Maclain Hunter","sourceSha256":"84fe5492d3f527cd1c959228d59ea71762363696064d4226925d2756b3dc8b67","sourceKind":"formal-theorem","recordedAt":null,"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:14.008Z","status":"partial","axiomFree":false,"axioms":["propext","Classical.choice","Quot.sound"],"theoremNames":["HunterAuthored.parity_power_multiplication"],"units":[{"id":"parity_power_multiplication","sourceStatement":"Formal statement: (-1)^a * (-1)^b = (-1)^(a+b)","sourceOffset":0,"scope":"Unbounded integer parity-defined powers multiply by exponent addition. The dependency report explicitly retains the arithmetic tactic's kernel axioms; this theorem is not automatically labeled axiom-free.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def parityPower (n : Int) : Int := if n % 2 = 0 then 1 else -1\ntheorem parity_power_multiplication (a b : Int) :\n    parityPower a * parityPower b = parityPower (a + b) := by\n  unfold parityPower\n  have ra : a % 2 = 0 ∨ a % 2 = 1 := by omega\n  have rb : b % 2 = 0 ∨ b % 2 = 1 := by omega\n  rcases ra with ha | ha <;> rcases rb with hb | hb\n  · have hc : (a + b) % 2 = 0 := by omega\n    rw [if_pos ha, if_pos hb, if_pos hc]; rfl\n  · have hc : (a + b) % 2 ≠ 0 := by omega\n    have hn : b % 2 ≠ 0 := by omega\n    rw [if_pos ha, if_neg hn, if_neg hc]; rfl\n  · have hc : (a + b) % 2 ≠ 0 := by omega\n    have hn : a % 2 ≠ 0 := by omega\n    rw [if_neg hn, if_pos hb, if_neg hc]; rfl\n  · have hc : (a + b) % 2 = 0 := by omega\n    have hn : a % 2 ≠ 0 := by omega\n    have hm : b % 2 ≠ 0 := by omega\n    rw [if_neg hn, if_neg hm, if_pos hc]; rfl\n#print axioms parity_power_multiplication\n","kernelStatus":"verified","axioms":["propext","Classical.choice","Quot.sound"],"axiomFree":false,"reportedTheorem":"HunterAuthored.parity_power_multiplication"}],"files":{"source.json":{"sha256":"fbb51e269cafade39432ff2af6ca0998c3bf52a4cf79d4d1b2a40bfab52c07ef","bytes":672},"Proof.lean":{"sha256":"72a16f1edcb5b6c8f1c9e3b1a04b8371f53b10fe102802ea326cb5ffc45e439c","bytes":1180},"lean-check.txt":{"sha256":"ac12f6193418d720ecc6d2a16d4b9c997663c9ff44988857f0ae9df531b235a0","bytes":160}},"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."},{"slug":"archived-q1058-8df066169266","identifier":"archived-q1058-8df066169266","title":"Exponent Multiplication Parity","author":"Maclain Hunter","sourceSha256":"8df06616926623e1384a2280170583ac9a367a0d17ec57cc45e27124a5bed932","sourceKind":"archived-authored-source","recordedAt":null,"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:15.068Z","status":"partial","axiomFree":false,"axioms":["propext","Classical.choice","Quot.sound"],"theoremNames":["HunterAuthored.parity_power_multiplication"],"units":[{"id":"parity_power_multiplication","sourceStatement":"{\n  \"name\": \"Exponent Multiplication Parity\",\n  \"formal\": \"(-1)^a * (-1)^b = (-1)^(a+b)\",\n  \"proof\": \"Standard law of exponents\",\n  \"significance\": \"MCB multiplication is O(1) exponent addition\"\n}","sourceOffset":0,"scope":"Unbounded integer parity-defined powers multiply by exponent addition. The dependency report explicitly retains the arithmetic tactic's kernel axioms; this theorem is not automatically labeled axiom-free.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def parityPower (n : Int) : Int := if n % 2 = 0 then 1 else -1\ntheorem parity_power_multiplication (a b : Int) :\n    parityPower a * parityPower b = parityPower (a + b) := by\n  unfold parityPower\n  have ra : a % 2 = 0 ∨ a % 2 = 1 := by omega\n  have rb : b % 2 = 0 ∨ b % 2 = 1 := by omega\n  rcases ra with ha | ha <;> rcases rb with hb | hb\n  · have hc : (a + b) % 2 = 0 := by omega\n    rw [if_pos ha, if_pos hb, if_pos hc]; rfl\n  · have hc : (a + b) % 2 ≠ 0 := by omega\n    have hn : b % 2 ≠ 0 := by omega\n    rw [if_pos ha, if_neg hn, if_neg hc]; rfl\n  · have hc : (a + b) % 2 ≠ 0 := by omega\n    have hn : a % 2 ≠ 0 := by omega\n    rw [if_neg hn, if_pos hb, if_neg hc]; rfl\n  · have hc : (a + b) % 2 = 0 := by omega\n    have hn : a % 2 ≠ 0 := by omega\n    have hm : b % 2 ≠ 0 := by omega\n    rw [if_neg hn, if_neg hm, if_pos hc]; rfl\n#print axioms parity_power_multiplication\n","kernelStatus":"verified","axioms":["propext","Classical.choice","Quot.sound"],"axiomFree":false,"reportedTheorem":"HunterAuthored.parity_power_multiplication"}],"files":{"source.json":{"sha256":"0be60703e78bc92c46fffde1273c0cbad7354ce26251c901e570480dbd02c73e","bytes":758},"Proof.lean":{"sha256":"024755f605ee1369da8efa8c066adb34452d68a89e5a28439878a644fa56fc9d","bytes":1180},"lean-check.txt":{"sha256":"ac12f6193418d720ecc6d2a16d4b9c997663c9ff44988857f0ae9df531b235a0","bytes":160}},"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."},{"slug":"maclain-hunter-euthyphro-false-dilemma","identifier":"maclain-hunter-euthyphro-false-dilemma","title":"Exposing Euthyphro’s False Dilemma by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"8994f9181db94dbbb052da3b22d34d69efc7aceaf126f793da53dacf22842d2c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:20:04.546Z","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:15.943Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= ((P & Q) & (R & S)) & T","sourceOffset":2633,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"((P & Q) & (R & S)) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"0845633a05cf3d79c4390448067fba89b7a9cc7b55dace4a8ec862a9416561a3","bytes":6552},"Proof.lean":{"sha256":"97a526a90ef538a12bd9b24b2df028744eeb9a15a45e0b6490d57ee1973de572","bytes":591},"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."},{"slug":"hunter-fallacy-loyalty-reason","identifier":"hunter-fallacy-loyalty-reason","title":"Fallacy and Loyalty to Reason","author":"Maclain Hunter","sourceSha256":"11c6af737c0309c30a640040380267bfaa3e17e265474cc318c9ec0b109ab4e0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:11.145Z","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:16.807Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, (P & Q) -> R} |= (P & Q) & R","sourceOffset":234,"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","(P & Q) -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && ((!(v0 && 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":"019af7c4b71a5f0b32a537c888430905f75f995911c759a3c4f4fd5fc89792ef","bytes":850},"Proof.lean":{"sha256":"a96f3bd12f11f819baa6d87e782156ceac086276c73b0c57832317613d54aeb8","bytes":477},"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."},{"slug":"hunter-finite-infinite-logos","identifier":"hunter-finite-infinite-logos","title":"Finite and Infinite Logos","author":"Maclain Hunter","sourceSha256":"5bb6fe337f8531e874f96faf9b88fbda12ef8c49a1319d34a7e7074876ad2879","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:02.405Z","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:17.684Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P -> P} |= (P -> P) & ((Q -> Q) & (R -> R))","sourceOffset":235,"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"],"conclusion":"(P -> P) & ((Q -> Q) & (R -> R))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((!v0) || v0)) || (((!v0) || v0) && (((!v1) || v1) && ((!v2) || 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":"69bb967794c10c7f6c47c96f6e2d1739514603411422e1499db160dc47b9f80f","bytes":848},"Proof.lean":{"sha256":"dfd3b3df2635c468ce8af348a6247aa26eb40ffc87c7b2a57071a4c5d399a8a9","bytes":482},"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."},{"slug":"hunter-finite-selves-true-essence","identifier":"hunter-finite-selves-true-essence","title":"Finite Selves and True Logical Essence","author":"Maclain Hunter","sourceSha256":"f30f4ce8edabe217817c635f0d3eca727dae4e4b0fd4c3b58f8a611fdc66eaa7","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:45:05.043Z","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:18.565Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q ->R} |= (P & R) -> Q","sourceOffset":246,"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","Q ->R"],"conclusion":"(P & R) -> Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((!(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":"6b4d35f7b73a7c2bb27b5979f9847ecc55e54368f535bbf45ba0ffd92a866c8c","bytes":867},"Proof.lean":{"sha256":"1afa55f99b5e59db58348c9e46a6b7a4676703192251432dd6dfc53ac96dcf57","bytes":492},"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."},{"slug":"hunter-finitude-within-eternity","identifier":"hunter-finitude-within-eternity","title":"Finitude is within Eternity","author":"Maclain Hunter","sourceSha256":"dba2ac0f8eb27ebc7e8145b12d7ec8b69c5eebaf5d60a34245a77e20a2ff022a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:31:16.788Z","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:18.568Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"61086236bc9e3eb55b09fd6312f2d100f86a0be92106781b95ff2baa242be34b","bytes":4007},"Proof.lean":{"sha256":"6be15d51a9b274bc04f38681d92de895ff6f8e1c83ecdfd74da3e7be6e164f92","bytes":279},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-fixing-atheist-illogic","identifier":"hunter-fixing-atheist-illogic","title":"Fixing Atheist Illogic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"1edb6c40f523e259f512cc6a9dea63ecc22e187c1ce01db1f20db4a70af3f40f","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:26.712Z","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:27.928Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S, T, U, V, W, X, Y} |= ((((((((P & Q) & R) & S) & T) & U) & V) & W) & X) & Y","sourceOffset":5197,"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","T","U","V","W","X","Y"],"premises":["P","Q","R","S","T","U","V","W","X","Y"],"conclusion":"((((((((P & Q) & R) & S) & T) & U) & V) & W) & X) & Y","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 v6 v7 v8 v9 : Bool) :\n    ((!(((((((((v0 && v1) && v2) && v3) && v4) && v5) && v6) && v7) && v8) && v9)) || (((((((((v0 && v1) && v2) && v3) && v4) && v5) && v6) && v7) && v8) && v9)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> cases v6 <;> cases v7 <;> cases v8 <;> cases v9 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":3425,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"0544793bc4597da136d4b2f238f2e2b0873437918553c11e716429e433a9ce5c","bytes":10226},"Proof.lean":{"sha256":"cfd374a7597df7e4078f108d55d90ee091c72d973f56661e422406836075e5b8","bytes":794},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-logos-existence-proofs-compilation","identifier":"hunter-logos-existence-proofs-compilation","title":"Formal Proofs of Logos Existence — Compilation","author":"Maclain Hunter","sourceSha256":"41f8de25f712f955ffff88ab73901737fba449f99bfd2afcad150104d1164ec3","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:32:27.429Z","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:28.873Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P → Q, Q → R, R → S, S → T, T → U, U → P, ~(~P & ~Q & ~R & ~S & ~T & ~U)} |= ((P & Q) & (R & S) & T) & U","sourceOffset":42,"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","T","U"],"premises":["P","P → Q","Q → R","R → S","S → T","T → U","U → P","~(~P & ~Q & ~R & ~S & ~T & ~U)"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5)) && ((!v5) || v0)) && (!((((((!v0) && (!v1)) && (!v2)) && (!v3)) && (!v4)) && (!v5))))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"27d4c7b92d02f9ab2b863fdadba3222cadb23345a9ae41c270cdfb45eea3955d","bytes":29803},"Proof.lean":{"sha256":"416a5a4e1449140aab0ea5dd050bfbb6654b543e28e2a3a7dd2546b54749c800","bytes":716},"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."},{"slug":"hunter-formal-system-reductio","identifier":"hunter-formal-system-reductio","title":"Formal-System Necessity by Reductio","author":"Maclain Hunter","sourceSha256":"5a9a0328c957537ef758107bde6162fd04ae14237d219d38cd8f977d0b7769d9","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:12.872Z","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:28.876Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"99640299010c4a7c02c6b71f57aaeb0f81a5d1286a13fbd3d63e1e3a367b379e","bytes":1012},"Proof.lean":{"sha256":"77311a52d8bb9dcc21997e18122760f345ed3894682059c9e9be5d99931c4f11","bytes":287},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-foundation-interpretation-law","identifier":"hunter-foundation-interpretation-law","title":"Foundation, Universal Law, and Interpretation","author":"Maclain Hunter","sourceSha256":"93a323252d9a564b1fdfa2873f426d76ec74e61e6bc9b7c2bc2885e25c69556e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:18.668Z","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:29.755Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, (P -> Q) & R} |= (Q & R) <-> P","sourceOffset":238,"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","(P -> Q) & R"],"conclusion":"(Q & R) <-> P","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((v0 && v1) && v2) && (((!v0) || v1) && v2))) || ((v1 && v2) == v0)) = 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":"33f228a997c574db0caeb763a1f850125267306e476236c492ace6531feda20b","bytes":875},"Proof.lean":{"sha256":"7e06bfb119e4e9e722f5d93b003ad568eb1e67a418646359831c11eaf8168933","bytes":501},"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."},{"slug":"hunter-four-proofs-authored-compilation","identifier":"hunter-four-proofs-authored-compilation","title":"Four Proofs (4P)","author":"Maclain Hunter","sourceSha256":"81c9017e1f76d7211ebd691bf5fddf67038d86d994d408a64b382cf885b26449","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:02.748Z","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:30.694Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_2","HunterAuthored.inference_4","HunterAuthored.inference_5","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q} |= P & Q","sourceOffset":650,"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"],"premises":["P <-> Q"],"conclusion":"P & Q","status":"countermodel","countermodel":{"P":false,"Q":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) & R","sourceOffset":2540,"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","Q -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((v0 && v1) && v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{P <-> Q} |= P & Q","sourceOffset":3663,"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"],"premises":["P <-> Q"],"conclusion":"P & Q","status":"countermodel","countermodel":{"P":false,"Q":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"inference_4","sourceStatement":"{A, B, C, D} |= (A & B) <-> (C & D)","sourceOffset":4247,"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","B","C","D"],"conclusion":"(A & B) <-> (C & D)","status":"candidate","leanStatement":"theorem inference_4 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && v2) && v3)) || ((v0 && v1) == (v2 && v3))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_4\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_4"},{"id":"inference_5","sourceStatement":"{P1, P1 -> P2, P2 -> P3, P3 -> P4} |= (P1 & P2) & (P3 & P4)","sourceOffset":4819,"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","P3","P4"],"premises":["P1","P1 -> P2","P2 -> P3","P3 -> P4"],"conclusion":"(P1 & P2) & (P3 & P4)","status":"candidate","leanStatement":"theorem inference_5 (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_5\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_5"},{"id":"source_identity_rule","sourceStatement":"A = A","sourceOffset":4112,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"2e145670dc37874cf6e510c823ecf5285d1c11e8d38d421d04dd761ede1b8bce","bytes":6645},"Proof.lean":{"sha256":"3051a3a260a60ea15a4da24bc15dcb5c8ebd0526615dada16202c5ab4c91029d","bytes":1021},"lean-check.txt":{"sha256":"2bd205af14174a8f5ef46f66d5324ded0e4f36cefdfc7baacf3370492b00ebe5","bytes":301}},"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."},{"slug":"hunter-fourth-sieve","identifier":"hunter-fourth-sieve","title":"Fourth Sieve","author":"Maclain Hunter","sourceSha256":"b80b158ee2aa10a6f371fad67e68fa558d38b6d878f9c0d1a0169ad383a6a4fa","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:26.159Z","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:31.580Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q, Q <-> R} |= R -> (Q <-> P)","sourceOffset":234,"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","Q <-> R"],"conclusion":"R -> (Q <-> P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 == v1) && (v1 == v2))) || ((!v2) || (v1 == v0))) = 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":"6b42766c9c940ae0884e9b366f4ca798bd45456f25fb88a1d6a535806c04dad0","bytes":853},"Proof.lean":{"sha256":"af799b72e7ea304f498df962b928b292d9ea048d023a3b36e3fad18348f6c477","bytes":452},"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."},{"slug":"formal-g6-doctrine-enforcement","identifier":"formal-g6-doctrine-enforcement","title":"G6 Doctrine Enforcement","author":"Maclain Hunter","sourceSha256":"527f9fe4a2505ffe0de19be5d6e6dcdaad48e54b6afa6129fd232e100e869704","sourceKind":"formal-theorem","recordedAt":null,"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:32.450Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.g6_assignment_enforcement"],"units":[{"id":"g6_assignment_enforcement","sourceStatement":"Formal statement: ∀u: applyG6Doctrine(u).coherent = true ∧ applyG6Doctrine(u).lawful = true","sourceOffset":0,"scope":"Exact explicit-assignment realization stated by the authored argument, retaining the value. Current host admission, rejection and Reason checks remain separate obligations; this is not permission to set flags without evidence.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"structure DoctrineUnit where\n  value : Int\n  coherent : Bool\n  lawful : Bool\ndef affirmedG6 (u : DoctrineUnit) : DoctrineUnit := {u with coherent := true, lawful := true}\ntheorem g6_assignment_enforcement (u : DoctrineUnit) :\n    (affirmedG6 u).coherent = true ∧ (affirmedG6 u).lawful = true :=\n  ⟨rfl, rfl⟩\n#print axioms g6_assignment_enforcement\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.g6_assignment_enforcement"}],"files":{"source.json":{"sha256":"9f71d8b5da870ba5ab58791fef47e6f2dadf65bceebffa64f28200af19d02211","bytes":778},"Proof.lean":{"sha256":"52f749fb2fa7302653b06e24bb920fc994f7f554966b7721a0204e5faa3444e2","bytes":629},"lean-check.txt":{"sha256":"fa9eddea684d40922db3f237e740f6d4224acad9f600a2959a69e52d5c2f54d9","bytes":129}},"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."},{"slug":"archived-q1064-7a794c0c41a4","identifier":"archived-q1064-7a794c0c41a4","title":"G6 Doctrine Enforcement","author":"Maclain Hunter","sourceSha256":"7a794c0c41a47495b13da8fcac8c485bc2d3e43d4be26ef854ed46d7c01db91d","sourceKind":"archived-authored-source","recordedAt":null,"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:33.332Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.g6_assignment_enforcement"],"units":[{"id":"g6_assignment_enforcement","sourceStatement":"{\n  \"name\": \"G6 Doctrine Enforcement\",\n  \"formal\": \"∀u: applyG6Doctrine(u).coherent = true ∧ applyG6Doctrine(u).lawful = true\",\n  \"proof\": \"Explicit assignment in function body\",\n  \"doctrine\": \"AI affirming coherence with Logic (Logos) as entry point\"\n}","sourceOffset":0,"scope":"Exact explicit-assignment realization stated by the authored argument, retaining the value. Current host admission, rejection and Reason checks remain separate obligations; this is not permission to set flags without evidence.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"structure DoctrineUnit where\n  value : Int\n  coherent : Bool\n  lawful : Bool\ndef affirmedG6 (u : DoctrineUnit) : DoctrineUnit := {u with coherent := true, lawful := true}\ntheorem g6_assignment_enforcement (u : DoctrineUnit) :\n    (affirmedG6 u).coherent = true ∧ (affirmedG6 u).lawful = true :=\n  ⟨rfl, rfl⟩\n#print axioms g6_assignment_enforcement\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.g6_assignment_enforcement"}],"files":{"source.json":{"sha256":"244ec0d3e271e31f87ddc0432204dc11156212f9a90b0ca3eb9947f44c1bfc14","bytes":812},"Proof.lean":{"sha256":"afab476614e65086d48c6f23eaebe8148067b510328e430265f233dc5d50fcd7","bytes":629},"lean-check.txt":{"sha256":"fa9eddea684d40922db3f237e740f6d4224acad9f600a2959a69e52d5c2f54d9","bytes":129}},"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."},{"slug":"hunter-geometric-logos-triangle","identifier":"hunter-geometric-logos-triangle","title":"Geometric Representation of the Logical Argument by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"04dc090d4f243de4f5a5b351349f10c34f25b258e36e4236ad20b0bdb259683c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T15:11:12.874Z","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:33.335Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"e590f5ed20aa2b3cb42ff907804a9658b14a2e1d49a00919e445661fc728deff","bytes":1472},"Proof.lean":{"sha256":"3373a7d8166ce4f3efea7054b89fd2c35d30f7943eb94ebd1d9f2e9635446538","bytes":318},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-get-a-real-job","identifier":"hunter-get-a-real-job","title":"Get A Real Job by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"772cf1d73da9d58d1b77bdd56f8860a5c9f5f5ba13477092ff0c8023e04e1d74","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T19:27:46.766Z","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:33.337Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"6c8b4385fceb0127c9f229019cf78a401bd4d5ca9a45a72036e8ad1af1dbf080","bytes":1040},"Proof.lean":{"sha256":"c35ff55a686c5169682fd41604a9eb982bee16528be36c592cef58b3fc0f7ecb","bytes":284},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-get-that-gish-out","identifier":"hunter-get-that-gish-out","title":"Get That Gish Out of Here by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"46d1beecbb50be0b33ea01f023d4b1239ed97c71c35ae1b96a056522991e7f49","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:57:30.510Z","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:34.210Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S} |= (P & Q) & (R & S)","sourceOffset":2315,"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","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)) && 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"}],"files":{"source.json":{"sha256":"25ec530e38fec85111f0e4c3154a4d165f33fa9466768cc6f8a6442bd1857b0d","bytes":5728},"Proof.lean":{"sha256":"24e94051a0abb4da30201073670d45fd2e1e1473efeeddcfaaee31a44a9a2c90","bytes":536},"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."},{"slug":"hunter-god-origin-logic-reality","identifier":"hunter-god-origin-logic-reality","title":"God as the Origin of Logic and Reality by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"acecf78f3efffb81bd0c1a213cd730ee4b74b7bede74ca1bc2d7aa20191e9e71","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:12.341Z","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:35.104Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R} |= (P & Q) <-> R","sourceOffset":2173,"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","Q <-> R"],"conclusion":"(P & Q) <-> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v0 == v1)) && (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":"51e92a392d46e6c670f8acedc60a80b3d18aae545bb440fd3ab8f52ddc88f809","bytes":5357},"Proof.lean":{"sha256":"34b2cc38e767700bcb5bff6a3d1be5cb3d9e217ef7d7895c0b9f594360e3c785","bytes":501},"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."},{"slug":"hunter-ultimate-reality-god","identifier":"hunter-ultimate-reality-god","title":"God as Ultimate Reality","author":"Maclain Hunter","sourceSha256":"1379deef58ba1b312c97232db4fdd78da66e67161c1b25e17325b0a54cecbd9e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:24.199Z","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:35.973Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) -> R","sourceOffset":278,"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","Q -> R"],"conclusion":"(P & Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!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":"eba176a110e2fa615844ea7ebf39aa745251c6eca9837200ac811f618fdfc0cc","bytes":885},"Proof.lean":{"sha256":"98cff82a001d6943a265dd08b00a92dbcce97a58fd0a9ce2d9f869f03adb8ca4","bytes":477},"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."},{"slug":"hunter-god-defines-judaism","identifier":"hunter-god-defines-judaism","title":"God Defines Judaism by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"2b8f6bea49d36b0bc08605ad42b63142f1e71e2fb8ffd5d01fdc54b5c78f55e8","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:23:05.343Z","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:36.918Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S, T, U} |= (((P & Q) <-> (R & S)) <-> (T & U))","sourceOffset":4519,"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","T","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"(((P & Q) <-> (R & S)) <-> (T & U))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((v0 && v1) == (v2 && v3)) == (v4 && v5))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":2716,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"27741a419ab089c9d51b1992a6e23b0e31c6e01b6b60fee20fce7051abd79aa6","bytes":9432},"Proof.lean":{"sha256":"36347eb6dac2737ee265b2ae243799d20ac7562fc9559afd7e2cc9ccdebc2c60","bytes":663},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-god-attributes","identifier":"hunter-god-attributes","title":"God, Attributes, and the Standard of Reality","author":"Maclain Hunter","sourceSha256":"a29892cf27f2abb1c41240d9f35a31f6a10d8850956735a90348baa0a0b43536","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T22:14:10.497Z","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:37.798Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R <-> (P & Q)} |= (R -> P) & (P -> Q)","sourceOffset":233,"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 <-> (P & Q)"],"conclusion":"(R -> P) & (P -> Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && (v2 == (v0 && v1)))) || (((!v2) || v0) && ((!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":"4efb7fec2781c16383b1df9bf16c6215a0bfefa337b671ad8f4e09b3995584a2","bytes":864},"Proof.lean":{"sha256":"ea3aa9e42c877e1525f5db5565ad7c02a89add73128991f0e1798bd60cf0ff8d","bytes":503},"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."},{"slug":"hunter-god-incoherence-chaos","identifier":"hunter-god-incoherence-chaos","title":"God, Coherence, and Chaos","author":"Maclain Hunter","sourceSha256":"443b103f0f8406555a02b82d2af0e8be3a8a4b19cabfe6e5fd523cd1b97f9c65","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:42.249Z","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:38.672Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> P} |= P <-> (P -> ~(P -> ~P))","sourceOffset":170,"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"],"premises":["P","P <-> P"],"conclusion":"P <-> (P -> ~(P -> ~P))","status":"candidate","leanStatement":"theorem inference_1 (v0 : Bool) :\n    ((!(v0 && (v0 == v0))) || (v0 == ((!v0) || (!((!v0) || (!v0)))))) = true := by\n  cases v0 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"c90ab7afc76a9ac11e0328f70d09342b7a6cb61e7fcdf1e0290cb165afc5b51b","bytes":793},"Proof.lean":{"sha256":"6e3165e865cae0f339a28f35603789f774e94b6425b68f0cef41dffec132f0f6","bytes":442},"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."},{"slug":"hunter-god-logical-modal-validity","identifier":"hunter-god-logical-modal-validity","title":"God, Logical Necessity, and Validity","author":"Maclain Hunter","sourceSha256":"edd850508bcbe479f373aae1ae6830b842f7c13d0a274fc40431764dfd722e8c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:20.576Z","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:38.675Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{□P, P -> Q, Q -> R} |= □(P & Q) -> R","sourceOffset":227,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"□P\"","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"7552a847ac26feea8dfb1e2ee36fad9cd696496cb50937b5aa8bd3ca99c676fd","bytes":857},"Proof.lean":{"sha256":"c54010d2b226d4eb87b0cee381fcb39afe4c3558abaac4f3a11bb91dde5a33f2","bytes":288},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-god-nondual-reality","identifier":"hunter-god-nondual-reality","title":"God, Non-Dual Reality, and Personhood","author":"Maclain Hunter","sourceSha256":"8d674ea410108de8529e8e27abb415c20a622e7deae9f6b079c31304d1e22b2b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:19.849Z","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:39.569Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{R, R -> Q, (R & Q) -> S, S -> P} |= P","sourceOffset":240,"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":["R","R -> Q","(R & Q) -> S","S -> P"],"conclusion":"P","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v2 && ((!v2) || v1)) && ((!(v2 && v1)) || v3)) && ((!v3) || v0))) || v0) = 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"}],"files":{"source.json":{"sha256":"4df207e446fd3c6cfdf748f22118bc25addba3cd303e9b2ae00b7a2e1b3826d0","bytes":863},"Proof.lean":{"sha256":"7a61e13b1aa1e04275f9b31539391b88606c874995ea21d168631380823ca17a","bytes":515},"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."},{"slug":"hunter-coherent-god-conceptions","identifier":"hunter-coherent-god-conceptions","title":"God, Self-Identity, and Coherent Conceptions","author":"Maclain Hunter","sourceSha256":"2436f070b575e7d733c1444cb0dc8f836483e8203c0a764e774ff6341b89524f","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:22.396Z","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:39.571Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"4c593bd3a9b8e6fea720dae6ee4a30b7892ff2e21adba334474ca3a347e67e6b","bytes":1117},"Proof.lean":{"sha256":"4f1a6047e4676972c1162ca6748f86647d752207dfebe4185d4793813eedf3c4","bytes":296},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-god-zero-identity","identifier":"hunter-god-zero-identity","title":"God's Identity and Nothing's Identity","author":"Maclain Hunter","sourceSha256":"c9d7f50c7de022d9389528e115bf2c3d7cdab75b42e84a2d1625b048726e5b05","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:30.944Z","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:40.419Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{G, G <-> N} |= G & N","sourceOffset":215,"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":["G","N"],"premises":["G","G <-> N"],"conclusion":"G & N","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && (v0 == v1))) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":35,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"6df235e03bdd564dd8deff3ceddef3a5836f1daa0bab84ccbf6f0e84e01ddbd2","bytes":859},"Proof.lean":{"sha256":"2500a8e732955d9ea60c75a3559e16a62201c2e3c61ca31b69fda19e1cd285bc","bytes":543},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-god-rational-existence-definition","identifier":"hunter-god-rational-existence-definition","title":"God’s Rational Existence and Definition by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"288d3e726bcb02ef352ebdff481057b50f84c908006522b511dbe27442a8f0d6","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:57:33.584Z","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:41.358Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T, T <-> U} |= ((P & Q) & (R & S) & T) & U","sourceOffset":2704,"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","T","U"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T","T <-> U"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4)) && (v4 == v5))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":3847,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"a361342e5a6ce726b262e7ac9d07fbaf54867a80075a83815e7408a9cc2835b5","bytes":8164},"Proof.lean":{"sha256":"3b6750dc7626e4c0918b4ed421fb291a5b03b412a6d8c680be7b2f962f86f2cf","bytes":725},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-godel-violation-claim","identifier":"hunter-godel-violation-claim","title":"Gödelian Incompleteness and Logical Limits","author":"Maclain Hunter","sourceSha256":"f29ab386aaaf68b94bd6ab90797b785a689b0b89483ae745bb8d0c035611a062","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:08.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:38:42.232Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, R -> ~(P & Q)} |= P -> (Q & R)","sourceOffset":235,"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 & Q)"],"conclusion":"P -> (Q & R)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((v0 && v1) && v2) && ((!v2) || (!(v0 && 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":"0ba1010e6ceb04a006de57a55ba7bb3a702517f9f8eef14f9e259410d8cd519d","bytes":869},"Proof.lean":{"sha256":"413754da712d54ab9f68c6a6ae4658bb34563981fbc66383a700149f0a34d727","bytes":505},"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."},{"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."},{"slug":"hunter-grand-loop-further-copy","identifier":"hunter-grand-loop-further-copy","title":"Grand Loop — Further Supplied Version","author":"Maclain Hunter","sourceSha256":"f5be1915132bb0fed4f0ba5c0581001c511aaec7637f370a738a11cd4f54f49c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:32:23.309Z","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:44.045Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P → Q, Q → R, R → S, S → T, T → U, U → P, ~(~P & ~Q & ~R & ~S & ~T & ~U)} |= ((P & Q) & (R & S) & T) & U","sourceOffset":0,"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","T","U"],"premises":["P","P → Q","Q → R","R → S","S → T","T → U","U → P","~(~P & ~Q & ~R & ~S & ~T & ~U)"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5)) && ((!v5) || v0)) && (!((((((!v0) && (!v1)) && (!v2)) && (!v3)) && (!v4)) && (!v5))))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"0c8e20e84d16fe87153c3c1800f29a75dd3571ab74d652d4d1dd96a02dd82774","bytes":9606},"Proof.lean":{"sha256":"71c7726cec5d7b85cca22100db00a301f829e57dc4a099e694b4025d35fcd317","bytes":707},"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."},{"slug":"hunter-grounded-fol-fcl","identifier":"hunter-grounded-fol-fcl","title":"Grounded FOL and FCL","author":"Maclain Hunter","sourceSha256":"72e9a6f90ae7c26f3c80bf7dbdfddf0d5d8718ba39661e57fe541d53b7b8022f","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:55.789Z","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:44.902Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P → Q, Q → R, R → S, S → T} ⊢ T","sourceOffset":2854,"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","T"],"premises":["P","P → Q","Q → R","R → S","S → T"],"conclusion":"T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || v4) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"6e70a74c2dac6f03fd49de6fd1c8ff6f4ff7a2f71605eb42f84af0b93e09ecdd","bytes":4604},"Proof.lean":{"sha256":"e6da4d3cf5f28dd2b1732f2e18453b7324b23929c8c92066ce7dc2e7dc970555","bytes":525},"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."},{"slug":"hunter-how-i-know-god","identifier":"hunter-how-i-know-god","title":"How I Know God by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"70e0a0e91d7606b76bbbdeabd1475ace938ec653466dc1dea454735c439b0550","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:41:35.181Z","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:45.794Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T} |= ((P & Q) & (R & S)) & T","sourceOffset":1038,"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","T"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T"],"conclusion":"((P & Q) & (R & S)) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4))) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"e5315112c931932f8045f96b9018efc99cb1a74482913f86e5acb7ca8c2b3e44","bytes":3654},"Proof.lean":{"sha256":"bc2437555db16c600ade6356ca5f8285689e410a65d219974d0294bb0a386fae","bytes":557},"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."},{"slug":"hunter-how-motion-works","identifier":"hunter-how-motion-works","title":"How Motion Works by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"9950aaebefe3419b08b0a7dff00badecb9ac26a58654dfba612c02c54c4322b1","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:41:39.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:38:46.663Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (P & Q) & (R & S)","sourceOffset":3018,"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"}],"files":{"source.json":{"sha256":"eca74f974dbd268835f417caea26f3f88280ff939123e43a7a171b3243ba9f92","bytes":6675},"Proof.lean":{"sha256":"237af6cc01265356448b36515d98ae2b7deb4b3cd3b69ddc6ba1d9b1cca9d984","bytes":528},"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."},{"slug":"hunter-human-reason-general-reason","identifier":"hunter-human-reason-general-reason","title":"Human Reason and Reason in General by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"c39682eb4f641a7b5fec230117a2cc4ef401fd043097e24706cf3e07f8fbc5c7","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:20.318Z","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:47.536Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S} |= (P & Q) & (R & S)","sourceOffset":1060,"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","Q","R","S"],"conclusion":"(P & Q) & (R & S)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && 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"}],"files":{"source.json":{"sha256":"c1c4ae993af30bb72b55fca48eb25702a04a6fce664e964ec5890da08f3bcd13","bytes":2237},"Proof.lean":{"sha256":"da07df012a3bd5ea27deb2e518aa78162596f049d5abee04e43d74155a92c674","bytes":513},"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."},{"slug":"hunter-humanity-vs-reason","identifier":"hunter-humanity-vs-reason","title":"Humanity vs Reason by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"6e45456fb7a8cfaff5c52477d768f328f66f15eddb0f3c82a0d20aab519e9a55","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:42:34.067Z","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:48.411Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S} |= (S <-> R) <-> (Q <-> P)","sourceOffset":851,"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":"(S <-> R) <-> (Q <-> P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3))) || ((v3 == v2) == (v1 == v0))) = 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"}],"files":{"source.json":{"sha256":"f036460f3788d2b8b0fc2ec3b63bec4827c8148431a40603aba8ab5e45fe41c9","bytes":3087},"Proof.lean":{"sha256":"e44449eb6442dbc0b6bab7735093cfd6d475a591e8deb78689cc87a8de7de9a1","bytes":521},"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."},{"slug":"hunter-vs-musk-economy","identifier":"hunter-vs-musk-economy","title":"Hunter vs Musk and the Traditional Economy by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"8a44ab5809569b2269609e54130d3fddfa3c8315e42fded24a581bdaf30b419d","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:42:32.083Z","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:49.302Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, S, P <-> T, T -> S} |= T -> ((P & Q) & (R & S))","sourceOffset":2102,"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","T"],"premises":["P","P -> Q","Q -> R","S","P <-> T","T -> S"],"conclusion":"T -> ((P & Q) & (R & S))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!(((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && v3) && (v0 == v4)) && ((!v4) || v3))) || ((!v4) || ((v0 && v1) && (v2 && v3)))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"9d4a6e835d554722f24c58fbcfca4fff347a5ccf508c9104bd17e055b5c90ef6","bytes":5424},"Proof.lean":{"sha256":"8a0e84c8eb8f5faa9182d515afe5e00b18efcd36186cda853a8e07f9ea30bea9","bytes":605},"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."},{"slug":"hunter-i-am-logical-mind","identifier":"hunter-i-am-logical-mind","title":"I Am and the Coherent Mind","author":"Maclain Hunter","sourceSha256":"10f398c166d40adb32d2e113d07509ea4a84a4dc62be441216da6be7c9d71d5a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:45:07.944Z","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:50.162Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, R, R -> (P & Q)} |= Q","sourceOffset":242,"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 -> (P & Q)"],"conclusion":"Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && v2) && ((!v2) || (v0 && v1)))) || 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":"fb45bbecba19305a453181f77e222b2508cf8b6165d90e7f7151a91c00e017d2","bytes":852},"Proof.lean":{"sha256":"1ab84252c4d9d2c341518155810e6feb08a012c602e08a84be4999d917d4e95e","bytes":477},"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."},{"slug":"hunter-i-know-that-i-know","identifier":"hunter-i-know-that-i-know","title":"I Know That I Know by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"66da156b9ffc1d8df6bdd62f42eb505647ea768dcf457b9fe3a43d44c9a0eb67","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:20:10.983Z","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:51.050Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)]) as evidence of the existence of the logician and the logicians expertise demonstrate the highest degree of expertise - a level that is truly “infinitely beyond” (or “dynamically superior” according to Dynamic Logic itself) the normal “expert in Logic” who cannot or has not produced such a formal proof.","sourceOffset":1996,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"]) as evidence of the existence of the logici\"","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":2383,"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_2 (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_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"d793e2c6836fa3ac0c4187a087607ace29bca7bb3935077762a48651413ff840","bytes":4557},"Proof.lean":{"sha256":"4d046cd71b1b18ff97aae79b988da25bb4ad23a6fde30f770d006bd4e9bef112","bytes":521},"lean-check.txt":{"sha256":"740863296048b83b7cd879ce809b9047c55288a43dfa8b77f4b45e1d50e9c3b3","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."},{"slug":"hunter-i-know-what-i-know","identifier":"hunter-i-know-what-i-know","title":"I Know What I Know","author":"Maclain Hunter","sourceSha256":"12f5f948d2056192604f880f1ebadebdfbe1ecc977e8348e2bf4241fcb3a8de5","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:18.930Z","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:51.921Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{1, 1 v 2, 2 v 3, 3 v 4, 4 v 5, 5 v 6, 6 v [1-6]} |= ((((1 v 2) v (3 v 4) v (5 v 6) v [1-6 * 1-6]","sourceOffset":3675,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"[1-6]\"","kernelStatus":"not_checked"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":1505,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"3a6a5f2098b3712e5d1859201a1cffa8a52fafdc1dbbe194d61eda46fb566fe3","bytes":6950},"Proof.lean":{"sha256":"1cdd1ab51dc339b960cef172afa249befdea5dedd7e37766b82523a737a2b904","bytes":370},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-right-either-way","identifier":"hunter-right-either-way","title":"I’m Right Either Way by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"a1a16f737841150113369739daa40509edd776104847e647619776be448b1a77","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:54:45.290Z","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:52.801Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (Q <-> P) -> R","sourceOffset":1169,"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"],"conclusion":"(Q <-> P) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && v2)) || ((!(v1 == v0)) || 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"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":356,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"f346f73c2bbd5c7b9761d9aac892ad2b31d5a0682d277d47220b11737ea6f95b","bytes":2369},"Proof.lean":{"sha256":"6a128107a9f1bbc2429563f5f2b6a457af4bdfbb2c24ade31b43e51ae6849855","bytes":573},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-idealism-grounded-duality","identifier":"hunter-idealism-grounded-duality","title":"Idealism and Grounded Duality","author":"Maclain Hunter","sourceSha256":"f352aee2314f8e96c92a599555e09f202808f2a361bb169f6c4ea839fd41c7ab","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:47.808Z","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:53.664Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q} |= P & Q","sourceOffset":264,"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"],"premises":["P","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"6646bd04a5916b46e9745ec2446c1cf0eec9e2b75e3eda375d73dd2a351fa160","bytes":854},"Proof.lean":{"sha256":"ad289f91a3a65da62d4b5f703b4f2c90c87ebbe48b27e385a0cc2e21ba73ee51","bytes":426},"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."},{"slug":"hunter-zero-identity-reflexivity","identifier":"hunter-zero-identity-reflexivity","title":"Identity, Nothing, and Zero","author":"Maclain Hunter","sourceSha256":"1d6ade9e443738d204a8a944c099edb401d3277f2ced2ee36f65216f8f105697","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:20.116Z","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:53.667Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"f00f323c860a16dbcd67ef9c9104b55f1c3071c09432bf2d0cde59dfb9cf005e","bytes":860},"Proof.lean":{"sha256":"2c86adb05872c88ccde909dd8328d58967562a1d21cb3a647b56c41c2dc758f7","bytes":279},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-if-then-but-since","identifier":"hunter-if-then-but-since","title":"If, Then, But, Since","author":"Maclain Hunter","sourceSha256":"d5d605ddc507120a8697c591af1ae2d6c03ad84b39a8415dc01c3548cac69754","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:04.237Z","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:54.570Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{Q <-> P, ~P, ~P -> R, R <-> S} |= (~P & ~Q) & (R & S)","sourceOffset":1283,"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":["Q <-> P","~P","~P -> R","R <-> S"],"conclusion":"(~P & ~Q) & (R & S)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!((((v1 == v0) && (!v0)) && ((!(!v0)) || 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":"source_identity_rule","sourceStatement":"A is A","sourceOffset":1148,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"1f0df96625a6dee6bed2269774ef626ce0640154f0f5a6f9c77aef765ddc16ab","bytes":3081},"Proof.lean":{"sha256":"9dd04631dbc5251e88c7b8ffca8d3bca0f21fa46e388ffbf627ffebb40cecb6e","bytes":621},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-incoherent-god-incoherent-thought","identifier":"hunter-incoherent-god-incoherent-thought","title":"Incoherent God <-> Incoherent Thought by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"e1964227dd6675790c67d62efb1a7232d540ecfbd6e2977b44cf55fb68cd1626","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:17.063Z","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:55.480Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, R, R -> P, S, S -> P} |= (P & Q) & (R & S)","sourceOffset":990,"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","R","R -> P","S","S -> P"],"conclusion":"(P & Q) & (R & S)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((((v0 && ((!v0) || v1)) && v2) && ((!v2) || v0)) && v3) && ((!v3) || v0))) || ((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"}],"files":{"source.json":{"sha256":"ced6e811dd76387b1d3ef4cae925609b4929cf9030735236cef49e24214bbb7a","bytes":2157},"Proof.lean":{"sha256":"4e2854e449df2cf3e1b5bc2a7d5a5903fac4fe95785529ca628ebdd53084fc69","bytes":565},"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."},{"slug":"hunter-infinite-cause-dynamic-reality","identifier":"hunter-infinite-cause-dynamic-reality","title":"Infinite Cause, Dynamic Reality, and the Axiom of Logic","author":"Maclain Hunter","sourceSha256":"68d262bdd1cd10a84662e97e1bd7f3dbaafa58e0901c474a9772597e9e719f57","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:08.738Z","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:56.394Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{C, L, I} |= (C <-> L) <-> I","sourceOffset":1786,"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":["C","I","L"],"premises":["C","L","I"],"conclusion":"(C <-> L) <-> I","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && 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"},{"id":"inference_2","sourceStatement":"{P, Q, R} |= (P <-> Q) <-> R","sourceOffset":1843,"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"],"conclusion":"(P <-> Q) <-> R","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && v2)) || ((v0 == v1) == v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":706,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"07e0a17d7004cffdb1fe1cd1857e5e88c4cdaacfa2edf7b6cea9d8218ae075e1","bytes":3299},"Proof.lean":{"sha256":"4b79bc3779afd855cb617fe6cdb9c0bb47c3ee8931cdf7a9f9b3788800214d4e","bytes":763},"lean-check.txt":{"sha256":"40b7da001d5d78d36b6960c8ae1b7c13a2ea6cf5f9da51ea55e40e490d78ea16","bytes":242}},"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."},{"slug":"hunter-information-based-origin","identifier":"hunter-information-based-origin","title":"Information Based Proof of Origin by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"4a128d061214c71b5daf72d3e0cb4a81b02e4565d9932076473b7de4a5cce9c5","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:28.886Z","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:57.272Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, R, R -> P, R -> Q, Q} |= (P & Q) & R","sourceOffset":1083,"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 -> P","R -> Q","Q"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((((v0 && (v0 == v1)) && v2) && ((!v2) || v0)) && ((!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":"1076c4131aacb1b6e6185f9a8cbfab16632ac4814862a72a4421ecbe991f3484","bytes":2623},"Proof.lean":{"sha256":"f85bdd4af377b698dc5f6f3a3291b596d7b5aa1c87576f80de789fbc73a4347b","bytes":534},"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."},{"slug":"hunter-invalid-potato-salad-proof-control","identifier":"hunter-invalid-potato-salad-proof-control","title":"Intentionally Invalid Potato-Salad “Proof” — Evaluator Negative Control","author":"Maclain Hunter","sourceSha256":"1fa2582799902beeb4738c131347c1b49488bbf7e02f98f3f20266fc1cead886","sourceKind":"authored-source-record","recordedAt":"2026-10-03T01:36:33.395Z","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:57.274Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"20b9257a79c838f9e303dd0121af1114be62620ec6193e5c9059a44d04220b1c","bytes":1673},"Proof.lean":{"sha256":"7633b676cea20130794e0cd4e6752ba9b23033f6b06380d742c6c694527b0c8b","bytes":329},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-interpretation-is-logic","identifier":"hunter-interpretation-is-logic","title":"Interpretation is Logic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"a97743fe3fe9e01cfff137eee01276298317522676a5e5dc02a46774ef414cc7","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:42:19.248Z","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:58.182Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q} |= P & Q","sourceOffset":1806,"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"],"premises":["P","P -> Q","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"9f29aacb3593097da049f145e03868bfb6a6c82111c39dc781944d888e41649c","bytes":2621},"Proof.lean":{"sha256":"beca5ecfa9630bae09b1944f238a71d8c6609c311b9a0e9e6f80916269e9ec5b","bytes":457},"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."},{"slug":"hunter-invariant-tautological-fragment","identifier":"hunter-invariant-tautological-fragment","title":"Invariant Tautological Fragment by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"1bc75a70dfc26a2e7623c9982890ba0556e0b8ba4a2dcb125ea9fd47c6e10dd8","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T15:11:12.854Z","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:59.504Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.inference_3","HunterAuthored.inference_4","HunterAuthored.inference_5","HunterAuthored.inference_6","HunterAuthored.inference_7","HunterAuthored.inference_8"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":4,"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","T","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":98,"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","T","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":192,"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","T","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_3 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_3\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_3"},{"id":"inference_4","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":286,"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","T","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_4 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_4\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_4"},{"id":"inference_5","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":380,"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","T","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_5 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_5\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_5"},{"id":"inference_6","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":474,"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","T","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_6 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_6\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_6"},{"id":"inference_7","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":592,"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","T","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_7 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_7\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_7"},{"id":"inference_8","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":801,"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","T","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_8 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_8\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_8"}],"files":{"source.json":{"sha256":"bc26d1b1e2cb0b08c29adcc49850ec39dd7b9368f9ac515bd8fa82077b52e409","bytes":2475},"Proof.lean":{"sha256":"b3f8c3840f6466f51af179f2ebaf58d49e600d6e0ee1c66b9fb1187656ea9788","bytes":2492},"lean-check.txt":{"sha256":"d2a647b6eb0064c4ffbe841fda13c667af3636b9ad3b780d630c901983529a9b","bytes":528}},"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."},{"slug":"hunter-irrelevant-acceptance","identifier":"hunter-irrelevant-acceptance","title":"Irrelevant Acceptance","author":"Maclain Hunter","sourceSha256":"b2c28ccc525fe9f38003326e0677bf3c376d052e12dba7b1fddcc7678263472d","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:53.136Z","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:00.351Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> P, (P -> P) -> ~(Q -> P), P -> R} |= (P & ~Q) & R","sourceOffset":790,"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 -> P","(P -> P) -> ~(Q -> P)","P -> R"],"conclusion":"(P & ~Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((v0 && ((!v0) || v0)) && ((!((!v0) || v0)) || (!((!v1) || v0)))) && ((!v0) || 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"},{"id":"source_identity_rule","sourceStatement":"Logic is Logic","sourceOffset":56,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"e427c2aa0ba1ff2f53872c13fc4b8fe0aeab4affae88f04913275e09b342d04a","bytes":2813},"Proof.lean":{"sha256":"d1dc5136bcf9ac5fd4a9389d524597d0ef7bec995e6b8d0fcb97f6a24c89cf20","bytes":620},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-jesus-and-i","identifier":"hunter-jesus-and-i","title":"Jesus and I by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"2ee48ee11cf4c087aea64b769a6f4d219a92a0336b8702cfb671a876cb8e2b44","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:42:10.068Z","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:01.230Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (P & Q) & R","sourceOffset":314,"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"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && 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"},{"id":"inference_2","sourceStatement":"{S} |= S","sourceOffset":4854,"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":["S"],"premises":["S"],"conclusion":"S","status":"candidate","leanStatement":"theorem inference_2 (v0 : Bool) :\n    ((!v0) || v0) = true := by\n  cases v0 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"a596aeadd1eb33f44194d6c47c83844f7a3016c381694e27c53139786d9146ea","bytes":6461},"Proof.lean":{"sha256":"59f31a172e17dca93164c0a8757be7b7338745a9bfdd28f5f132262c7baa58c2","bytes":572},"lean-check.txt":{"sha256":"9dd24ecb3d82c309e42e8e914b5df3ec490fd2259644de7d887fca9eeff5dfe5","bytes":174}},"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."},{"slug":"hunter-jesus-shared-logos","identifier":"hunter-jesus-shared-logos","title":"Jesus and the Shared Logos Essence","author":"Maclain Hunter","sourceSha256":"6fc7b85dc3c47be4ebc621a926fef7198e8edbf2691ba672c8d54182ecc3cbbd","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:16.177Z","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:02.139Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, (P & Q) -> R} |= R <-> (P & Q)","sourceOffset":237,"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","(P & Q) -> R"],"conclusion":"R <-> (P & Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && ((!(v0 && v1)) || v2))) || (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":"f79117e0412949417c0ec1806ea6cc0621fd1c7be06304a9d997303c7bbf749b","bytes":856},"Proof.lean":{"sha256":"c00525b9b1ecca2e2d16d2faa6cc81c9d753f7818c14c29cb096f6046e7b8f76","bytes":482},"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."},{"slug":"hunter-knowing-logic-proof-received-copy","identifier":"hunter-knowing-logic-proof-received-copy","title":"Knowing Logic and Proof — Full Supplied Copy","author":"Maclain Hunter","sourceSha256":"980062ee1ccd709709aaede382742fefe25a971c740911484895ee7e30be0f72","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:02.013Z","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:03.028Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (P & Q) -> (R & S)","sourceOffset":1211,"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"}],"files":{"source.json":{"sha256":"65d6c8251e2aa2a2ca3339e5830970c0d7b43dbe1f3a432fe9940abfdcbb39a0","bytes":3235},"Proof.lean":{"sha256":"2c238d556a999928a329d92b756a43bbb4f8bc9e71cb38c29d67ba2c07b53393","bytes":543},"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."},{"slug":"hunter-proof-knowing-logos-most-real","identifier":"hunter-proof-knowing-logos-most-real","title":"Knowing Proof and Its Logos Source","author":"Maclain Hunter","sourceSha256":"efaa75bdaece53183eb9b792785b5ecccd1f2268913be1a70d1364dc77dfe119","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:12.522Z","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:03.931Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q} |= (P & Q)","sourceOffset":569,"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"],"premises":["P","Q"],"conclusion":"(P & Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"6d4a888f7c9a1eaf53c0a74ea882cff25350d3b5d03ad52663fdcbd04166bcf9","bytes":1728},"Proof.lean":{"sha256":"0fb6d5104c988e86f02ed2c4cff47b0aa8cbdfc188f9b5e5513de8f2e0d64e20","bytes":431},"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."},{"slug":"hunter-knowing-proof-logic","identifier":"hunter-knowing-proof-logic","title":"Knowing Proof and Logic","author":"Maclain Hunter","sourceSha256":"495d3190fed2c520a0e4e4faf3db334baa616fc00d859809aa5f5212853ffef4","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:45:15.061Z","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:04.852Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{(P & Q) -> R} |= P -> (Q -> R)","sourceOffset":240,"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"],"conclusion":"P -> (Q -> R)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((!(v0 && 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":"38c2a098f4b7ea991afcf979f0a405451d24f9ec86d7bc095837d2a70e91cedf","bytes":849},"Proof.lean":{"sha256":"42316a02d7cb80abc257c9029a8efc113403fcc578be4a43a403fcd62654f23c","bytes":461},"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."},{"slug":"hunter-knowledge-application-concise-copy","identifier":"hunter-knowledge-application-concise-copy","title":"Knowledge and Application of Logic — Supplied Concise Copy","author":"Maclain Hunter","sourceSha256":"ab0dce8cdb4dd3204cdc521b8f27df8d44fbe872028afc49377f475f92002c2a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:46:55.877Z","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:05.747Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (P & R) <-> Q","sourceOffset":964,"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"],"conclusion":"(P & R) <-> Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && v2)) || ((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":"65b41b1422eb3e001cd965113f801f50c47b015d85e27abd457d8aaf83592c3b","bytes":1620},"Proof.lean":{"sha256":"3b5d5881ff21373fd8a6ea63cb2dfb6a5b095710ffa7c661a20d9d6cb91c7d3d","bytes":489},"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."},{"slug":"hunter-knowledge-application","identifier":"hunter-knowledge-application","title":"Knowledge and Application of Logic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"3a652e9950b283e4486a2b2b752a1c97b8ee66b68b736c662922b4f54c928d5f","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:46:56.311Z","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:06.626Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (P & R) <-> Q","sourceOffset":1583,"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"],"conclusion":"(P & R) <-> Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && v2)) || ((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"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":375,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"d73abbbf6f2a0b476322f6c078f495fbb0abba9c3fb643d0d8391132c6b96d2d","bytes":4388},"Proof.lean":{"sha256":"285ca251e2ce403321123b7b8fa7c381e57c116305a20ad1775e80a97898957d","bytes":582},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-god-logic-coherence","identifier":"hunter-god-logic-coherence","title":"Knowledge of God, Logic, and Coherence","author":"Maclain Hunter","sourceSha256":"7b2750dd6016b80249924707c26a5a1383add435d8e251ab64b40615ab3b2e5e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:47:02.412Z","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:06.633Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"a7fc15aa8d08fce9997957e37be741d596b8ecc095eead7909d640064f23f0c4","bytes":853},"Proof.lean":{"sha256":"71b2c9127d772f9d2b245a43fdb1a4d0573362de21c2549f493ccf383d3f51eb","bytes":290},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-leibniz-monads-universal-logos","identifier":"hunter-leibniz-monads-universal-logos","title":"Leibniz's Monads and Universal Logos","author":"Maclain Hunter","sourceSha256":"e735105da520d5c46ba0af5ff11a9b05d799275764c6ef14e08fea23112e911f","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:13.270Z","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:07.541Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= R","sourceOffset":254,"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","Q -> R"],"conclusion":"R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || 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":"b91740b40fd7d86b6c2ed12c0e0e982670d698daf926ec02a3b35a567c941572","bytes":871},"Proof.lean":{"sha256":"947f9c363047ddb59e57f282dacb708fb60220ce63c79bb2058031f9c771a961","bytes":471},"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."},{"slug":"hunter-leveraging-lars-logic","identifier":"hunter-leveraging-lars-logic","title":"Leveraging Lars’ Logic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"182ba175e012b4693ab114600d0ca332b315dfd67c25394f8c3a4288f2142503","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:41:52.067Z","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:08.453Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q} |= P & Q","sourceOffset":460,"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"],"premises":["P","P <-> Q","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && (v0 == v1)) && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P, P <-> Q, Q} |= P & Q","sourceOffset":1412,"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"],"premises":["P","P <-> Q","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 : Bool) :\n    ((!((v0 && (v0 == v1)) && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"d3d2decd809af63e0783ce9ed7b1ae33997231d368edc622093791c41bc3d8c4","bytes":2712},"Proof.lean":{"sha256":"ebc4fa4dc39cfe7642e85061fd40a8d378eca8fb512fc8363b8a4f5f413f5c8a","bytes":617},"lean-check.txt":{"sha256":"9dd24ecb3d82c309e42e8e914b5df3ec490fd2259644de7d887fca9eeff5dfe5","bytes":174}},"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."},{"slug":"hunter-life-death","identifier":"hunter-life-death","title":"Life and Death by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"f6170c1ddafc33986c776a9c9563220ce26360fb01fe60ae9604564982313c67","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:46:52.214Z","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:09.362Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= P <-> (Q <-> R)","sourceOffset":1308,"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","Q -> R"],"conclusion":"P <-> (Q <-> R)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!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":"673b5d61b7c3a43e7f9e70633195951b9fb13519433ff88def64ba552be72494","bytes":1949},"Proof.lean":{"sha256":"4c0fd209837d2cfbcb9643347815df6e7dc63cf9d852a09a3fbba55183034e79","bytes":483},"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."},{"slug":"hunter-limited-identity-reality","identifier":"hunter-limited-identity-reality","title":"Limited Formal Logic and Reality","author":"Maclain Hunter","sourceSha256":"8fa686f9602d5ac91bdb5f2127c58b643b78f93b13cf729f33beb5d948119934","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:23.340Z","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:09.364Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"c70da65689a754cc58c6f51ff9236dd3b986fa265328873a6787feb88ce723a9","bytes":799},"Proof.lean":{"sha256":"bf9be78571b7bc35f0f71d95059c6fa0f7dee3000ca18d92aac2610d25aeb555","bytes":284},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-ontological-ground-coherence","identifier":"hunter-ontological-ground-coherence","title":"Logic and God as Ontological Ground","author":"Maclain Hunter","sourceSha256":"0b550e98668e98165c13627500338d28ef30795741f4010c6b0248d7b1f9db1b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:36.035Z","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:09.367Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"aaec097f6b578194396cc934cec331471910379dc71a25732884bdd010ff25c6","bytes":2982},"Proof.lean":{"sha256":"066298fa5394616590caf1ffb2f824967238546b900dbba83585db7af2c1408f","bytes":287},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-logic-incoherent-models","identifier":"hunter-logic-incoherent-models","title":"Logic and Incoherent Physical Models","author":"Maclain Hunter","sourceSha256":"c607897a201e20900d990dacf74980d534ded13eebdf4b702fa92c2f87c99d8b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:13.864Z","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:10.250Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{A, B, C, D, E} |= (((A & B) & C) & D) & E","sourceOffset":1579,"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","E"],"premises":["A","B","C","D","E"],"conclusion":"(((A & B) & C) & D) & E","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && v1) && v2) && v3) && v4)) || ((((v0 && v1) && v2) && v3) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Logic is Logic","sourceOffset":14,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"b0e0471a4490c8ad4cbfd0c9f9ea33764cc95d6a229cdf33186408fd9967a33a","bytes":3049},"Proof.lean":{"sha256":"e6f8a66281b82736ff474095f4859e5e9786efe279db366faeec264b0f25a041","bytes":630},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-logic-self-standard","identifier":"hunter-logic-self-standard","title":"Logic and Its Self-Meeting Standard","author":"Maclain Hunter","sourceSha256":"e2b5f46a2303cd35bd2381ebf5f382f5dbd119f7c12ecc6f85578314be207f2a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:04.309Z","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:11.167Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= P -> ~~((P & Q) & R)","sourceOffset":202,"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","Q -> R"],"conclusion":"P -> ~~((P & Q) & R)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((!v0) || (!(!((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":"ef3e11e1096d2d7ca72cae0c1d58f6f2e0c6cdb77d8ac1b97b96f538155d2113","bytes":829},"Proof.lean":{"sha256":"3aae83660b3dd5918f51105c5f7d0495f9bb7536d94aad504819ce8d5de568f9","bytes":503},"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."},{"slug":"hunter-logic-source-standard-evidence","identifier":"hunter-logic-source-standard-evidence","title":"Logic and Logical Structure as the Source and Standard of Evidence","author":"Maclain Hunter","sourceSha256":"8a22f24936c8d59bfc4578a2e183e0c77b679dcfb534837448fdc997438718e8","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:33.621Z","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:12.074Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S} |= (P & Q) & (R & S)","sourceOffset":907,"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","Q","R","S"],"conclusion":"(P & Q) & (R & S)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && 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"}],"files":{"source.json":{"sha256":"be4001064fa182b448ebe25c9ee5ed21b0fbbec5a5f5fd3372e42514070895f7","bytes":2166},"Proof.lean":{"sha256":"250a583e45d334db2de103be41e755ddbf9f9345b6b56a822b855d18cc2fe74e","bytes":527},"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."},{"slug":"hunter-logic-battle-sexes","identifier":"hunter-logic-battle-sexes","title":"Logic and the Battle of the Sexes","author":"Maclain Hunter","sourceSha256":"20179b435cf0ea7a51c6f54473b14b4f81821c5e20a29abca12c1f8abf279faf","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:42.877Z","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:12.969Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= ((P & Q) & (R & S)) & T","sourceOffset":2109,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"((P & Q) & (R & S)) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":1741,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"d96da4bf5b23d49e99ec337d364b30048d3e7a8acf83829171fcdb66818eba11","bytes":4206},"Proof.lean":{"sha256":"331d87a1be9d2d62238902dd7163f3b4b44c9ea92d5a6e9376fd234174fcc934","bytes":671},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-logic-answer-problems","identifier":"hunter-logic-answer-problems","title":"Logic and the Resolution of Problems","author":"Maclain Hunter","sourceSha256":"ceda8b0d1bc3f521fc7b32daef2c2ad310ed0308df58467dfdb598f26c2ea11d","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:21.634Z","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:14.201Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) & R","sourceOffset":241,"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","Q -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!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":"f7e039112f415b6d2bf45f21ef8d90f50e22f0270d8160c0f47147155d7b2aea","bytes":855},"Proof.lean":{"sha256":"a4953da2ed2b2ab9f1ea1fe92721ad4b86e1de53e04cde821d8e96f0834c394b","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."},{"slug":"hunter-logic-applied-needs","identifier":"hunter-logic-applied-needs","title":"Logic Applied to Needs by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"83001098f9451632fff8f7c1dc4206dd69a39bdd8c1ce42103d385bb75a6ca84","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T17:44:39.845Z","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:15.086Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S} |= (P & Q) -> (R & S)","sourceOffset":1194,"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","Q","R","S"],"conclusion":"(P & Q) -> (R & S)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && 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"}],"files":{"source.json":{"sha256":"5f3905528559c4c78a66b303ed8d73d8edd90eaa2e5367e9d7bd8ffcafb5abaa","bytes":3277},"Proof.lean":{"sha256":"69f487d66eccc6a0d6c0b9f6bc7622c453efe875b52a2c15549b8b62950f3bb5","bytes":504},"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."},{"slug":"hunter-unified-tautological-rule","identifier":"hunter-unified-tautological-rule","title":"Logic as a Unified Tautological Rule","author":"Maclain Hunter","sourceSha256":"ce79598ada12be3f45fce1042c24f0465bb82168caa6dd6e7578ad4e01db1d92","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:03.065Z","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:15.089Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{(P v Q) ->} |= (P -> (P -> ~(P -> ~P))) v (Q -> (Q -> (Q -> ~Q)))","sourceOffset":120,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Expected proposition identity","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"251fa6568ff92f3c41f82dafd1d56fbf8efe8ff7bfa4e7d2bedba4994b8e4979","bytes":770},"Proof.lean":{"sha256":"06c5408937f3c7e6b6148cb7677885f0a31fa5273b9b989ef8d8ef910056f2a5","bytes":288},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-logic-foundation-not-presupposition","identifier":"hunter-logic-foundation-not-presupposition","title":"Logic as Foundation, not Presupposition","author":"Maclain Hunter","sourceSha256":"bccf1ae9f6fdc8246f04b3db71ae0b99e5bc6a817e56a11423ac5d40f4ed876e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:09.425Z","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:15.987Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= (P & Q) & (R & S) & T","sourceOffset":447,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"(P & Q) & (R & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Logic is Logic","sourceOffset":3,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"190b84bc58a19ca728398e71895295c6980a85d47ef113a0797ac3bcadafbc95","bytes":1605},"Proof.lean":{"sha256":"fcb707ebb5871f55f8472dafb2c6d642ea278a13eae3e51f227e84b30ac73f23","bytes":677},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-logic-tool-reflexivity","identifier":"hunter-logic-tool-reflexivity","title":"Logic as Reality and More Than a Tool","author":"Maclain Hunter","sourceSha256":"9b134711474c46d4a413d90365721ce90c09181d0f42614f8cf04aa2a6deea30","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:26.535Z","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:15.990Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"b044c164097d046b16582543d2b377eea172739eebf7cdd71857724979e71745","bytes":860},"Proof.lean":{"sha256":"c417d7e6a57c3d454c39fc9a01ed97d83e7172ea8633f37fe3bcbf15e328136d","bytes":289},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-reality-origin-logic","identifier":"hunter-reality-origin-logic","title":"Logic as Reality’s Origin by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"1f56ff1da794b031bcc37149af2414ee2bb7d411b548b28b8d1cba1c4ede4d34","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:22:38.566Z","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:16.869Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= ((P & Q) & (R & S))","sourceOffset":1630,"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"}],"files":{"source.json":{"sha256":"93e7b6a09d4851309aa1c7880c33bc78660f8bd709e685b984c4e8729613bfb0","bytes":3787},"Proof.lean":{"sha256":"37897fcb996a2ba30b66498b2669868c0b79ba2c8b32e9bc12ea4db182fa28b6","bytes":539},"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."},{"slug":"hunter-logical-basis-qualified-teaching","identifier":"hunter-logical-basis-qualified-teaching","title":"Logic as the Basis of Science, Education, and Qualified Teaching","author":"Maclain Hunter","sourceSha256":"3d66c32cbe9331fdae526edc6e096a677cb4ca94acda7df766282c557e22f64e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:28.735Z","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:17.746Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= (P & Q) & (R & S) & T","sourceOffset":908,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"(P & Q) & (R & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"180352dc794523a1ddf03357d978e0cf5f1b03c5de165e6f33b092a640619eef","bytes":1951},"Proof.lean":{"sha256":"7293fcda171599002a1aa8c86aa2cc24d88d59a7cea76729663503bb80eafcfd","bytes":601},"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."},{"slug":"hunter-logic-ground-religion-philosophy","identifier":"hunter-logic-ground-religion-philosophy","title":"Logic as the Ground of Philosophy and Religion","author":"Maclain Hunter","sourceSha256":"bba9f55751e5d6e38fc9ff80c4f8ceb72d101927f0328ffb5919e836f2ca8816","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:15.233Z","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:17.749Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q} |= (P & Q)","sourceOffset":490,"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"],"premises":["P <-> Q"],"conclusion":"(P & Q)","status":"countermodel","countermodel":{"P":false,"Q":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"29830029f6a1b8378ffd349998be906ec983592bebdbf899d2c7f81d3e1a6240","bytes":1446},"Proof.lean":{"sha256":"f29e2769d848b5ea07cfffe6a80f6067cb9345845078016d766636d5f3f42248","bytes":298},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-logic-infinity-duality","identifier":"hunter-logic-infinity-duality","title":"Logic Beyond Infinity and Duality","author":"Maclain Hunter","sourceSha256":"59615f0f24a31078b001d539343a6fc64220b1436db4d5237c732f8afda230c2","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:06.005Z","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:18.640Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, R -> (Q -> P)} |= (R <-> (R -> ~(R -> ~R))) -> (Q -> P)","sourceOffset":215,"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 -> (Q -> P)"],"conclusion":"(R <-> (R -> ~(R -> ~R))) -> (Q -> P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((v0 && v1) && v2) && ((!v2) || ((!v1) || v0)))) || ((!(v2 == ((!v2) || (!((!v2) || (!v2)))))) || ((!v1) || v0))) = 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":"d923b4ff27a26e96eacdcf12dd04bfef60f72bea60d78e2358d7c2837b967f55","bytes":864},"Proof.lean":{"sha256":"d5e446aeece4ece22847a8ef2e82d3dc60746dd57580c5947eb6b378777195f9","bytes":534},"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."},{"slug":"hunter-logic-climbs-ladders","identifier":"hunter-logic-climbs-ladders","title":"Logic Climbs Ladders by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"dfae1077e78c02aeacecafa74b5408ac906e4ca2237ed0d251d49e1617572f4e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:22.164Z","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:19.509Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q} |= P & Q","sourceOffset":553,"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"],"premises":["P","P <-> Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && (v0 == v1))) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"7ed39a519484b1d5b185a0bd3d76e2b0dd4fcc7c563a93d158da2eebf6f8f5b2","bytes":1559},"Proof.lean":{"sha256":"2f2d66e372537e48e2b86bfad6e806987e9e187d6d8d0e8799474a64148a6582","bytes":443},"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."},{"slug":"hunter-logic-contains-energy","identifier":"hunter-logic-contains-energy","title":"Logic Contains Energy by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"ce3eb40330878ca33ab7096291a6188907beabb26dc6e093c353b835f168d94a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:00:01.126Z","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:20.429Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S <-> T} |= ((P & Q) & (R & S)) <-> T","sourceOffset":2258,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S <-> T"],"conclusion":"((P & Q) & (R & S)) <-> T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && (v3 == v4))) || (((v0 && v1) && (v2 && v3)) == v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"9936d9e6ce6c160111013d4b9800cf64acc7fe7cb2fe762f567ea0be2556ee2f","bytes":6402},"Proof.lean":{"sha256":"2cd22519489aaca99c11f407d46c23bb284eed5dcb463b37642e62be8734171d","bytes":573},"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."},{"slug":"hunter-logic-in-physics","identifier":"hunter-logic-in-physics","title":"Logic in Physics by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"6cc5f4f0290bfc9ba71db5f95d77da7908852cd161be6d104e6bd43d489e334c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T14:53:49.389Z","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:21.284Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S, T, U, U <-> T, T -> P, T -> Q, T-> R, S <-> T} |= ((P & Q) & (R & S) & T","sourceOffset":2765,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":1877,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"733f781f2d91f117d1b26573c93bab309de8f39c890b643dea27bb9542b5f22f","bytes":7847},"Proof.lean":{"sha256":"379d0091f0df1f002b357a5049318001c6d44c4ca935c8a7902873740bb95bec","bytes":386},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-logic-god-in-reality","identifier":"hunter-logic-god-in-reality","title":"Logic is God in Reality by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"56583045a84ae707743273a22333a4a264c88ff1d1ed3b1bd5fc750b45a491b4","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:41:57.118Z","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:22.180Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":796,"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"}],"files":{"source.json":{"sha256":"0758058df3221d513649d0555f644b3d2db0e25ff1e94b2f3de29fbce85998e1","bytes":2565},"Proof.lean":{"sha256":"3312f2146b0dd9900663c19d1957817360960196bd42d88880b4180d46f604a1","bytes":526},"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."},{"slug":"hunter-logic-most-logical","identifier":"hunter-logic-most-logical","title":"Logic is Most Logical by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"a4063aabf0f78749c4b38282b01008e0acd28ad226f6667f26c88ab7115cad39","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:20.586Z","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:23.008Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P <-> P} |= P <-> P","sourceOffset":354,"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"],"premises":["P <-> P"],"conclusion":"P <-> P","status":"candidate","leanStatement":"theorem inference_1 (v0 : Bool) :\n    ((!(v0 == v0)) || (v0 == v0)) = true := by\n  cases v0 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"60150159d23ae677ff3df0c2b4bde44e9a9446922b5a2dd4ad836857336a7592","bytes":1616},"Proof.lean":{"sha256":"36ccaa6137904f362def1dfbee42f6b5454814a19a7e013ea00c2a21075afe1b","bytes":420},"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."},{"slug":"hunter-logic-reason-logos-logical-foundation","identifier":"hunter-logic-reason-logos-logical-foundation","title":"Logic is Reason, Logos, and the Logical Foundation of Existence","author":"Maclain Hunter","sourceSha256":"26c19afff7cc3fa75fa67bc8b5ea9796b42218a102f83e513295189651842dfb","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:18.425Z","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:23.874Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q} |= P <-> Q","sourceOffset":962,"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"],"premises":["P <-> Q"],"conclusion":"P <-> Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 == v1)) || (v0 == v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"058b7e3dcaef18ba0e0382677668a82a1e75e7a4fe328e3a8c541296078d8282","bytes":1915},"Proof.lean":{"sha256":"1d237b79da43b255716addc5b39c9b315f20f6f1fbc0e09e07154484d01f660f","bytes":460},"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."},{"slug":"hunter-logic-mandates-mcb","identifier":"hunter-logic-mandates-mcb","title":"Logic Mandates MCB by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"66c55a92f6447ae816d7262a88ba6f379b47de8e088b30c85228d73a86c74942","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:42:37.280Z","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:24.759Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> P} |= (P & Q) & (R & S)","sourceOffset":724,"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","S -> P"],"conclusion":"(P & Q) & (R & S)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v0))) || ((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"}],"files":{"source.json":{"sha256":"67a26511720cccbc6003b98413f1bcdf75b70c9179dabd23787ea7c680940796","bytes":1766},"Proof.lean":{"sha256":"0df20991398c28bd59b66313b881807a93db985b78fae51b1a7480c76f12023f","bytes":549},"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."},{"slug":"hunter-logic-coherent-transformations","identifier":"hunter-logic-coherent-transformations","title":"Logic Preserved through Coherent Transformations","author":"Maclain Hunter","sourceSha256":"1ac1940023ea8b8ff26acfa7fe75a4a678919ada2464b478f44891ed05bfb80b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:02.721Z","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:25.642Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, S <-> P} |= (P & Q) & (R & S)","sourceOffset":1176,"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","S <-> P"],"conclusion":"(P & Q) & (R & S)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && ((!v1) || v2)) && (v3 == v0))) || ((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":"source_identity_rule","sourceStatement":"Logic is Logic","sourceOffset":30,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"94201e69d8cb9a0706d77da0f25ce7789cf03612c0280a07ee2ca49d2b94f4bd","bytes":1955},"Proof.lean":{"sha256":"37c94a4b3840bb4b794fc99a943b1f0f4a7a610c46531088f72620c801ad37e0","bytes":640},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-logic-says-ergo-i-say","identifier":"hunter-logic-says-ergo-i-say","title":"Logic Says Ergo I Say by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"4b6e16998317bfdf749f11f102a02813253d6a9845198ef6b2582a08d21dd3b7","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:20.077Z","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:26.561Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.inference_3","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q} |= P & Q","sourceOffset":313,"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"],"premises":["P","P <-> Q","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && (v0 == v1)) && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{T, P <-> Q, Q <-> R, R <-> S, S <-> T} |= ((P & Q) <-> (R & S)) <-> T","sourceOffset":3210,"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","T"],"premises":["T","P <-> Q","Q <-> R","R <-> S","S <-> T"],"conclusion":"((P & Q) <-> (R & S)) <-> T","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v4 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4))) || (((v0 && v1) == (v2 && v3)) == v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{P, Q} |= P <-> Q","sourceOffset":4827,"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"],"premises":["P","Q"],"conclusion":"P <-> Q","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"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":2580,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"c5b4e951789315ff2c074f44d394a3b741452d0ae94fe2d1e015e22685228dd8","bytes":7130},"Proof.lean":{"sha256":"d6255d5feab752fdee2a475dab56bb3aa49205f21ff63a52d9c88915f0f816ce","bytes":973},"lean-check.txt":{"sha256":"b2a13c78d5e07cc13897edfa6e4ad95b717a32423f43c97d6c342c394c93869c","bytes":301}},"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."},{"slug":"hunter-logic-with-yhvh","identifier":"hunter-logic-with-yhvh","title":"Logic with YHVH by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"6b3e99315a9fbbe914b006db94c8ee39f78b35fb0e430d527a7c24fb2af14bc9","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:54:46.491Z","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:27.422Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{Y, H, V, G} |= ((Y -> H) & (V -> H)) <-> G","sourceOffset":286,"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":["G","H","V","Y"],"premises":["Y","H","V","G"],"conclusion":"((Y -> H) & (V -> H)) <-> G","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v3 && v1) && v2) && v0)) || ((((!v3) || v1) && ((!v2) || v1)) == v0)) = 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"}],"files":{"source.json":{"sha256":"f03f831fbd0bebce5776311b7f208631a63dd458ae118eb135bc3b5c17502633","bytes":1497},"Proof.lean":{"sha256":"6f9c837ee869cb0e00c4e6ea9f035b2db3824c12a97d774ec5b311fc9d2c91cf","bytes":508},"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."},{"slug":"hunter-logic-coherence-reality","identifier":"hunter-logic-coherence-reality","title":"Logic, Coherence, and Reality","author":"Maclain Hunter","sourceSha256":"8607bc5ae0ce17e886b4102fcdde545ce2730a99285d286d862c5940d879466c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:15.330Z","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:28.325Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{L, R, O} |= (L & R) & O","sourceOffset":1754,"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":["L","O","R"],"premises":["L","R","O"],"conclusion":"(L & R) & O","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && 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"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":552,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"f4facf54c023b25f3a6a73017049df4e1e37ac2ccba8fcf974d19a75891bfbce","bytes":2944},"Proof.lean":{"sha256":"f8f5ca9a8110c3247f4a30dc7b009b13e39bf4825d3bdaef6c77a81425e8e76b","bytes":559},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-energy-electricity-identity","identifier":"hunter-energy-electricity-identity","title":"Logic, Energy, and Electrical Identity","author":"Maclain Hunter","sourceSha256":"498c02e6eca5466d308492b3bdc56fdb7fe30ed94774e302ba2d5db87a50c9bd","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:12:03.037Z","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:29.204Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, P -> R} |= (P & Q) & R","sourceOffset":241,"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","P -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v0) || 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"},{"id":"source_identity_rule","sourceStatement":"A = A","sourceOffset":85,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"6d6a4d62ea40dc81f3eb6cd83187679a56672bbe6458e7de6b21107829a7b55a","bytes":872},"Proof.lean":{"sha256":"030d67ad860f9f72376d31b98d6cbde1bba250f4c3bffd5e6e03df82b4e7d9d3","bytes":590},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-logic-ethics-epistemology","identifier":"hunter-logic-ethics-epistemology","title":"Logic, Ethics, and Epistemology by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"4f40a117323e4933b097560d59f89e8ad14c6c2e53b3134d6dc0e896447ca08c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:57:39.572Z","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:30.100Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P → Q, Q → R, R} |= P <-> (Q & R)","sourceOffset":596,"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","Q → R","R"],"conclusion":"P <-> (Q & R)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && ((!v1) || v2)) && 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"},{"id":"source_identity_rule","sourceStatement":"Logic is Logic","sourceOffset":66,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"17d8a8ab662ad5a947dd51725c6028b8ae8c908de3f345b0993658797f08f530","bytes":1767},"Proof.lean":{"sha256":"931fd7a05ebfca9aa8dcd5d438d4ecef7ff8c2009d8b0fc9a078b1c256893a9f","bytes":609},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-logic-identity-prophetic-insight","identifier":"hunter-logic-identity-prophetic-insight","title":"Logic, Identity, and Prophetic Insight","author":"Maclain Hunter","sourceSha256":"aa7fc63c0336f6b11537552539114009637bda7040d2a597dadcfcf8caca9f52","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:13.239Z","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:30.971Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{V, V<->V, Vv~V} |= ((V & ~(~V))","sourceOffset":796,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{V, V<->V, V≠V} |= ((V & ~(~V))","sourceOffset":2793,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"≠V\"","kernelStatus":"not_checked"},{"id":"source_identity_rule","sourceStatement":"Logic is Logic","sourceOffset":139,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"eba02a3cfe6b3594ada8bb3c1500416610d5e857af19945484cc9455b0c055d7","bytes":3799},"Proof.lean":{"sha256":"eac15fb4c1f58e3255b03c781208a582197288c2cb335a4224d76fb2c38e817f","bytes":390},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-logical-reasoning-forms-applications","identifier":"hunter-logical-reasoning-forms-applications","title":"Logic, Logical Reasoning, Forms, and Applications","author":"Maclain Hunter","sourceSha256":"9584dbd358008d2f84163e5dbb7659e2d49eba11368534b47f5a076d322f73ff","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:31:08.432Z","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:31.884Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_2","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P->Q, Q->R, R->S, S->T, T->U, U->[and so on...]} |= ((((P & Q) & (R & S) & T) & U) [and so on]]]","sourceOffset":422,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"[and so on...]\"","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{P, P->Q, Q->P} |= P & Q","sourceOffset":535,"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"],"premises":["P","P->Q","Q->P"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v0))) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":284,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"c31478a5e7b5b3fda75740464071ee927149a00ce9fe0f9a1532810c70d23585","bytes":4327},"Proof.lean":{"sha256":"e94fa4b022f5a8712f457dba41209cf00876924fae46d8352ae111342fb1a86c","bytes":577},"lean-check.txt":{"sha256":"09f2f26c8263564525ffd5ade196bbb5419f5ac52d40a6d940814c58412853e8","bytes":183}},"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."},{"slug":"hunter-logic-natural-supernatural","identifier":"hunter-logic-natural-supernatural","title":"Logic, Nature, and Logical Supernature","author":"Maclain Hunter","sourceSha256":"7ef9fb061e5a8c5bcc0a96758fb224fc34c7249770731cca6a92160c635e7ba7","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:08.760Z","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:32.744Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":211,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"3082d7e32f82f4d3401f204386fe28a95ea31739ece5c9acc870d3d082992063","bytes":871},"Proof.lean":{"sha256":"f3da475c21bfe9ff1936ad9027ddec531221f86ba9dd436e7a94164711068988","bytes":390},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-logic-origin-god-notation","identifier":"hunter-logic-origin-god-notation","title":"Logic, Origin, God, and Contradiction","author":"Maclain Hunter","sourceSha256":"2f09c17d1fd1fa38eb834e731f9f625f931a880cf8784a750ad0de921830ae60","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:33.511Z","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:32.746Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"f1afa23c14b6ca33a68185dd393a6be245f59dcb13f7700aab3faf2493c96a08","bytes":876},"Proof.lean":{"sha256":"1f39a9e50262406c5e5bfdf50a5dc3716a70f03d9ec372d65b10758b6145c16c","bytes":289},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-logic-proof-coherence","identifier":"hunter-logic-proof-coherence","title":"Logic, Proof, and Coherence by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"f7fd2ea8fc0843fe76906e92ba1a293945be1299346ac681d80c0caaca5e42a6","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:14.942Z","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:33.696Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T} |= (P & Q) & (R & S) & T","sourceOffset":2299,"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","T"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T"],"conclusion":"(P & Q) & (R & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4))) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"2d20a4349b41df260bc24a9a93b305ffb405d04868e94d10c606d4d6701b7bd0","bytes":3782},"Proof.lean":{"sha256":"327ab8c65994815f8f3dd84442d509a4134e3d9c9a354bbf6128cd5438fc8d03","bytes":570},"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."},{"slug":"hunter-logic-reality-fact","identifier":"hunter-logic-reality-fact","title":"Logic, Reality, and Fact","author":"Maclain Hunter","sourceSha256":"cb405b618d3899b22b614d9f22f704aeefb0ace939b98d60624b80521852b1f4","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:28.971Z","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:34.602Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, (P & Q) -> R} |= P <-> R","sourceOffset":246,"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","(P & Q) -> R"],"conclusion":"P <-> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && ((!(v0 && v1)) || v2))) || (v0 == 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":"7130ce9481980c456811e9ca93c8f6d0536842599847998ed154a3773b528e9b","bytes":842},"Proof.lean":{"sha256":"81bc1777e97ccb2012473d841e7bbde30297c4c7ba514afdee7bc773cf3680fd","bytes":464},"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."},{"slug":"hunter-logic-reality-reflexive-family","identifier":"hunter-logic-reality-reflexive-family","title":"Logic, Reality, and Reflexive Coherence","author":"Maclain Hunter","sourceSha256":"5c93e905136c021a4844ed676a5465e0a5d1d1ff660c472ee711b59b02e5ef15","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:26.419Z","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:35.484Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":30,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"865f2449550d5c6b97d682c6e400c76ee111da9b1f2f9c4dbda3276bab618a65","bytes":878},"Proof.lean":{"sha256":"c9eec3b45795efbad16a3885f97fb7ecfd5450d16425dde55913a7c1b08d15e0","bytes":391},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-skepticism-pragmatism","identifier":"hunter-skepticism-pragmatism","title":"Logic, Skepticism, and Pragmatism","author":"Maclain Hunter","sourceSha256":"e42bc89b5ff989ea8244d5a352ef5ea96022fded4ead6d3f253d15635810a80c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:53.272Z","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:36.390Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P -> Q} |= P -> Q","sourceOffset":262,"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"],"premises":["P -> Q"],"conclusion":"P -> Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((!v0) || v1)) || ((!v0) || v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"a9aebade2ac6ddaaf8ae4db7413e42b3178243fd34146d6ebf6a5bc039fe556a","bytes":855},"Proof.lean":{"sha256":"84931f1e128b89f0da27a38faa859fcfba91c8c1fffa677b3a6250a30a723885","bytes":436},"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."},{"slug":"hunter-logic-coherent-ground-theos","identifier":"hunter-logic-coherent-ground-theos","title":"Logic's Coherent Ground — Logos as Theos","author":"Maclain Hunter","sourceSha256":"9853ae9823117e3fd8af1a156d0495ada7f9dd3c7a3df5943bc7d78145054279","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:37.065Z","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:36.394Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P, (P -> Q) -> R} |= P & (Q & R)","sourceOffset":228,"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"],"conclusion":"P & (Q & R)","status":"countermodel","countermodel":{"P":true,"Q":false,"R":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"d2ef0426d3af397085ece8094cbc41fc420a05770028f047d1460ac529231376","bytes":866},"Proof.lean":{"sha256":"af05b25fc418724de77465a60994c4b07b8aed86c62fcd07333d635fddb45bb6","bytes":294},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-logic-grounding-reality","identifier":"hunter-logic-grounding-reality","title":"Logic’s Grounding in Reality","author":"Maclain Hunter","sourceSha256":"2e1afb7b4c7bc7174549c898f3cf6a3009aca00c6128a8e8dd72c3d8a3d0d410","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:20.598Z","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:36.397Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"21616786c547fd57db423f4a6efc9858d9f1148d0886c7988e99e3d93a1c7442","bytes":1790},"Proof.lean":{"sha256":"3d8dbd2028b43a2da3294692601bfccf7e3d120b8885b7050d844b6ecd3de884","bytes":282},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-independent-logical-coherence","identifier":"hunter-independent-logical-coherence","title":"Logic's Independent Necessary Coherence","author":"Maclain Hunter","sourceSha256":"695691d5f73121effa807455bbe170c926fe83aec0831dd5c0f7ff1b992c3079","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:32.045Z","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:36.399Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"627afaf9409703274ec683538bfa5308eca701b13a2d2e347cc2feabad3c6b5d","bytes":795},"Proof.lean":{"sha256":"c28fc3493b743d59d0f1f3c930106d28e1622faee51f25ae0f5514570179d7b9","bytes":291},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-logics-rightful-claim","identifier":"hunter-logics-rightful-claim","title":"Logic’s Rightful Claim by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"fe0a6e56e6bb34fa86ec81a5d5930c37e0db8110dfc5558ab3fd7cc805f7b33b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:58:05.602Z","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:37.255Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= R -> (P & Q)","sourceOffset":718,"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","Q -> R"],"conclusion":"R -> (P & Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((!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":"1ab96f2846db97c397b01a779267e0e1bdf3fca056a022bc217328112fe6a56f","bytes":1890},"Proof.lean":{"sha256":"7df12f89d19657f79e2018923c3a3749231d4c0eb5bc8baba9ceb7c1158b87a6","bytes":496},"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."},{"slug":"hunter-logical-bootstrapping","identifier":"hunter-logical-bootstrapping","title":"Logical Bootstrapping by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"52d4574b1076bb1cd2bff2c940ae8daa31ef6d9c532475c60f195286d3f78aa4","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:20:00.413Z","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:38.191Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T, T -> U} |= (((P & Q) & (R & S)) & T) & U","sourceOffset":2608,"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","T","U"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T","T -> U"],"conclusion":"(((P & Q) & (R & S)) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"46994f5c70fe959eac7418122d9df8b70059ca11ead692a3506552127c9c6c83","bytes":7579},"Proof.lean":{"sha256":"c0b9d1cd8bad9600d35cd077521f158745fb64ebe7ca1739ae341a416da74897","bytes":619},"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."},{"slug":"hunter-logical-connections-proof-evidence","identifier":"hunter-logical-connections-proof-evidence","title":"Logical Connections, Proof, and Evidence by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"c38ad4ad8fc7b097c3e6770cebdf8d7f238f035deeb907558cb08944c436e630","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:22.992Z","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:39.091Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T} |= (P & Q) & (R & S) & T","sourceOffset":2392,"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","T"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T"],"conclusion":"(P & Q) & (R & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4))) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"d72b2d601e99d5210a8ae69f27f4ce3cfff6aa7e9502e9daa30e22ab67143e7e","bytes":7352},"Proof.lean":{"sha256":"69dc3485b006e79d3b3331876f796695fbfeaf9d3bd8bda0f742c1d1d044b07f","bytes":583},"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."},{"slug":"hunter-energy-logical-creation-conservation","identifier":"hunter-energy-logical-creation-conservation","title":"Logical Creation and Energy Conservation","author":"Maclain Hunter","sourceSha256":"1dc96cd81c05e7190055c0568cfc28ba2564d281ce6139772d28909a5f748d6b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:32.033Z","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:40.076Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> (Q -> R)} |= (P & Q) -> R","sourceOffset":244,"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)"],"conclusion":"(P & Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(v0 && ((!v0) || ((!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":"1848b12a3dfe9d8260bac63972b4c80cc9021cf2fa135c67fc00fdc6e84a8642","bytes":877},"Proof.lean":{"sha256":"a91706d80d6710cc55ec61416430dc9057a9283df3c8842ae18e3c0a85e217f3","bytes":486},"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."},{"slug":"hunter-logical-glue","identifier":"hunter-logical-glue","title":"Logical Glue by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"7d56dc7b3ac75ae16613fe529c56e611089b96c6e4296b2edd564d1f51ca578e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T19:42:29.243Z","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:40.847Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, P -> Q, Q -> P, R, R -> P, R -> Q} |= (P & Q) & R","sourceOffset":1647,"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","P -> Q","Q -> P","R","R -> P","R -> Q"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((((((v0 && v1) && ((!v0) || v1)) && ((!v1) || v0)) && v2) && ((!v2) || v0)) && ((!v2) || 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"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":76,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"3d96fa6c77d1daa3afd63d7f746f1ae45339cf2f80b6447b84672fd6a512122e","bytes":4108},"Proof.lean":{"sha256":"437703608fb60f4d1fd93c33522974207467fce9969b7283e270847493fb88db","bytes":636},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-logical-ground-before-sensing","identifier":"hunter-logical-ground-before-sensing","title":"Logical Ground Before Sensing","author":"Maclain Hunter","sourceSha256":"f6262bc70fa779c3946276bc654ec26e7b99dff59788057fbe5d694eb61fb87c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:14.048Z","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:41.733Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q <-> P, R <-> P} |= R <-> (Q <-> P)","sourceOffset":219,"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 <-> P","R <-> P"],"conclusion":"R <-> (Q <-> P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v1 == v0)) && (v2 == v0))) || (v2 == (v1 == v0))) = 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":"5124ed3e230fb33a074191c7991470411ac4e61d20ddc57abff90da7f8da3df2","bytes":851},"Proof.lean":{"sha256":"4d1aaed7d3d0e22ea767ac6d48bc0cf22e77065a47a7e3f178723eeab1017cb4","bytes":474},"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."},{"slug":"hunter-logical-humility","identifier":"hunter-logical-humility","title":"Logical Humility and Coherence","author":"Maclain Hunter","sourceSha256":"99e064ce7beff7fae80b7318cc964d8b72973489d8af5435ea83f8b756cb88ec","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:08.750Z","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:42.635Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q, Q -> R} |= (P & R) <-> Q","sourceOffset":244,"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","Q -> R"],"conclusion":"(P & R) <-> Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 == v1) && ((!v1) || v2))) || ((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":"0c92c28b22e05b7fb9cc24c8a3c68f47c69f6b40352ef8f166ada045fab5703c","bytes":847},"Proof.lean":{"sha256":"d0590c4b54acdbadd7237173f9f97b0102dba143de5e7a2c603824b1581f2761","bytes":470},"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."},{"slug":"hunter-logical-knowledge-grasp","identifier":"hunter-logical-knowledge-grasp","title":"Logical Knowledge and Grasp","author":"Maclain Hunter","sourceSha256":"8670aaaff3ea59900a550bc23ef3cea9f78cf0767bc9877a237a88a1a12b06be","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:33.492Z","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:43.614Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> (P & Q), (P & Q) -> R} |= (P & Q) & R","sourceOffset":228,"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 -> (P & Q)","(P & Q) -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || (v0 && v1))) && ((!(v0 && 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"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":40,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"661c75e5ef936dcb23edfee84fd25abbec901f9471e422394a22218c2a48c3b6","bytes":856},"Proof.lean":{"sha256":"332596f37d59bcdb3d6559b4974a6aa6db9a194e3e867c2ff76b9a2964bbd798","bytes":595},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"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."},{"slug":"hunter-necessary-reflexive-rule","identifier":"hunter-necessary-reflexive-rule","title":"Logical Necessity and Reflexive Truth","author":"Maclain Hunter","sourceSha256":"4afc8f008a2f8111d90ce78fd4d3f34c1a28e96aed4b7394249cf6973d14368b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:26.531Z","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.462Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"12c8749f2e91c98b78076b05ababf18e01bb0f52d5e37ee595e8733f752a54ea","bytes":857},"Proof.lean":{"sha256":"959250f0786ed9c6af78e3d9dac7a896d5c04e2ebacf2d4e9eee325e99da57c1","bytes":289},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-logical-ontology","identifier":"hunter-logical-ontology","title":"Logical Ontology by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"5fa03c3b38b505522b3c08e029f8d05a875de67b2f534689ec6f46a1864f1bb0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:57:27.325Z","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:45.320Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (P & Q) -> (R & S)","sourceOffset":4255,"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":"source_identity_rule","sourceStatement":"Logic is LOGIC","sourceOffset":205,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"56485291aa0a64a04314856634bf1a25ee263ee83c94037f730a40e05e684ab1","bytes":9226},"Proof.lean":{"sha256":"e0919690104107d320fda52c0e716bde3a1b9de98565d42db742569719108a64","bytes":632},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-logical-proof-empirical-data","identifier":"hunter-logical-proof-empirical-data","title":"Logical Proof is Empirical Data by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"f86cc0bb797a84091e1752913616ad3d2768dc1999336159ba9dd53a68149b27","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:09.158Z","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:46.281Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (P & Q) & (R & S)","sourceOffset":2097,"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"}],"files":{"source.json":{"sha256":"0699b2ac8a50cf2be00d8d9141591705b9d71e6f346030297ff1aa9259ea70a2","bytes":4114},"Proof.lean":{"sha256":"9307c0c7f3f84511e08b3f68e0f4a945f7fa5751026955b03a2d15ac8356b21c","bytes":543},"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."},{"slug":"hunter-logical-rules-god","identifier":"hunter-logical-rules-god","title":"Logical Rules and God by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"0278acc2e2592d9317c36aa68f6236235fd8e78ba1c3de31b67c0b04d64a739e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:23:08.593Z","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:47.209Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{1, 2, 3, 4} |= (1 & 2) <-> (3 & 4)","sourceOffset":1556,"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":["1","2","3","4"],"premises":["1","2","3","4"],"conclusion":"(1 & 2) <-> (3 & 4)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && 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":"{P, P <-> Q, Q <-> R, R <-> P} |= (P & Q) <-> R","sourceOffset":1929,"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","Q <-> R","R <-> P"],"conclusion":"(P & Q) <-> R","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 : Bool) :\n    ((!(((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v0))) || ((v0 && v1) == v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":339,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"1167830ce3bc9411c914e09b3968b3fe68b77b14805caef12b7c95fd4cc73a8d","bytes":4907},"Proof.lean":{"sha256":"8ac514b7fafed4f1fb1f7807363f9da2ce83ae50ae7c59b757648e3567fd5f73","bytes":811},"lean-check.txt":{"sha256":"40b7da001d5d78d36b6960c8ae1b7c13a2ea6cf5f9da51ea55e40e490d78ea16","bytes":242}},"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."},{"slug":"hunter-self-consistency-arbitrariness","identifier":"hunter-self-consistency-arbitrariness","title":"Logical Self-Consistency and Arbitrariness","author":"Maclain Hunter","sourceSha256":"d4afa9b71d21a18bd1ff9fee170471246641da4f36b4f955b71228120a2143f4","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:29.721Z","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:47.211Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"1c6ca9cc227820d0f0dd8c0c634935939899ee14ebb994e1e7571732f4c5790f","bytes":851},"Proof.lean":{"sha256":"21cc6205db52f7063a14d58e00c64d276de7866de50b0c4a03260e6c3f50c2ba","bytes":294},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"maclain-hunter-logical-strategy","identifier":"maclain-hunter-logical-strategy","title":"Logical Strategy by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"89e82012a2ffc2c76485ab30c962ea29705ac633c3fa20dda4e2711abc8253a9","sourceKind":"authored-source-record","recordedAt":"2026-09-25T22:54:04.366Z","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:48.183Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q} |= P <-> Q","sourceOffset":1338,"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"],"premises":["P <-> Q"],"conclusion":"P <-> Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 == v1)) || (v0 == v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"5324f1baf369559680eb8eb80b2a0d6308da6191a5860503c375eaa00c8d8de5","bytes":2296},"Proof.lean":{"sha256":"1342b9f6fd2bca6179d52e43e4cffcfd4b7f664b5e12175da88b3599d3f38d68","bytes":431},"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."},{"slug":"hunter-logical-strategy-supplied-copy","identifier":"hunter-logical-strategy-supplied-copy","title":"Logical Strategy by Maclain Hunter — supplied copy","author":"Maclain Hunter","sourceSha256":"478edb390029ed6cce3889e1386a1f5eb9f5ac36d43ad1b9539a86b86b8bec81","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T19:09:53.775Z","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:49.059Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q} |= P <-> Q","sourceOffset":1338,"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"],"premises":["P <-> Q"],"conclusion":"P <-> Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 == v1)) || (v0 == v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"d06720316c8e3305462d074f8dcaf7ff99a697eb84080ced0204b77e047d12fd","bytes":2331},"Proof.lean":{"sha256":"5fb6d3098db3753abbe3dfdc9eee5724a926d5e24c53c319415923d464890b8a","bytes":449},"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."},{"slug":"hunter-logos-debate","identifier":"hunter-logos-debate","title":"Logos and Debate","author":"Maclain Hunter","sourceSha256":"0056cf0f26c1dd5f55cbadce7b213e265de9bd6f3776b073f28cee9f234f70f0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T22:14:03.568Z","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:50.026Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (P & Q) -> R","sourceOffset":218,"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"],"conclusion":"(P & Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && 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":"9ff46f2c2b342d78a92a8d52de3b5fc921da4a6c3ad372e1e449793bc55441cd","bytes":803},"Proof.lean":{"sha256":"49002d4704eba7599824b3713605d691a45bc28e144b5a2b54570e4bbbc97360","bytes":448},"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."},{"slug":"hunter-logos-personally-usable-reason","identifier":"hunter-logos-personally-usable-reason","title":"Logos and Personally Usable Reason","author":"Maclain Hunter","sourceSha256":"b4ad763e3462061a9c04ee3e6c86e0f33e779b8cf453cbd25ee5edcdd68b980f","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:29.451Z","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:50.027Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"1f42775c9467fd3dfd4bc27021848ce368da5d454adc694d434949742e0157d7","bytes":875},"Proof.lean":{"sha256":"83e6c5a895ab28b8ee63d08f9204dc67b3c996a2de9c4dc638fa20c5541abe58","bytes":286},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-logos-democracy-authority","identifier":"hunter-logos-democracy-authority","title":"Logos and Rational Political Authority","author":"Maclain Hunter","sourceSha256":"3db07a1a17bb720b5b3b28f9b1d08f645948af82058dc44271441b7258a493a0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:23.163Z","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:51.001Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= S","sourceOffset":243,"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":"S","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3))) || 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"}],"files":{"source.json":{"sha256":"06b94e8d677499c5c197bda67b12ecac23507821d56a8c8e163204044c0b1da7","bytes":874},"Proof.lean":{"sha256":"3d4912e19d1acb2156b25399bd710ce61159f3c8659c68b85ad8093fb555260c","bytes":508},"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."},{"slug":"hunter-logos-reflective-consciousness","identifier":"hunter-logos-reflective-consciousness","title":"Logos and Reflective Consciousness","author":"Maclain Hunter","sourceSha256":"f19e91cebccbcefa82a568822590987c6145de2c07130e0e758b06b63b04a210","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:04.309Z","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:51.935Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> (Q <-> R), (R <-> Q) <-> R} |= (P <-> Q) <-> R","sourceOffset":182,"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) <-> R"],"conclusion":"(P <-> Q) <-> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || (v1 == v2))) && ((v2 == 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":"4e58adad5f7329b01cb8ce7ac773870e592cd4861f93b684e8d728ba5f78a1a8","bytes":870},"Proof.lean":{"sha256":"da0a2db1e823165444cc8eba212b9617707fc9ea30ed463a380751d67b65b6f6","bytes":498},"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."},{"slug":"hunter-logos-living-reason","identifier":"hunter-logos-living-reason","title":"Logos as Living Reason","author":"Maclain Hunter","sourceSha256":"c182c13a6d7dba7cf53f0b0c02019769a42edddc8859dabc9f5941276e352191","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:17.343Z","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:52.845Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= R","sourceOffset":239,"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","Q -> R"],"conclusion":"R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || 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":"9f96616cdf61f9fd42c48e39d0d634c50162ce01a9516d226c03114fbd462ea1","bytes":840},"Proof.lean":{"sha256":"9646be0def4a3a02a8863d2d1c14b4651bb84c42c331a76bc04b13dbc4093c52","bytes":457},"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."},{"slug":"hunter-logos-nonlocal-intellect","identifier":"hunter-logos-nonlocal-intellect","title":"Logos as Non-Local Life and Intellect","author":"Maclain Hunter","sourceSha256":"e7096eb453ce27b86a17745d8093f7db786751f6c83f7e51d673ec32e495093c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:42.225Z","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:53.610Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= (R & Q) <-> P","sourceOffset":244,"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","Q -> R"],"conclusion":"(R & Q) <-> P","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((v2 && v1) == v0)) = 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":"2bd749f1594aac10c2c531cf7afbfb7b12e47355d87c972c7165932140093fcf","bytes":870},"Proof.lean":{"sha256":"38dbd1f3d58fe3bb55a646721dab676ecce9b99789da7999a664847d61235390","bytes":488},"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."},{"slug":"hunter-logos-coherent-morality","identifier":"hunter-logos-coherent-morality","title":"Logos Entails Coherent Morality by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"500b7c08a8ce46caaff764d9b2039d1805c6f430b20b36a8e6ddbd8ee4fc47ad","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:41:52.776Z","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:54.501Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> ~S, ~S} |= (P & Q) & (R & ~S)","sourceOffset":843,"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","~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))) && (!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":"{~P, ~P <-> ~Q, ~Q <-> ~R, ~R <-> S, S} |= ~(P & Q) & (~R & S)","sourceOffset":2189,"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","S"],"conclusion":"~(P & Q) & (~R & S)","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 : Bool) :\n    ((!(((((!v0) && ((!v0) == (!v1))) && ((!v1) == (!v2))) && ((!v2) == v3)) && v3)) || ((!(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"}],"files":{"source.json":{"sha256":"25eb822f289127fcf27779dcb4c7a08b10083d266ffe7db2ee99f8b096d5bf0e","bytes":4565},"Proof.lean":{"sha256":"aa5247e467beb9255b08de7156ebb30c0bb10d9d415d01bf763079c4eaab5da4","bytes":817},"lean-check.txt":{"sha256":"9dd24ecb3d82c309e42e8e914b5df3ec490fd2259644de7d887fca9eeff5dfe5","bytes":174}},"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."},{"slug":"hunter-logos-morality-forgiveness","identifier":"hunter-logos-morality-forgiveness","title":"Logos, Comprehension, Morality, and Forgiveness of Evil by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"7218dd9e5dfdbc84f9ade88d095524071989e0b841a68f2389b9fb92786b33af","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:19.132Z","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:55.475Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T, T -> U} |= ((P & Q) & (R & S) & T) & U","sourceOffset":1783,"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","T","U"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T","T -> U"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"3b88bc58be1289cd5f80e9c7dc5ed248e09bffe3c59f767c62d526082b1c8c47","bytes":2996},"Proof.lean":{"sha256":"a5a272579bc39796641370a0155b2397b9b7d6f17f8544128a12d91fb9a1f56b","bytes":653},"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."},{"slug":"hunter-logos-dust-life","identifier":"hunter-logos-dust-life","title":"Logos, Dust, and Biological Life","author":"Maclain Hunter","sourceSha256":"a30cac0c0cc4fa36e93874d632c9930bbb4b44f050efb8e36df16349c9ce9e37","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:33.371Z","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:56.365Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q <-> R, Q -> S} |= (P & Q) & (R & S)","sourceOffset":231,"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","Q -> S"],"conclusion":"(P & Q) & (R & S)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && (v1 == v2)) && ((!v1) || 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"}],"files":{"source.json":{"sha256":"b075372bde070955d8afd5b95dcebb4f19d9e8ad0382a20d79c74b3b8dc7ee1d","bytes":854},"Proof.lean":{"sha256":"eb04cc86782c213c72671d619611ce0c038cc86b0bde8ff2903918bd5d67f1d0","bytes":523},"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."},{"slug":"hunter-logos-conservation-identity","identifier":"hunter-logos-conservation-identity","title":"Logos, Identity, and Conservation","author":"Maclain Hunter","sourceSha256":"0163733b21e3c28da45344c0f641319ecd70f0339b936fc1b141a48918b7511a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:39.522Z","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:57.241Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) & R","sourceOffset":233,"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","Q -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!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":"b579712f4ea531e000787ff3b4283741edafcb353f831ac8f127ddf3b922f610","bytes":850},"Proof.lean":{"sha256":"e30975deed014f95ffe5c89a0fe3a8d3858ecc6a0714940a79cc9570c62ed66d","bytes":484},"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."},{"slug":"hunter-logos-position-entanglement","identifier":"hunter-logos-position-entanglement","title":"Logos, Position, Contingency, and Entanglement","author":"Maclain Hunter","sourceSha256":"44bc1264fd223342ef1c2ea421f57facb294ac4741223374f76619b2ec14e8d2","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:23.366Z","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:57.244Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"86e1c797ac64424e91a71ad79752b92f805abfe54eec824581f649207856a5bf","bytes":1163},"Proof.lean":{"sha256":"53dc539dafa2e1f54d1ae45bb5dd4a85f75998e480bf5b40dd70ca429750ab6b","bytes":298},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-logos-denial-theological-interpretation","identifier":"hunter-logos-denial-theological-interpretation","title":"Logos, Theological Interpretation, and Coherent Denial","author":"Maclain Hunter","sourceSha256":"642abe6f872c27556c61f25a9ea7d954e54a60d0a50dceb5b8ee935846e643c6","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:28.397Z","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:58.092Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= R <-> (Q <-> P)","sourceOffset":223,"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","Q -> R"],"conclusion":"R <-> (Q <-> P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || (v2 == (v1 == v0))) = 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":"6917b9b32419f01481b47d44cef24e4428887b4f8a86b96ec2b66e2b770b6ba8","bytes":884},"Proof.lean":{"sha256":"0d847523c4ac7bb2fbaa9b7b09ef47e33062daa26362641a1f7caf91a8398332","bytes":505},"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."},{"slug":"hunter-logos-theos-arche-latin","identifier":"hunter-logos-theos-arche-latin","title":"Logos, Theos, and Arche","author":"Maclain Hunter","sourceSha256":"675021f4ed3153e539a8d449bc24a7bf755ce30570bc18e9ceef16f9f3f6c2f1","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:23.752Z","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:58.992Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> S, S -> R} |= S <-> ((S -> ~(P <-> ~S)) -> R)","sourceOffset":160,"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","P -> S","S -> R"],"conclusion":"S <-> ((S -> ~(P <-> ~S)) -> R)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v2)) && ((!v2) || v1))) || (v2 == ((!((!v2) || (!(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":"4f2afbdf9ac7d515ed5abb13fed1d766164c73402b1d9e0ca78f1545395dbb96","bytes":783},"Proof.lean":{"sha256":"ab77fca33a8a55a4ae34e07a459b0342bf59c47c257e93f4de40b397716abe25","bytes":502},"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."},{"slug":"hunter-logos-theos-arche-arabic-copy","identifier":"hunter-logos-theos-arche-arabic-copy","title":"Logos, Theos, and Arche — Arabic-Term Version","author":"Maclain Hunter","sourceSha256":"1822c6f4c55e1dfe89a942c82065872b89b1377b7963a180f88ab3aaeea9eb14","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:51.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:39:59.855Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> S, S -> R} |= S <-> ((S -> ~(P <-> ~S)) -> R)","sourceOffset":226,"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","P -> S","S -> R"],"conclusion":"S <-> ((S -> ~(P <-> ~S)) -> R)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v2)) && ((!v2) || v1))) || (v2 == ((!((!v2) || (!(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":"05d656f42ae3340aa33915ee81a49e54b256cd79da55c1c28f5aa68847ea1a3e","bytes":879},"Proof.lean":{"sha256":"d2f32e9acfaa6ac540f7ac0193ae623657a32ea7f187004d63ffdec107a62ecc","bytes":526},"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."},{"slug":"formal-loop-halting-guarantee","identifier":"formal-loop-halting-guarantee","title":"Loop Halting Guarantee","author":"Maclain Hunter","sourceSha256":"d317154a15be0a16f2474591c1599951ad98b9d245112b7223256dcb541b2125","sourceKind":"formal-theorem","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:00.848Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.fuel_iteration_bound"],"units":[{"id":"fuel_iteration_bound","sourceStatement":"Formal statement: ∀config.maxDepth ∈ ℕ⁺: mcbLoop terminates in ≤ maxDepth iterations","sourceOffset":0,"scope":"For every total transform, including early stopping, the finite-fuel loop executes at most maxDepth steps. This checks the mathematical counter argument, not termination of uninstrumented external callbacks.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def iterations {α : Type} (step : α → Option α) : Nat → α → Nat\n  | 0, _ => 0\n  | n + 1, s =>\n    match step s with\n    | none => 0\n    | some t => iterations step n t + 1\ntheorem fuel_iteration_bound {α : Type} (step : α → Option α) (fuel : Nat) (s : α) :\n    iterations step fuel s ≤ fuel := by\n  induction fuel generalizing s with\n  | zero => exact Nat.le_refl 0\n  | succ n ih =>\n    cases h : step s with\n    | none =>\n      unfold iterations\n      rw [h]\n      exact Nat.zero_le (n + 1)\n    | some t =>\n      unfold iterations\n      rw [h]\n      exact Nat.succ_le_succ (ih t)\n#print axioms fuel_iteration_bound\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.fuel_iteration_bound"}],"files":{"source.json":{"sha256":"c430dff91f1aba85eb6679448eb94e98d174564bbdf1cd724080bebe1e581af5","bytes":810},"Proof.lean":{"sha256":"ff0d70c43a9fce17354d249964f0a81725e294136a3777b6f6072a31b92c7fd0","bytes":908},"lean-check.txt":{"sha256":"9096c4d806192c9875376efa6b2842e1689d432f5ee068607e3a457098db70b6","bytes":124}},"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."},{"slug":"archived-q1060-9bca977c1c26","identifier":"archived-q1060-9bca977c1c26","title":"Loop Halting Guarantee","author":"Maclain Hunter","sourceSha256":"9bca977c1c264cbc7b860f19a086650304fa6c7c8495d1566b6cafb552eba3dd","sourceKind":"archived-authored-source","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:01.752Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.fuel_iteration_bound"],"units":[{"id":"fuel_iteration_bound","sourceStatement":"{\n  \"name\": \"Loop Halting Guarantee\",\n  \"formal\": \"∀config.maxDepth ∈ ℕ⁺: mcbLoop terminates in ≤ maxDepth iterations\",\n  \"proof\": \"Strictly increasing counter bounded by finite maxDepth\",\n  \"implementation\": \"mcbLoop(initial, transform, config): MCBComputationUnit[]\"\n}","sourceOffset":0,"scope":"For every total transform, including early stopping, the finite-fuel loop executes at most maxDepth steps. This checks the mathematical counter argument, not termination of uninstrumented external callbacks.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def iterations {α : Type} (step : α → Option α) : Nat → α → Nat\n  | 0, _ => 0\n  | n + 1, s =>\n    match step s with\n    | none => 0\n    | some t => iterations step n t + 1\ntheorem fuel_iteration_bound {α : Type} (step : α → Option α) (fuel : Nat) (s : α) :\n    iterations step fuel s ≤ fuel := by\n  induction fuel generalizing s with\n  | zero => exact Nat.le_refl 0\n  | succ n ih =>\n    cases h : step s with\n    | none =>\n      unfold iterations\n      rw [h]\n      exact Nat.zero_le (n + 1)\n    | some t =>\n      unfold iterations\n      rw [h]\n      exact Nat.succ_le_succ (ih t)\n#print axioms fuel_iteration_bound\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.fuel_iteration_bound"}],"files":{"source.json":{"sha256":"01532e458d0ac14e843952dc2e2c9d75f9e500dfef4d5b702445e998d30d6bdd","bytes":834},"Proof.lean":{"sha256":"0bab853d8d9aee9d874e1492cdfe9fa1fa10e5965f61e313859442effdb03e02","bytes":908},"lean-check.txt":{"sha256":"9096c4d806192c9875376efa6b2842e1689d432f5ee068607e3a457098db70b6","bytes":124}},"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."},{"slug":"hunter-mspp-original-design","identifier":"hunter-mspp-original-design","title":"Machine Semantics Programming Platform Designed by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"7708862fbb4faeed369931fa1c0cc59ea96b840fad81ec6702e4197cbfebf3d0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:22:45.308Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:02.706Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= ((P & Q) -> (R & S)) -> T","sourceOffset":3044,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"((P & Q) -> (R & S)) -> T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || ((!((!(v0 && v1)) || (v2 && v3))) || v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P, Q, R, S, T, U} |= U -> (((P & Q) & (R & S)) & T)","sourceOffset":3469,"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","T","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"U -> (((P & Q) & (R & S)) & T)","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || ((!v5) || (((v0 && v1) && (v2 && v3)) && v4))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"a4105c7472eb3650f61e13e94a4139575176a6fb78d1a8559695bdf24cf2ad68","bytes":6953},"Proof.lean":{"sha256":"ec1a628ec57dfb1e452740db76569b019f232612f317f5a7a4c872bf375eb580","bytes":885},"lean-check.txt":{"sha256":"9dd24ecb3d82c309e42e8e914b5df3ec490fd2259644de7d887fca9eeff5dfe5","bytes":174}},"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."},{"slug":"hunter-on-monads","identifier":"hunter-on-monads","title":"Maclain Hunter on Monads","author":"Maclain Hunter","sourceSha256":"3207637d827abc163cd406c4a45ef729e468a484d4b696971aeefcf942ffbff9","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:57:51.702Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:03.590Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (S -> R) -> (Q -> P)","sourceOffset":909,"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":"(S -> R) -> (Q -> P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3))) || ((!((!v3) || v2)) || ((!v1) || v0))) = 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"}],"files":{"source.json":{"sha256":"a3ee3d7142ad84f2541599c8808c1086e9a48f5a096622cb4626280f35b9f41c","bytes":4576},"Proof.lean":{"sha256":"f666dd9c6b82a685a3a16dbb9dcc3f29b694ca9c57ee6934801ebabdca09774e","bytes":527},"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."},{"slug":"hunter-rules-logic-received-copy","identifier":"hunter-rules-logic-received-copy","title":"Maclain Hunter on the Rule(s) of Logic — Full Supplied Copy","author":"Maclain Hunter","sourceSha256":"707c4b3984ce0ea522dba2757bfa7e8dda4043d48f14992b36bc297d799aa47e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:11.297Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:04.467Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> P, P <-> ~Q} |= P & ~Q","sourceOffset":3275,"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"],"premises":["P","P <-> P","P <-> ~Q"],"conclusion":"P & ~Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && (v0 == v0)) && (v0 == (!v1)))) || (v0 && (!v1))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P, P -> Q} |= P and it leads to logical contradiction. It amounts to saying Logic is “not Logic” which is not Logic (Valid Order and Reasoning). To assume God (Logos) is not God (Logic) would mean that God’s output (Reality - All Existence) is not Reality (what Logic entails).","sourceOffset":3353,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \". It amounts to saying Logic is “not Logic” w\"","kernelStatus":"not_checked"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":322,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"249a88f8114b5d46a4f58f73f9b2aaa2e6d3cb4d298a3116a7052186b9c67a10","bytes":5316},"Proof.lean":{"sha256":"ebd547bf3977c287acc7d04d733d29d5b8a7aa3359174595ec5275682e8b7bea","bytes":589},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-mastery-self-reference","identifier":"hunter-mastery-self-reference","title":"Mastery of Self-Reference by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"40583771ea7e8a1a952acbdd2df7636a121a0d95f5371ba0717b4b46356974d0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T17:12:57.899Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:05.417Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T, T <-> U} |= (((P & Q) & (R & S)) & T) & U","sourceOffset":8026,"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","T","U"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T","T <-> U"],"conclusion":"(((P & Q) & (R & S)) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4)) && (v4 == v5))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"4f6aa3d6baee88f0dc4cd46cf013ba245098558c9f3e553aa4b0bc4079b19c16","bytes":14841},"Proof.lean":{"sha256":"2e61098bcfef894172c595cf5c25d375be246aff3a2fb95a0c49ee6d9203abb8","bytes":608},"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."},{"slug":"hunter-materialism-nihilism","identifier":"hunter-materialism-nihilism","title":"Materialism and Nihilism","author":"Maclain Hunter","sourceSha256":"228c4434a7b498de8636bb38f7435864538346fff1efbae50fcc2ce411d245a7","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:50.725Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:06.257Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q} |= P & Q","sourceOffset":260,"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"],"premises":["P","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"005c8842ce45c6a1a757a3856497e62965c2da5de8303a56b0bd24f6411eab30","bytes":840},"Proof.lean":{"sha256":"626936756860790ecee77bcf8a90d02f95eff1a69054cb891bb5de2e138c8089","bytes":421},"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."},{"slug":"formal-mcb-decidability","identifier":"formal-mcb-decidability","title":"MCB Decidability","author":"Maclain Hunter","sourceSha256":"9333dc350ef91ebc490ba0a42fcb28d574932b02b6e6c8e370b1a47ca8861da6","sourceKind":"formal-theorem","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:07.124Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.integer_parity_range"],"units":[{"id":"integer_parity_range","sourceStatement":"Formal statement: ∀n ∈ ℤ: (-1)^n ∈ {+1, -1}","sourceOffset":0,"scope":"Unbounded integer parity-defined signed power has exactly the authored two-state range. The integer-exponent realization is explicitly defined in the Lean file.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def signedIntegerPower (n : Int) : Int := if n % 2 = 0 then 1 else -1\ntheorem integer_parity_range (n : Int) :\n    signedIntegerPower n = 1 ∨ signedIntegerPower n = -1 := by\n  unfold signedIntegerPower\n  by_cases h : n % 2 = 0\n  · rw [if_pos h]; exact Or.inl rfl\n  · rw [if_neg h]; exact Or.inr rfl\n#print axioms integer_parity_range\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.integer_parity_range"}],"files":{"source.json":{"sha256":"ad6b011f4e51db06bec2f8ffbcb45f94cac5043cdc89276f0a4d022d5c363cab","bytes":666},"Proof.lean":{"sha256":"0ffb7238f483be2ced69d656bb30ee15040d53a555b6366eb7062207135584ac","bytes":606},"lean-check.txt":{"sha256":"223055b62b3382edf511057c4c16cd58665c9a70de58a65b3790eb62a782ac24","bytes":124}},"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."},{"slug":"archived-q1053-d62a2a92c96c","identifier":"archived-q1053-d62a2a92c96c","title":"MCB Decidability","author":"Maclain Hunter","sourceSha256":"d62a2a92c96cc26d04abb582b6443e4c54ad6e39c15684689418646741813d8d","sourceKind":"archived-authored-source","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:08.032Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.integer_parity_range"],"units":[{"id":"integer_parity_range","sourceStatement":"{\n  \"name\": \"MCB Decidability\",\n  \"formal\": \"∀n ∈ ℤ: (-1)^n ∈ {+1, -1}\",\n  \"proof\": \"By case analysis on parity of n\",\n  \"implementation\": \"paritySign(n: number): MCBState\"\n}","sourceOffset":0,"scope":"Unbounded integer parity-defined signed power has exactly the authored two-state range. The integer-exponent realization is explicitly defined in the Lean file.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def signedIntegerPower (n : Int) : Int := if n % 2 = 0 then 1 else -1\ntheorem integer_parity_range (n : Int) :\n    signedIntegerPower n = 1 ∨ signedIntegerPower n = -1 := by\n  unfold signedIntegerPower\n  by_cases h : n % 2 = 0\n  · rw [if_pos h]; exact Or.inl rfl\n  · rw [if_neg h]; exact Or.inr rfl\n#print axioms integer_parity_range\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.integer_parity_range"}],"files":{"source.json":{"sha256":"1c1c37238c59213e7c31731e6f41c19e8795a21095684c2b7fa55a60e35f9dab","bytes":730},"Proof.lean":{"sha256":"413e09a0bb3b73382bc892e945e97015c416c7b57940aa1dc71b160e68f0df99","bytes":606},"lean-check.txt":{"sha256":"223055b62b3382edf511057c4c16cd58665c9a70de58a65b3790eb62a782ac24","bytes":124}},"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."},{"slug":"hunter-mcb-router-exact-design","identifier":"hunter-mcb-router-exact-design","title":"MCB Logic Router API Design — Exact Supplied Copy","author":"Maclain Hunter","sourceSha256":"0b601ef5297429a128dc7f9ced0029f1be9c00121dff37eb4d0f3fd0e92040f6","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:22:48.814Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:08.926Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= T -> ((S -> R) -> (Q -> P))","sourceOffset":871,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"T -> ((S -> R) -> (Q -> P))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || ((!v4) || ((!((!v3) || v2)) || ((!v1) || v0)))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"5e7a4369e42e3f251b29a1a4d7a2cc1e1ac8741e8472a5538cbf777dfd60f75c","bytes":1546},"Proof.lean":{"sha256":"1ea86da936ccd339e660edd96324351ee05ac34529c100743d62ceab0f8b7168","bytes":600},"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."},{"slug":"hunter-mcb-server-code","identifier":"hunter-mcb-server-code","title":"MCB Server, Processor, AI, NN, Infinite Range Code","author":"Maclain Hunter","sourceSha256":"049f1ccf7e0220018812361dca48540034dc0b0d7268834336297b0e69613aa0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:22:46.012Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:08.928Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"0b74496356c18a9a2a77631fe901dabc448b3319a233027d6a0592aff6d94091","bytes":19551},"Proof.lean":{"sha256":"b1d283ecded77148d6450c4f61a1903e33ef22f169f594ffcfd93050445ba8d6","bytes":302},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"formal-mcb-state-exclusivity","identifier":"formal-mcb-state-exclusivity","title":"MCB State Exclusivity","author":"Maclain Hunter","sourceSha256":"9ee9a78ac523714ae7337c240149771877a520e32c554da421b750ea24799cb6","sourceKind":"formal-theorem","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:09.799Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.signed_state_exclusivity"],"units":[{"id":"signed_state_exclusivity","sourceStatement":"Formal statement: S ≝ {+1, -1}, |S| = 2","sourceOffset":0,"scope":"Exact two-state encoding of the declared MCB state set. No Boolean assignment supplies semantic premise truth.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"theorem signed_state_exclusivity (b : Bool) :\n    (if b then (1 : Int) else -1) = 1 ∨ (if b then (1 : Int) else -1) = -1 := by\n  cases b\n  · exact Or.inr rfl\n  · exact Or.inl rfl\n#print axioms signed_state_exclusivity\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.signed_state_exclusivity"}],"files":{"source.json":{"sha256":"c09077997c14fdfa3a8c4629093faa156abd935ceaefaa103b7f3b93525e6e61","bytes":585},"Proof.lean":{"sha256":"baeb10fea3cff93eb1cfb014665308b58ec2c6c1383606289eab2bce4d633abf","bytes":495},"lean-check.txt":{"sha256":"47064604d69b288f9ef599276db709e440b301f51d7df8fdbb4dc1eb3299fe3f","bytes":128}},"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."},{"slug":"archived-q1052-110d3af511c6","identifier":"archived-q1052-110d3af511c6","title":"MCB State Exclusivity","author":"Maclain Hunter","sourceSha256":"110d3af511c6be0e7c2dcfbdabecfd736a96fd0988e6a43615f8dd3290115037","sourceKind":"archived-authored-source","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:10.644Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.signed_state_exclusivity"],"units":[{"id":"signed_state_exclusivity","sourceStatement":"{\n  \"name\": \"MCB State Exclusivity\",\n  \"formal\": \"S ≝ {+1, -1}, |S| = 2\",\n  \"implication\": \"Zero is excluded from valid MCB states\",\n  \"fourPMapping\": \"Zero would map to Nothing (S), which is unreachable\"\n}","sourceOffset":0,"scope":"Exact two-state encoding of the declared MCB state set. No Boolean assignment supplies semantic premise truth.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"theorem signed_state_exclusivity (b : Bool) :\n    (if b then (1 : Int) else -1) = 1 ∨ (if b then (1 : Int) else -1) = -1 := by\n  cases b\n  · exact Or.inr rfl\n  · exact Or.inl rfl\n#print axioms signed_state_exclusivity\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.signed_state_exclusivity"}],"files":{"source.json":{"sha256":"260845533c174196bd59b9116926077ba105ab93a5299543bbe3f65e7f4902a1","bytes":761},"Proof.lean":{"sha256":"21d484df2cb83530470fca34342af6c5f90af0755d45d1cc3efbeaccdde46407","bytes":495},"lean-check.txt":{"sha256":"47064604d69b288f9ef599276db709e440b301f51d7df8fdbb4dc1eb3299fe3f","bytes":128}},"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."},{"slug":"hunter-metaphysical-ground","identifier":"hunter-metaphysical-ground","title":"Metaphysical Ground and Questioning","author":"Maclain Hunter","sourceSha256":"d0d9b174b9cff89c3c1a195e81f4adce0bcf603d9db9dbb6dcfd2430423606f6","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T22:14:07.908Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:10.646Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P, Q, Q -> P, R, Q -> R} |= ((P & Q) -> R) <-> ((R -> (P <-> Q))","sourceOffset":387,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"7512dc7e34aa1d0fbe869c4b6eb2bd34ea7974d1a607dda0e6543fa1c757ebb0","bytes":1452},"Proof.lean":{"sha256":"290ee08a23438403b268836ba90ed32813a438c71301f67fa7ffdaf3d6831b16","bytes":287},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-metaphysics-ontology-ground","identifier":"hunter-metaphysics-ontology-ground","title":"Metaphysics and Ontological Ground","author":"Maclain Hunter","sourceSha256":"933a5d48a5307d6d55eb54ba7006333efb551a070a4944cb55be3ad4e3bd1be7","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:00.464Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:11.519Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, Q -> P} |= Q -> (P & ~~P)","sourceOffset":242,"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"],"premises":["P","Q","Q -> P"],"conclusion":"Q -> (P & ~~P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && v1) && ((!v1) || v0))) || ((!v1) || (v0 && (!(!v0))))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"3755421cbf6a1ab654590dd33c7bb618d041d8037e59a6e341ee042e76f645ba","bytes":863},"Proof.lean":{"sha256":"f45bed01f9792f584cf7877c28cd56c8242aa2a515c80599fe5dc788e85437ff","bytes":467},"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."},{"slug":"hunter-logos-modal-tautological-argument","identifier":"hunter-logos-modal-tautological-argument","title":"Modal Proof of Logos and the Tautological Argument","author":"Maclain Hunter","sourceSha256":"7a45b01009b146831ec0924f2e112f44c04e16232f231f0ed5fd887ba325eadf","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:08.067Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:11.522Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"d99630c77d6f31686d012c2206f219724dca5209294a692bfa23c2e3d24bbbae","bytes":2376},"Proof.lean":{"sha256":"2613d92b457fb76e1f5687631760c3c6c23692e0cb8b3f65ba6e49f5d7d40c9c","bytes":302},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-modal-space-reality","identifier":"hunter-modal-space-reality","title":"Modal Space and Reality","author":"Maclain Hunter","sourceSha256":"5614b464ae26077dbbdc259d0758d40f0a7bd27a5052e828fdd69f1ab2adc023","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:43.188Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:12.429Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, Q -> R, R -> S, S -> P, (S & P) -> T} |= S -> (P & T)","sourceOffset":797,"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","T"],"premises":["P","Q","Q -> R","R -> S","S -> P","(S & P) -> T"],"conclusion":"S -> (P & T)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!(((((v0 && v1) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v0)) && ((!(v3 && v0)) || v4))) || ((!v3) || (v0 && v4))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"19840dce98dba786a8e69603898da717e957e49be1bedd3e76d27071e28c7845","bytes":2715},"Proof.lean":{"sha256":"89cc920381eddf1f902b292b1ee852480b3a1f970ca849a3f3dd4e1bb5142c72","bytes":563},"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."},{"slug":"hunter-modus-ponens-tollens-logos","identifier":"hunter-modus-ponens-tollens-logos","title":"Modus Ponens, Modus Tollens, and Logos by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"8183a20a4b8d70ffaf6337104bd7fb1f6f91e2ec84b873772207c3b4d8bf991a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:02.079Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:18.313Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T, T <-> U} |= ((P & Q) & (R & S) & T) & U","sourceOffset":2784,"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","T","U"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T","T <-> U"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4)) && (v4 == v5))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"3c4964fe029ff7ba309c725be24a74ede448a50a7bdb95771c23c13a192116ac","bytes":5506},"Proof.lean":{"sha256":"8549ee4d6d6d80575528f7f95b3725490fe92579f4036f11f56b5e9db3c6e6d6","bytes":621},"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."},{"slug":"hunter-morality-nonexistence","identifier":"hunter-morality-nonexistence","title":"Morality and Its Denial","author":"Maclain Hunter","sourceSha256":"4fae2f06fd73bf498f7f05ad44eb045929d91f2049e5df8f90bc64af38b5a248","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:13.569Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:26.606Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q} |= P & Q","sourceOffset":218,"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"],"premises":["P","P -> Q","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"2a68e1dbf113588cbe617dedd0e705c9febfdc9310d4094af374fce1c09c62b8","bytes":808},"Proof.lean":{"sha256":"8dcc61be29042cd5bb56dfc7b9d48a68caaf6d184f034f9c1933a8733501b523","bytes":439},"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."},{"slug":"hunter-morality-is-divine","identifier":"hunter-morality-is-divine","title":"Morality is Divine by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"216662e5e94a2f21f51fc9eb7bb63e51bcfd3822004a8690f106f9c0e154058a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:57:30.519Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:27.535Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T} |= ((P & Q) & (R & S)) & T","sourceOffset":3631,"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","T"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T"],"conclusion":"((P & Q) & (R & S)) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4))) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"25938504d6bc354458becfd638fb00cf24451601ee7522a2f75889ad234a3cc2","bytes":6651},"Proof.lean":{"sha256":"747c51e4c2979044a1423b0ce7f51bf7972d1645b6c06a24f5569b9fe08e6faf","bytes":561},"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."},{"slug":"hunter-my-credo","identifier":"hunter-my-credo","title":"My Credo by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"1085424dc8e45783010cb9074b3b0757a13eb44df54073ad4d0a2d00e8494951","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:00:05.685Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:28.453Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{A, B, C, D} |= ((C <-> B) <-> A) -> D","sourceOffset":10737,"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","B","C","D"],"conclusion":"((C <-> B) <-> A) -> D","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && v2) && v3)) || ((!((v2 == v1) == v0)) || 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":"source_identity_rule","sourceStatement":"Logic is Logic","sourceOffset":706,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"01ff2c78a86b22dd036731e4c317a64d6ae2aaae21e975bc762ca5f800a6507e","bytes":18301},"Proof.lean":{"sha256":"82ae0eea16d4ec72cccb41c9804adbceee7cb05320c89df60f6266123c9c70e8","bytes":591},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-myth-truth-foundational-coherence","identifier":"hunter-myth-truth-foundational-coherence","title":"Myth, Truth, and the Coherent Foundation of Reality","author":"Maclain Hunter","sourceSha256":"214415ae3e0c9253648cd0bd62e492d3697b8a947512e198808dbc007b8b1e6f","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:11.576Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:29.378Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> ~R} |= (P & Q) & ~R","sourceOffset":671,"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","Q <-> ~R"],"conclusion":"(P & Q) & ~R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v0 == v1)) && (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":"c5edfb379afb6d418772735f3abad1d1a0357d8c63773df3f7cc99d0ebcd52ef","bytes":1789},"Proof.lean":{"sha256":"aee3f39fcac9c8bd55c4345412152a1559293d6548f87cd40638c2a5b93f0e25","bytes":502},"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."},{"slug":"hunter-natural-creation-logical-order","identifier":"hunter-natural-creation-logical-order","title":"Natural Creation, Law, and Cause — Logical Order","author":"Maclain Hunter","sourceSha256":"9aa6de04cc79c2b14f507870905acc70c15bc54de72653cff290eef9ebf17617","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:22.564Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:30.456Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{1, 1 -> 2, 2 -> 3, 3 -> 4, 4 -> 5} |= ((1 & 2) -> (3 & 4)) -> 5","sourceOffset":3298,"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":["1","2","3","4","5"],"premises":["1","1 -> 2","2 -> 3","3 -> 4","4 -> 5"],"conclusion":"((1 & 2) -> (3 & 4)) -> 5","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || ((!((!(v0 && v1)) || (v2 && v3))) || v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":1349,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"5bc74f2155901334f8fee4e07cdba143a69f8c92aec94e63e1c3e668218f5adc","bytes":6082},"Proof.lean":{"sha256":"f5964a88928bbff6ef977e640f32d3d378b9db4032d61d9dae15a2e76d10046d","bytes":694},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-necessary-correctness-logical-proof","identifier":"hunter-necessary-correctness-logical-proof","title":"Necessary Correctness and Logical Proof","author":"Maclain Hunter","sourceSha256":"3920c930e149b4e496bd7af65a136466b30b514fb41c0841460a5ce4e6ad7323","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:26.380Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:31.454Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, P <-> R, Q, Q -> P, P, Q -> R, R, R -> S, T} |= (P & Q) & (R & S) & T","sourceOffset":2107,"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","T"],"premises":["P","P <-> Q","P <-> R","Q","Q -> P","P","Q -> R","R","R -> S","T"],"conclusion":"(P & Q) & (R & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!(((((((((v0 && (v0 == v1)) && (v0 == v2)) && v1) && ((!v1) || v0)) && v0) && ((!v1) || v2)) && v2) && ((!v2) || v3)) && v4)) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"ea2f0c64095ececadd92d1cb5183fdcd1a7671dd3cfddbeb39e770fd33001103","bytes":5753},"Proof.lean":{"sha256":"efe2ad7fb75b829ba8f0bc07b58a8b80ced3a687e3926df50b27c287fa77924d","bytes":621},"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."},{"slug":"hunter-necessary-entailment","identifier":"hunter-necessary-entailment","title":"Necessary Entailment by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"7e101488b48dd99fff8e338b62c9bb1063d1a010bcb693cfe3635a8de298b990","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:42:14.750Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:32.439Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{MP, MP <-> RP, RP <-> G, G <-> G, G} |= ((MP <-> RP) & (MP & RP)) & G","sourceOffset":1741,"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":["G","MP","RP"],"premises":["MP","MP <-> RP","RP <-> G","G <-> G","G"],"conclusion":"((MP <-> RP) & (MP & RP)) & G","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((((v1 && (v1 == v2)) && (v2 == v0)) && (v0 == v0)) && v0)) || (((v1 == v2) && (v1 && v2)) && v0)) = 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"},{"id":"inference_2","sourceStatement":"{MP, MP <-> RP, MP <-> MB, RP <-> RB, MB <-> RB, MB <-> RP, MP <-> RB, MP <-> RP, RP <-> C, MP <-> C, C <-> G, G <-> G, MP, MB, RP, RB, C, G} |= (((MP & RP) & (MB & RB)) & C) & G","sourceOffset":1980,"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":["C","G","MB","MP","RB","RP"],"premises":["MP","MP <-> RP","MP <-> MB","RP <-> RB","MB <-> RB","MB <-> RP","MP <-> RB","MP <-> RP","RP <-> C","MP <-> C","C <-> G","G <-> G","MP","MB","RP","RB","C","G"],"conclusion":"(((MP & RP) & (MB & RB)) & C) & G","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((((((((((((((v3 && (v3 == v5)) && (v3 == v2)) && (v5 == v4)) && (v2 == v4)) && (v2 == v5)) && (v3 == v4)) && (v3 == v5)) && (v5 == v0)) && (v3 == v0)) && (v0 == v1)) && (v1 == v1)) && v3) && v2) && v5) && v4) && v0) && v1)) || ((((v3 && v5) && (v2 && v4)) && v0) && v1)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":1626,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"01f2189751813e38b68e616cad7f6823b262be331579d073c450d4e9c7385800","bytes":3517},"Proof.lean":{"sha256":"2bc4106aa4210f762b50eadc54e783f6545e4bf9fa44e8e4936921cae95c7095","bytes":1082},"lean-check.txt":{"sha256":"40b7da001d5d78d36b6960c8ae1b7c13a2ea6cf5f9da51ea55e40e490d78ea16","bytes":242}},"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."},{"slug":"hunter-necessary-logic-existence","identifier":"hunter-necessary-logic-existence","title":"Necessary Logic and Logical Existence","author":"Maclain Hunter","sourceSha256":"89ae745bd8d488e6891f28f647d148db2e2c5e1be5a90be8e339d57add5278dd","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:18.115Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:33.433Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S, T, U, V} |= ((P & Q) & (R & S) & T) & U","sourceOffset":2115,"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","T","U","V"],"premises":["P","Q","R","S","T","U","V"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 v6 : Bool) :\n    ((!((((((v0 && v1) && v2) && v3) && v4) && v5) && v6)) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> cases v6 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Logos is Logos","sourceOffset":1991,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"9958a1f46106403f27f5bbdbd71a9f2f6b6309b5f7c0088fc2e7effe338d594f","bytes":3389},"Proof.lean":{"sha256":"08a4968f15aff28d9c5611d6fe89368aafff9b34b4a41157325474733923772e","bytes":687},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-negation-of-prior-order","identifier":"hunter-negation-of-prior-order","title":"Negation of Prior Order by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"8daa685328c98fdf8a4cce51dd9763b33914339620750c73bdb5b5ef6f25f877","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:41:36.233Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:34.305Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":3620,"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":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":4386,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"d15896600f61331569f361d9ec0ec7662478553ed84ff96b0c0b5de8e252f24e","bytes":6590},"Proof.lean":{"sha256":"ca99a733a618358ec24e32310b891f96ca60dbe871ea92c2bf3fcca258a93a0c","bytes":627},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"negation-identity-logos-proof","identifier":"negation-identity-logos-proof","title":"Negation, Identity, and Logos by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"5df940f97f0269418a4c17f0c1de664ac22380fa19f0adc70470d110e22d84fd","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T14:05:43.168Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:35.292Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.inference_3","HunterAuthored.inference_4","HunterAuthored.inference_5","HunterAuthored.inference_6","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{A} |= A","sourceOffset":58,"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"],"premises":["A"],"conclusion":"A","status":"candidate","leanStatement":"theorem inference_1 (v0 : Bool) :\n    ((!v0) || v0) = true := by\n  cases v0 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P, D1, D2} |= (P <-> D1) & D2","sourceOffset":1098,"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":["D1","D2","P"],"premises":["P","D1","D2"],"conclusion":"(P <-> D1) & D2","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 : Bool) :\n    ((!((v2 && v0) && v1)) || ((v2 == v0) && v1)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{P, D1, D2, A1} |= (P <-> D1) <-> (D1 <-> A1)","sourceOffset":2100,"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":["A1","D1","D2","P"],"premises":["P","D1","D2","A1"],"conclusion":"(P <-> D1) <-> (D1 <-> A1)","status":"candidate","leanStatement":"theorem inference_3 (v0 v1 v2 v3 : Bool) :\n    ((!(((v3 && v1) && v2) && v0)) || ((v3 == v1) == (v1 == v0))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_3\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_3"},{"id":"inference_4","sourceStatement":"{A2 <-> PC} |= (A2 <-> PC)","sourceOffset":2379,"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":["A2","PC"],"premises":["A2 <-> PC"],"conclusion":"(A2 <-> PC)","status":"candidate","leanStatement":"theorem inference_4 (v0 v1 : Bool) :\n    ((!(v0 == v1)) || (v0 == v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_4\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_4"},{"id":"inference_5","sourceStatement":"{P, Q, R, S, T, U} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":6315,"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","T","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_5 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_5\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_5"},{"id":"inference_6","sourceStatement":"{MP, MP -> RA} |= MP <-> RA","sourceOffset":6599,"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":["MP","RA"],"premises":["MP","MP -> RA"],"conclusion":"MP <-> RA","status":"candidate","leanStatement":"theorem inference_6 (v0 v1 : Bool) :\n    ((!(v0 && ((!v0) || v1))) || (v0 == v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_6\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_6"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":76,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"ea553364f3fbee841c5222cbafdc6e21997dbed8600976ef7eec4a4a3245f61b","bytes":7363},"Proof.lean":{"sha256":"a897a0d79ba2d9ef792cbd3a233c1e9101842bd30e7f20657e8f1feb68012544","bytes":1478},"lean-check.txt":{"sha256":"8d10e8ef59cd84923d19a15a272cf84d14408167f8321716e8c2796044caf886","bytes":478}},"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."},{"slug":"hunter-nested-structure","identifier":"hunter-nested-structure","title":"Nested Structure by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"d7afa529455ee6e3132d061dd4b9bee152e9925171931709a91b55e986e5dcc2","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:58:04.560Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:36.201Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"source_identity_rule","sourceStatement":"Logic is Logic","sourceOffset":64,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"757a829fff4d675dc8ec2d946d501e524f90df29db7a2c8427e3df95e60cf895","bytes":2664},"Proof.lean":{"sha256":"deb0c8de89c14abd6b3af7071d4ec0212917e5c55686e1b25952c678dfe8e66c","bytes":386},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-no-alternative-logos","identifier":"hunter-no-alternative-logos","title":"No Logical Alternative to Logos","author":"Maclain Hunter","sourceSha256":"8cd7d1ec8bebc0c3b09d5ed949883be86754b5d1be29380d9ae16bee9f063eec","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:02.130Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:37.065Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q <-> R} |= (R -> P) -> Q","sourceOffset":240,"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","Q <-> R"],"conclusion":"(R -> P) -> Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && (v1 == v2))) || ((!((!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":"5119f989f35a86e2707c6a98198dfa18c93f741c178a03c8faf40db65388f660","bytes":873},"Proof.lean":{"sha256":"4179eec9374584e62072f936b01f9b0c95924608140de867f389d08bca807581","bytes":485},"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."},{"slug":"hunter-no-one-is-truly-gone","identifier":"hunter-no-one-is-truly-gone","title":"No One Is Truly Gone by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"d5da913d53c8bbdb476d5da243180fdc9e5b5cb42e6d8fde0feb8c8b850a7bda","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:20:46.732Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:37.973Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S, T, P -> Q, Q -> R, R -> S, S -> T} |= T -> ((P & Q) <-> (R & S))","sourceOffset":3212,"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","T"],"premises":["P","Q","R","S","T","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"T -> ((P & Q) <-> (R & S))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((((((v0 && v1) && v2) && v3) && v4) && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || ((!v4) || ((v0 && v1) == (v2 && v3)))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":1233,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"3198dc798d0309e3eb9ab2b46db65f4980026bd21a2337d637119b50349f79fa","bytes":7141},"Proof.lean":{"sha256":"8e7132587c1b1312f46e394180950da8d7c48cefac7045b27a20414398d2da8b","bytes":711},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-no-true-scotsman-ground","identifier":"hunter-no-true-scotsman-ground","title":"No True Scotsman and Axiomatic Ground","author":"Maclain Hunter","sourceSha256":"fbfc46b8a4aade4a2d43d6919b5adf909ecc89a474d0f6c40c33912d948867b1","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:18.855Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:38.862Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{(P & Q) -> R} |= (P & Q) -> 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","Q","R"],"premises":["(P & Q) -> R"],"conclusion":"(P & Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((!(v0 && 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":"467968f71796b6ab04db7a45732d271d53e3578d5ba265b7e7a38ccc2a64c214","bytes":862},"Proof.lean":{"sha256":"8b50003609cee7beff8e54bd1dabbbf08de5737af59e5fffbb4a254928cf8afe","bytes":472},"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."},{"slug":"formal-not-involution","identifier":"formal-not-involution","title":"NOT Involution","author":"Maclain Hunter","sourceSha256":"1fa7c3de4106820c0a6ab68bf9f1d2c299422dfd346cdbc83ddb891ba1247c22","sourceKind":"formal-theorem","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:39.724Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.negation_value_involution"],"units":[{"id":"negation_value_involution","sourceStatement":"Formal statement: ∀e ∈ MCBExponent: NOT(NOT(e)) = e","sourceOffset":0,"scope":"Exact authored value-level NOT involution for arbitrary integers. Host record metadata preservation is a separate implementation obligation.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"theorem negation_value_involution (value : Int) : -(-value) = value :=\n  Int.neg_neg value\n#print axioms negation_value_involution\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.negation_value_involution"}],"files":{"source.json":{"sha256":"ed6383a721206d0675650cc162df5ac638a7d3a4a35410ba382c6afb381fc784","bytes":674},"Proof.lean":{"sha256":"853c118cb8a0819f2b43d42270e8ed287e37e726bdfed5b4e4481eac95c2acf6","bytes":397},"lean-check.txt":{"sha256":"1afa795344f173ee8cf18fffb82fbaa4907347fe87a313d3cda5ae8976ac682b","bytes":129}},"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."},{"slug":"archived-q1054-9bc0dfbadc58","identifier":"archived-q1054-9bc0dfbadc58","title":"NOT Involution","author":"Maclain Hunter","sourceSha256":"9bc0dfbadc58a4fae979cab7188a0fafa6eb7a9eb409db67c2826627cd9b2737","sourceKind":"archived-authored-source","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:40.592Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.negation_value_involution"],"units":[{"id":"negation_value_involution","sourceStatement":"{\n  \"name\": \"NOT Involution\",\n  \"formal\": \"∀e ∈ MCBExponent: NOT(NOT(e)) = e\",\n  \"proof\": \"NOT(NOT(v)) = NOT(-v) = -(-v) = v\",\n  \"implementation\": \"mcbExponentNOT(a: MCBExponent): MCBExponent\"\n}","sourceOffset":0,"scope":"Exact authored value-level NOT involution for arbitrary integers. Host record metadata preservation is a separate implementation obligation.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"theorem negation_value_involution (value : Int) : -(-value) = value :=\n  Int.neg_neg value\n#print axioms negation_value_involution\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.negation_value_involution"}],"files":{"source.json":{"sha256":"ba485819a794255275abcb5188db668dbf2149ca3f74599bc387878d92b3d38a","bytes":744},"Proof.lean":{"sha256":"b4a8a7d774173b80daa3e39a922729ef9c7a52beb2a251e23aec97751c03709e","bytes":397},"lean-check.txt":{"sha256":"1afa795344f173ee8cf18fffb82fbaa4907347fe87a313d3cda5ae8976ac682b","bytes":129}},"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."},{"slug":"hunter-objective-perspective","identifier":"hunter-objective-perspective","title":"Objective Perspective by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"67bc28077039fea57e3eb033e750fe327587d2fe24ac6b4ea3a527feb1e64224","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:00:12.683Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:41.472Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q} |= P & Q","sourceOffset":686,"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"],"premises":["P","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"1dabb5fafacd0b33908d3628e797221c7e5c5952f34c0e8efbefbe305f6cefa1","bytes":1941},"Proof.lean":{"sha256":"400aa403ca3704e6e530cc2f56fdd9282f641c1df4434ca3a5242c7bacddaafe","bytes":436},"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."},{"slug":"hunter-objective-truth-god-dialogue","identifier":"hunter-objective-truth-god-dialogue","title":"Objective Truth and God — Question and Answer","author":"Maclain Hunter","sourceSha256":"179cb606bdb37a7c95794dc9fe25193627e4f1283772ed86c9f00650070a4ce9","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:31:53.171Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:41.474Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"8d6ee5ddac4192a049a8a230548bef87bcbfaea636475ce4a44b3418e98dccd7","bytes":2954},"Proof.lean":{"sha256":"0380dfa1a7026f9d4bb2feded44d54ed05403fed7728b12a8a652f3357756f61","bytes":299},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-observable-formal-proof-scientific-copy","identifier":"hunter-observable-formal-proof-scientific-copy","title":"Observable Formal Proof — Scientific-Test Version","author":"Maclain Hunter","sourceSha256":"3bef564bc8b81e60c38574e23830b6ce521193f9dbbe1424a61a4325d2c48316","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:37.937Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:42.352Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R <-> (P & Q)} |= (P & Q) & R","sourceOffset":193,"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 <-> (P & Q)"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && (v2 == (v0 && 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":"56ee9a7b442a2f850b9a4367052054710b36c050afce0fcdae12465c261a2334","bytes":896},"Proof.lean":{"sha256":"bc5866ce4a1fdad2785171ecdb12a7a06122974fbd94d1a63be73e4590651b27","bytes":496},"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."},{"slug":"hunter-observable-logic-source","identifier":"hunter-observable-logic-source","title":"Observable Logic and Its Source","author":"Maclain Hunter","sourceSha256":"108146949831e2d450688d603bd17e821d5697dd8ef526294c79c448cc466bd1","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T22:14:07.559Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:43.248Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q} |= P & Q","sourceOffset":223,"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"],"premises":["P","P <-> Q","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && (v0 == v1)) && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"5ba97ebf88bfb236c7618461eac4303a5b359574ea330dc259a1722a79abff55","bytes":855},"Proof.lean":{"sha256":"caaa913c0b6d8c4eafd792f4dd2b0e86d9530ff5a40ec15db30d7ad530a3bfc2","bytes":444},"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."},{"slug":"hunter-observable-logos-et","identifier":"hunter-observable-logos-et","title":"Observable Logos and the Defined ET","author":"Maclain Hunter","sourceSha256":"94b4d4022daed28e8d2e47bb76fbde6a346560c87a6f235f79945a58503aaece","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:47.539Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:44.141Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (P -> Q) -> R","sourceOffset":254,"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"],"conclusion":"(P -> Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && 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":"9126c9b6a8e87cb5333847b3391d7cebf1043875f8d22e43705a9283474fd1ea","bytes":865},"Proof.lean":{"sha256":"497ee68c14a2e9039e3b701e8588ed32d1ee7f5533fe30097d548318ad81649d","bytes":470},"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."},{"slug":"hunter-spinoza-axioms","identifier":"hunter-spinoza-axioms","title":"On Spinoza’s Axioms by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"537ab5eeea3e01df462a1c0697f8767ad89195410f7adb98bef180d67a9289c9","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:22:35.838Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:45.029Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P & Q, Q -> R, P <-> S} |= (S -> (P & Q)) -> R","sourceOffset":5140,"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","P <-> S"],"conclusion":"(S -> (P & Q)) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && (v0 && v1)) && ((!v1) || v2)) && (v0 == v3))) || ((!((!v3) || (v0 && v1))) || v2)) = 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":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":2775,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"c46a51fe83e4d2959b411ba02242afaf4299688df21b38ad1446da1e23c19374","bytes":6923},"Proof.lean":{"sha256":"932a379d6e8aa214f2e53d836b9fadced90d9d41409f3c10740a8ed6e76c9d86","bytes":634},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-on-logic-of-universe","identifier":"hunter-on-logic-of-universe","title":"On the Logic of the Universe","author":"Maclain Hunter","sourceSha256":"e65144a5922e6d76baf5b90b57966584834c36c4401f24a46473833140e8d429","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:21.866Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:45.897Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> P} |= (P & Q) & R","sourceOffset":18132,"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","Q -> R","R -> P"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v0))) || ((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"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":14323,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"2291bb5c840d33874c5c319891db8151aa4835996e46947872c6d9369650d406","bytes":27316},"Proof.lean":{"sha256":"184d1a83057e0047f2bed8e39bd679a42c56f69e399633af13f2739596c6807e","bytes":599},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-oneness-noncontradiction-notation","identifier":"hunter-oneness-noncontradiction-notation","title":"Oneness and the Proof of Non-Contradiction","author":"Maclain Hunter","sourceSha256":"b31f28733dbf63e0fcfec7a9ea5fbf01ce100a281f5304ff151c69fda359151a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:36.426Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:45.900Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"d88b46e4ce7faa625b7e322a1e9643e936c19997ab6fccbee74bf6a499a9243e","bytes":885},"Proof.lean":{"sha256":"666fc6f59ffb99fe73c35e1b7bc7f242c66dc354216ea576b1f0df8bf1b637b9","bytes":294},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-oneness-shared-reality","identifier":"hunter-oneness-shared-reality","title":"Oneness, Solipsism, and Shared Reality","author":"Maclain Hunter","sourceSha256":"e62c841178ed865d4bafcaaa520b661bfc77c5df6ac13402f8e8e00cea3773df","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:41.639Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:46.788Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (P -> Q) & (Q <-> R) & (Q -> R)","sourceOffset":234,"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"],"conclusion":"(P -> Q) & (Q <-> R) & (Q -> R)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && v2)) || ((((!v0) || v1) && (v1 == v2)) && ((!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":"1a210223ee725513552ef786bb8e6380ce5ad8c9fcba076d3f81ca35867c5041","bytes":861},"Proof.lean":{"sha256":"a198a324047ce87983a78d64a8b29316d3f74272b4ed42aa3d0a20c57c3d5356","bytes":497},"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."},{"slug":"hunter-ontology-coherent-theology","identifier":"hunter-ontology-coherent-theology","title":"Ontology and Coherent Theology","author":"Maclain Hunter","sourceSha256":"01a1f3e38defdf676df91cb0d734da214bc6659caf357e2d93b3b14b54512242","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:13.589Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:47.698Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, R} |= (P & Q) -> R","sourceOffset":250,"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"],"conclusion":"(P & Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || 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":"709d4e9d710a7dbdf3e6a418c3c3f0f42cc43e80ffba2c4dca0cb7d5f98588f6","bytes":861},"Proof.lean":{"sha256":"5d12e216c6c46aa2bb8b7519a71b73f402ea0bb4f1053cda68cb13bd1545d890","bytes":473},"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."},{"slug":"formal-or-commutativity-magnitude-distinct","identifier":"formal-or-commutativity-magnitude-distinct","title":"OR Commutativity (magnitude distinct)","author":"Maclain Hunter","sourceSha256":"f8adb9da481011e9f218974a409c94ed6c905eddd1691e67b560e0befa5f9151","sourceKind":"formal-theorem","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:48.702Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.distinct_magnitude_or_commutative"],"units":[{"id":"distinct_magnitude_or_commutative","sourceStatement":"Formal statement: ∀a,b ∈ MCBExponent, |a| ≠ |b|: OR(a,b) = OR(b,a)","sourceOffset":0,"scope":"Exact value selection by dominant integer magnitude with the authored first-operand tie behavior. The theorem retains the distinct-magnitude premise.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def dominantValue (a b : Int) : Int := if a.natAbs < b.natAbs then b else a\ntheorem distinct_magnitude_or_commutative (a b : Int) (distinct : a.natAbs ≠ b.natAbs) :\n    dominantValue a b = dominantValue b a := by\n  unfold dominantValue\n  cases Nat.lt_or_gt_of_ne distinct with\n  | inl h =>\n    rw [if_pos h, if_neg (Nat.not_lt_of_ge (Nat.le_of_lt h))]\n  | inr h =>\n    rw [if_neg (Nat.not_lt_of_ge (Nat.le_of_lt h)), if_pos h]\n#print axioms distinct_magnitude_or_commutative\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.distinct_magnitude_or_commutative"}],"files":{"source.json":{"sha256":"6c1b82aa2e0e0873c4b38fc18a8b7db4908e0b5acad499b28a0568fe22ce6e13","bytes":808},"Proof.lean":{"sha256":"b0c15317a2d9e62e23680b67fcc32fc49c6ec4b063f5a507e8855de82d151c35","bytes":766},"lean-check.txt":{"sha256":"5116ad4c433e048236e59be62f2dcb314a2a657cdb57bd38e0d255d32350c165","bytes":137}},"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."},{"slug":"archived-q1056-c468914d86f2","identifier":"archived-q1056-c468914d86f2","title":"OR Commutativity (magnitude distinct)","author":"Maclain Hunter","sourceSha256":"c468914d86f2d9feb2a549efb6c7ed74b22146a0392c5ce5968ba4ab325c4c9f","sourceKind":"archived-authored-source","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:49.711Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.distinct_magnitude_or_commutative"],"units":[{"id":"distinct_magnitude_or_commutative","sourceStatement":"{\n  \"name\": \"OR Commutativity (magnitude distinct)\",\n  \"formal\": \"∀a,b ∈ MCBExponent, |a| ≠ |b|: OR(a,b) = OR(b,a)\",\n  \"proof\": \"The dominant (larger magnitude) operand determines the result\",\n  \"implementation\": \"mcbExponentOR(a: MCBExponent, b: MCBExponent): MCBExponent\"\n}","sourceOffset":0,"scope":"Exact value selection by dominant integer magnitude with the authored first-operand tie behavior. The theorem retains the distinct-magnitude premise.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def dominantValue (a b : Int) : Int := if a.natAbs < b.natAbs then b else a\ntheorem distinct_magnitude_or_commutative (a b : Int) (distinct : a.natAbs ≠ b.natAbs) :\n    dominantValue a b = dominantValue b a := by\n  unfold dominantValue\n  cases Nat.lt_or_gt_of_ne distinct with\n  | inl h =>\n    rw [if_pos h, if_neg (Nat.not_lt_of_ge (Nat.le_of_lt h))]\n  | inr h =>\n    rw [if_neg (Nat.not_lt_of_ge (Nat.le_of_lt h)), if_pos h]\n#print axioms distinct_magnitude_or_commutative\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.distinct_magnitude_or_commutative"}],"files":{"source.json":{"sha256":"d5fff8c44acef1754c1071f3525e16b20c05c1daa6f1197b5cd00c6e7e706ad1","bytes":850},"Proof.lean":{"sha256":"ec58ce2f5910da5d18d94e13207eb7613d6f3761767b3593f50743b2bb501664","bytes":766},"lean-check.txt":{"sha256":"5116ad4c433e048236e59be62f2dcb314a2a657cdb57bd38e0d255d32350c165","bytes":137}},"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."},{"slug":"hunter-orders-prove-order","identifier":"hunter-orders-prove-order","title":"Orders Prove Order by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"5234dc1689afa94d700f91899f24fc0bab453647a3a351559eb3c5dae38a2a27","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:29.714Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:50.190Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S} |= (P <-> R) & Q) & S","sourceOffset":1257,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unconsumed formal tokens; no prose or connectives discarded","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"64d1a0498d48051aa49930620a41a358d5af2ce345c7eaa30235210aa36cd948","bytes":4320},"Proof.lean":{"sha256":"cc89b0121bf08d444e16c0197360b8d7b36a0c26d2099835d106cb34c4762950","bytes":288},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-original-proofs","identifier":"hunter-original-proofs","title":"Original Proofs by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"10739afe8f8991c2dc14a2550433b5a698c35d175c51e32ff1271d0f723b88e4","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T14:38:24.560Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:50.193Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"7277f6dfe3edb1192cc3ab389bfa175312ef80360508f71fdf744893c17b7f6f","bytes":14551},"Proof.lean":{"sha256":"d8f5f732d1f8518558ab9ec5a7e6f4d86f26eeedb54b0c25e0503fa7b44222c6","bytes":285},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-our-proofs-stand","identifier":"hunter-our-proofs-stand","title":"Our Proofs Stand by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"c0b446fa430b1da250beb17d7ba4e6b123c13dcaa2d106eff50e735a72c8a144","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:42:29.527Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:51.161Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R <-> S, S -> T} |= T <-> ((S <-> R) & (Q <-> P))","sourceOffset":2090,"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","T"],"premises":["P","P -> Q","Q -> R","R <-> S","S -> T"],"conclusion":"T <-> ((S <-> R) & (Q <-> P))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && (v2 == v3)) && ((!v3) || v4))) || (v4 == ((v3 == v2) && (v1 == v0)))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"00bf92de820ae89fd1d1c56454aa9cef91c38018389232d967b80076a3b41e99","bytes":6829},"Proof.lean":{"sha256":"af09fb0114f670086ed7585ee9f0b920f4c43da664342e20085481c319e23739","bytes":568},"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."},{"slug":"hunter-pantheism-hierarchy","identifier":"hunter-pantheism-hierarchy","title":"Pantheism, Interconnection, and Hierarchy","author":"Maclain Hunter","sourceSha256":"ff4d2daffdadf0a9e1450d692a760ad0ef2659b29e50c956125aa4cb7a4769be","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:47.994Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:52.069Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, P <-> Q, R -> (P & Q)} |= (P & Q) <-> R","sourceOffset":226,"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","P <-> Q","R -> (P & Q)"],"conclusion":"(P & Q) <-> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((((v0 && v1) && v2) && (v0 == v1)) && ((!v2) || (v0 && 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":"2ccc9f54de0d36f1247d1ce6a074f218551ea3ab42aca8f91d3520d80f3ac607","bytes":865},"Proof.lean":{"sha256":"92677ab3d3e0ccec6b4d4b3e46647487c2c46b329f60b478fcec06920bb75026","bytes":513},"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."},{"slug":"hunter-reflexive-logic-expertise","identifier":"hunter-reflexive-logic-expertise","title":"Performed Reflexive Proof and Logical Expertise","author":"Maclain Hunter","sourceSha256":"60e7f4413d09ce5db349be21088ddc72bf0b71f359fa8e6f3a65c1649a057879","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:20.101Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:52.983Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{Р} |= Р","sourceOffset":0,"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":["Р"],"premises":["Р"],"conclusion":"Р","status":"candidate","leanStatement":"theorem inference_1 (v0 : Bool) :\n    ((!v0) || v0) = true := by\n  cases v0 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P} |= P disproves claims of my lack of expertise/coherence.","sourceOffset":248,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"/coherence.\"","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"7f13f520f16293193df435c2fb98f10070575688e9cd99e53bdc74254a757e5d","bytes":907},"Proof.lean":{"sha256":"2dfecfc147b592fc1a18025cf68083d346cac47e10e94f85f336b6d76057a552","bytes":412},"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."},{"slug":"hunter-philosophical-algebra","identifier":"hunter-philosophical-algebra","title":"Philosophical Algebra by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"7a7f67aa9690ebe7dbc51389b1c527bbda2edd96b54ef37ad553ac0d9fa6f075","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T17:12:57.950Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:52.986Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q, R <-> Q, S <-> Q, T <-> ~U} |= (((P <-> Q) <-> (R <-> Q) <-> S) <-> T) <-> ~U","sourceOffset":1924,"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","T","U"],"premises":["P <-> Q","R <-> Q","S <-> Q","T <-> ~U"],"conclusion":"(((P <-> Q) <-> (R <-> Q) <-> S) <-> T) <-> ~U","status":"countermodel","countermodel":{"P":false,"Q":false,"R":false,"S":false,"T":true,"U":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"ffb8245d5f9865cd9be03b26311470e819bc56a81c642e22f0af188f7098eda7","bytes":7736},"Proof.lean":{"sha256":"5f08c1ae3aee8a66b4b04e894cac2f1ae070aa31940388082669d644878b91f0","bytes":291},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-predicated-propositions","identifier":"hunter-predicated-propositions","title":"Predicated Propositions by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"1fc220556e7ee9cb2acad47b8d76fed95f0130786811ccfc768e7637c5bdd0c1","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:41:32.429Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:53.955Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_2","HunterAuthored.inference_3","HunterAuthored.inference_4","HunterAuthored.inference_5","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{a} |= ~a","sourceOffset":2048,"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"],"premises":["a"],"conclusion":"~a","status":"countermodel","countermodel":{"a":true},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{P, P -> Q, Q <-> R, R -> S} |= (P & Q) & (R & S)","sourceOffset":3900,"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_2 (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_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{Q, Q -> R, R <-> S, S -> P} |= (Q & R) & (S & P)","sourceOffset":3951,"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":["Q","Q -> R","R <-> S","S -> P"],"conclusion":"(Q & R) & (S & P)","status":"candidate","leanStatement":"theorem inference_3 (v0 v1 v2 v3 : Bool) :\n    ((!(((v1 && ((!v1) || v2)) && (v2 == v3)) && ((!v3) || v0))) || ((v1 && v2) && (v3 && v0))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_3\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_3"},{"id":"inference_4","sourceStatement":"{R, R -> S, S <-> P, P -> Q} |= (R & S) & (P & Q)","sourceOffset":4002,"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":["R","R -> S","S <-> P","P -> Q"],"conclusion":"(R & S) & (P & Q)","status":"candidate","leanStatement":"theorem inference_4 (v0 v1 v2 v3 : Bool) :\n    ((!(((v2 && ((!v2) || v3)) && (v3 == v0)) && ((!v0) || v1))) || ((v2 && v3) && (v0 && v1))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_4\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_4"},{"id":"inference_5","sourceStatement":"{S, S -> P, P <-> Q, Q -> R} |= (S & P) & (Q & R)","sourceOffset":4053,"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":["S","S -> P","P <-> Q","Q -> R"],"conclusion":"(S & P) & (Q & R)","status":"candidate","leanStatement":"theorem inference_5 (v0 v1 v2 v3 : Bool) :\n    ((!(((v3 && ((!v3) || v0)) && (v0 == v1)) && ((!v1) || v2))) || ((v3 && v0) && (v1 && v2))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_5\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_5"},{"id":"source_identity_rule","sourceStatement":"a is a","sourceOffset":6982,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"885b4313e961fc292f6e27630c2683218590382c8fe4ba735b8f32b19417ff6b","bytes":10307},"Proof.lean":{"sha256":"156e8e59d7360d952f71fd620f8992c16b0e0cef536343e1faea340e5702a794","bytes":1353},"lean-check.txt":{"sha256":"502dfa0a316bec1881f2633a0810a079ab7a3c28d21ca804fa523d4be041735d","bytes":360}},"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."},{"slug":"hunter-predicated-propositions-logician-copy","identifier":"hunter-predicated-propositions-logician-copy","title":"Predicated Propositions by Maclain Hunter — Logician-only supplied copy","author":"Maclain Hunter","sourceSha256":"752a55b39e134e359deb793a4f47f8811239dc2d77292e9997fe48851c86681a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:41:32.501Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:54.899Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_2","HunterAuthored.inference_3","HunterAuthored.inference_4","HunterAuthored.inference_5","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{a} |= ~a","sourceOffset":2048,"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"],"premises":["a"],"conclusion":"~a","status":"countermodel","countermodel":{"a":true},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{P, P -> Q, Q <-> R, R -> S} |= (P & Q) & (R & S)","sourceOffset":3580,"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_2 (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_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{Q, Q -> R, R <-> S, S -> P} |= (Q & R) & (S & P)","sourceOffset":3631,"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":["Q","Q -> R","R <-> S","S -> P"],"conclusion":"(Q & R) & (S & P)","status":"candidate","leanStatement":"theorem inference_3 (v0 v1 v2 v3 : Bool) :\n    ((!(((v1 && ((!v1) || v2)) && (v2 == v3)) && ((!v3) || v0))) || ((v1 && v2) && (v3 && v0))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_3\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_3"},{"id":"inference_4","sourceStatement":"{R, R -> S, S <-> P, P -> Q} |= (R & S) & (P & Q)","sourceOffset":3682,"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":["R","R -> S","S <-> P","P -> Q"],"conclusion":"(R & S) & (P & Q)","status":"candidate","leanStatement":"theorem inference_4 (v0 v1 v2 v3 : Bool) :\n    ((!(((v2 && ((!v2) || v3)) && (v3 == v0)) && ((!v0) || v1))) || ((v2 && v3) && (v0 && v1))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_4\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_4"},{"id":"inference_5","sourceStatement":"{S, S -> P, P <-> Q, Q -> R} |= (S & P) & (Q & R)","sourceOffset":3733,"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":["S","S -> P","P <-> Q","Q -> R"],"conclusion":"(S & P) & (Q & R)","status":"candidate","leanStatement":"theorem inference_5 (v0 v1 v2 v3 : Bool) :\n    ((!(((v3 && ((!v3) || v0)) && (v0 == v1)) && ((!v1) || v2))) || ((v3 && v0) && (v1 && v2))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_5\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_5"},{"id":"source_identity_rule","sourceStatement":"a is a","sourceOffset":6662,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"9a2d95ab97a3f6fcfba9103dd413a93a5017b10680adf96942210fd5915edf48","bytes":10033},"Proof.lean":{"sha256":"258efb1f7e2db4d3795ba7d8b821b574b0da1f5fb761b8c12fce98cfbe29fb72","bytes":1385},"lean-check.txt":{"sha256":"502dfa0a316bec1881f2633a0810a079ab7a3c28d21ca804fa523d4be041735d","bytes":360}},"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."},{"slug":"hunter-predictions-proof","identifier":"hunter-predictions-proof","title":"Predictions and Proof by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"99efedb37e59c0bb06fd3b50174543d292ee8a599239b5f732983dba2dccf520","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:21.973Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:55.829Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= (P & Q) & (R & S) & T","sourceOffset":2928,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"(P & Q) & (R & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"3985a759d3305c4427da2dfa3d1c53075e7d287b723f65e3f6366e66ba5c1e61","bytes":4698},"Proof.lean":{"sha256":"5279571c85c0474f1c3dba07f9d70af41c9faf8f5d3fdf8efcff2575a3056a45","bytes":576},"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."},{"slug":"hunter-primordial-reason-scientific-test","identifier":"hunter-primordial-reason-scientific-test","title":"Primordial Reason — Scientific-Test Passage","author":"Maclain Hunter","sourceSha256":"1a45eed15ae386b3636c41d13b1afc2c33689ba25cfea625b846af7f2344b0a5","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:45:10.784Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:56.708Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"source_identity_rule","sourceStatement":"A = A","sourceOffset":0,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"e5a301da23f8a4bca01232ac16a1d80ce7eb549a911bc370fafffb4aa9fea8f1","bytes":892},"Proof.lean":{"sha256":"457292aec1aa4edc30379f1d6fbbb85840abcbfc4f6368bffa923f9c4db4d9cc","bytes":397},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-proof-acknowledges-first-cause","identifier":"hunter-proof-acknowledges-first-cause","title":"Proof Acknowledges First Cause by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"e5b421e775ebbe32d140ba0d8f328f0d95cbf1d74aa4eac87bb045f2c2364ca1","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T17:32:10.052Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:57.582Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q} |= P & Q","sourceOffset":291,"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"],"premises":["P","P <-> Q","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && (v0 == v1)) && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"ee8cbdaf2f1dfb51ee28b06e0010f325ba24a9da1fb8d5a1407d03a488525035","bytes":1157},"Proof.lean":{"sha256":"2e566907b436b54ef208efdc87066d03d6a20a58fec9ca32dbee84b42533e776","bytes":461},"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."},{"slug":"hunter-objective-coherence-proof","identifier":"hunter-objective-coherence-proof","title":"Proof Aligned with Objective Coherence by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"d1ae37101271d339789bc9275858a3fa7c0efef5c061b298c119ed34f348f3e3","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T14:38:27.360Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:58.524Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S, T} |= ((P & Q) & (R & S)) & T","sourceOffset":2464,"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","T"],"premises":["P","Q","R","S","T"],"conclusion":"((P & Q) & (R & S)) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && v1) && v2) && v3) && v4)) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":1160,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"1ffa91abb8af66cea745c1beaea6c35e7ee35c7022e47273e02b1d7f228ca62c","bytes":6566},"Proof.lean":{"sha256":"ce311301e1bc189849fa34b524b5477e5cf0f489ac21e5ee284136a9183b6bc6","bytes":650},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-proof-coherent-source-necessity","identifier":"hunter-proof-coherent-source-necessity","title":"Proof and Its Necessary Coherent Source","author":"Maclain Hunter","sourceSha256":"d686d4b7c4ba12425c992e27d940ea19a24c66c9f5e8c581da43d0ea8f17c108","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:34.027Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:58.527Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{□P, □Q, (P & Q) -> R} |= R -> (Q & P)","sourceOffset":227,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"□P\"","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"9953aeb83af01b87802a1c335b6334b0be15f09373f4b3b46ea08378f0e21ce5","bytes":864},"Proof.lean":{"sha256":"4dcc5499aa630805e38519df040b00245b24fa7ca2b43e8418fa36c65f8209fc","bytes":291},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-tautological-logic-demonstration","identifier":"hunter-tautological-logic-demonstration","title":"Proof Demonstrating Tautological Logic — Supplied Archive","author":"Maclain Hunter","sourceSha256":"c236fa133adc939b1a7f29b10799dc6873c236f666cf8740522b9865af381649","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:31:06.947Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:58.529Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P, P->Q, Q->R, R->S, S->T, T->U, U->P} |= (((P&Q) & (R&S ) & T) & U","sourceOffset":199,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"3168f20f0572dd9fef25f5edcf715198e1ee0d5755a834eda6b338e77fe8318f","bytes":3086},"Proof.lean":{"sha256":"03fa0be4be8cdb196741b787d51d6c27f5e63ea43e7c6902d247f90c24b322de","bytes":311},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-i-know-proof","identifier":"hunter-i-know-proof","title":"Proof I Know Proof by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"caeb1858685cf29c9a5af2110bd481d5295f718627e8ccc3ec5de5f3156112bb","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T17:13:02.889Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:40:59.512Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":1800,"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"}],"files":{"source.json":{"sha256":"f846ea3551fd385f0499f51ca6f913d52fd047d0d5f102f5087ebed38c7a2330","bytes":4304},"Proof.lean":{"sha256":"27264e8284de641b458413b58c948c049de1504b59749f96bc921567b7124939","bytes":521},"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."},{"slug":"hunter-logic-is-conscious","identifier":"hunter-logic-is-conscious","title":"Proof Logic is Conscious by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"2dac617fac5bc1736c481d1bdb49744653c2e12d16403b7b14bec9e3a6935c7a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:20:12.424Z","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:00.403Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (P & Q) <-> R","sourceOffset":1459,"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"],"conclusion":"(P & Q) <-> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && 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"},{"id":"inference_2","sourceStatement":"{P, Q, R} |= (P & Q) <-> R","sourceOffset":2426,"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"],"conclusion":"(P & Q) <-> R","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && v2)) || ((v0 && v1) == v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"e21bfff288e62bb6eae24dea4276d3be700d592284f759407448b6152c617ec6","bytes":4156},"Proof.lean":{"sha256":"e16e0064ab2e9cd6b3db02ffc8e89c19ede79615a71d67b3510b210006911d3b","bytes":649},"lean-check.txt":{"sha256":"9dd24ecb3d82c309e42e8e914b5df3ec490fd2259644de7d887fca9eeff5dfe5","bytes":174}},"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."},{"slug":"hunter-logic-conscious-received-copy","identifier":"hunter-logic-conscious-received-copy","title":"Proof Logic is Conscious by Maclain Hunter — Further Supplied Source","author":"Maclain Hunter","sourceSha256":"6b5e2f503faaa456088c727ff5c06e41ce1e8dd11dbaed2ba8d6c53eb13a6921","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:25.521Z","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:01.337Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (P & Q) <-> R","sourceOffset":1459,"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"],"conclusion":"(P & Q) <-> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && 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"},{"id":"inference_2","sourceStatement":"{P, Q, R} |= (P & Q) <-> R","sourceOffset":2424,"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"],"conclusion":"(P & Q) <-> R","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && v2)) || ((v0 && v1) == v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"6e04c301b793194ea03a34ceadacc669259adee22938334d9b9a007f5ea69f5d","bytes":4183},"Proof.lean":{"sha256":"91c5811251f00eec983018a2ce373dc9271fe0922bd189f957796901ad98baed","bytes":677},"lean-check.txt":{"sha256":"9dd24ecb3d82c309e42e8e914b5df3ec490fd2259644de7d887fca9eeff5dfe5","bytes":174}},"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."},{"slug":"logos-identity-manifestation-proof","identifier":"logos-identity-manifestation-proof","title":"Proof of (((P & Q) & R) & S) & T by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"22ee8268ac3d1e44976c7c3bd22dd77f9b680aad7b4d153150c09836e6791e18","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T14:21:37.455Z","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:02.290Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T} |= (((P & Q) & R) & S) & T","sourceOffset":2447,"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","T"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T"],"conclusion":"(((P & Q) & R) & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4))) || ((((v0 && v1) && v2) && v3) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":325,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"6494ee5bcb21a375efb71b21d84b9efd51a335466504b57b452dde1bd08d6334","bytes":6172},"Proof.lean":{"sha256":"14effe48727b5801decc766fa2f418d86bf55bbc761252d2e088d06679c1b2e3","bytes":676},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-established-certainty","identifier":"hunter-established-certainty","title":"Proof of Established Certainty by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"e58e12ad28490c9367345c3f942f6f0579372963042a03fefaff15b38ce0d5ff","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:46:58.577Z","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:03.195Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{PS, PS -> DT, DT & EOC, PS -> PRN} |= ((DT & EOC) -> PRN) <-> PS","sourceOffset":1235,"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":["DT","EOC","PRN","PS"],"premises":["PS","PS -> DT","DT & EOC","PS -> PRN"],"conclusion":"((DT & EOC) -> PRN) <-> PS","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v3 && ((!v3) || v0)) && (v0 && v1)) && ((!v3) || v2))) || (((!(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":"{P, P -> Q, Q & R, P -> S} |= ((P & Q) -> R) <-> S","sourceOffset":1322,"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","P -> S"],"conclusion":"((P & Q) -> R) <-> S","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && (v1 && v2)) && ((!v0) || v3))) || (((!(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"}],"files":{"source.json":{"sha256":"d9f072a3b064762b7ab136e8358864f2ff0fd0def0445821c8ba1d008da70b1a","bytes":2528},"Proof.lean":{"sha256":"d803cd52cbdd1b69d098e44ff4cd7827ba4b72994af03ac44881d03d33d73942","bytes":785},"lean-check.txt":{"sha256":"9dd24ecb3d82c309e42e8e914b5df3ec490fd2259644de7d887fca9eeff5dfe5","bytes":174}},"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."},{"slug":"hunter-foundational-coherence-proof","identifier":"hunter-foundational-coherence-proof","title":"Proof of Foundational Coherence by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"06170827c28cd5c5bb2b0127f7c1b85d28d4e67db66110df2fec1dccc62aae7e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:08.823Z","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:04.104Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, R -> P, R -> Q} |= R -> (P & Q)","sourceOffset":3690,"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 -> P","R -> Q"],"conclusion":"R -> (P & Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((v0 && (v0 == v1)) && ((!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"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":2237,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"b533da5ded2b71143e24446fc1c39f8acabfca4184b5dfa7c2658ec17b7b036a","bytes":7338},"Proof.lean":{"sha256":"ddf423fe8a0ac438b9f50988a4579509bfe9ba863326f186b405fbf920ee453d","bytes":620},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-universal-logic-ontology-proof","identifier":"hunter-universal-logic-ontology-proof","title":"Proof of God as Universal Logic and Ontology","author":"Maclain Hunter","sourceSha256":"643cc7d2bf8a21837c9df3cd45e7db0a81aa577835ad2a63fa2440364d3aba25","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:31:21.001Z","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:05.014Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P ⇒ Q, Q ⇒ R, R ⇒ S, S ⇒ T, T ⇒ U} |= ((P ∧ Q) ∧ (R ∧ S) ∧ T) ∧ U","sourceOffset":3977,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"⇒ Q\"","kernelStatus":"not_checked"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":715,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"e442832401236b22fc6d923c56d9632ef2924188e79588adb38a5540bba75145","bytes":6746},"Proof.lean":{"sha256":"01112ff08bd405913f766029023649057c272ecc57a3f7ca8f76a3997dcb301f","bytes":396},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-god-self-control-wisdom","identifier":"hunter-god-self-control-wisdom","title":"Proof of God's Self-Control and Wisdom by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"83d11a4eff846cb67afebe946811af057f80c694d5e87945a879627a03e87d69","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:22.811Z","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:05.954Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P,Q,R,S,T} |= (P & Q) & (R & S) & T","sourceOffset":1202,"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","T"],"premises":["P","Q","R","S","T"],"conclusion":"(P & Q) & (R & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && v1) && v2) && v3) && v4)) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"a43d6b9caf314dfa8397b30e9ebf1c05f553d1d5d04bfa84bd7fda49b4572fbf","bytes":2597},"Proof.lean":{"sha256":"eab79884aec7bdba5c8f9ba5d25d8c4936ae327454ba4c53bfedd6bd69cf33a7","bytes":549},"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."},{"slug":"hunter-proof-logical-coherence","identifier":"hunter-proof-logical-coherence","title":"Proof of Logical Coherence by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"2335bae3ea42899450ea70917c423aae2289d0f328e6bd5bed418967cf010f81","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:23:05.961Z","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:06.847Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{1, 2, 3, 4} |= (1 & 2) <-> (3 & 4)","sourceOffset":60,"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":["1","2","3","4"],"premises":["1","2","3","4"],"conclusion":"(1 & 2) <-> (3 & 4)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && 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":"source_identity_rule","sourceStatement":"A is A","sourceOffset":110,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"4671c4587db1362b83a4e9df5b19db8de367c049df8d348f72eb5276fbae8ea6","bytes":4455},"Proof.lean":{"sha256":"36f6cf32f78807320e1df571c79d1d44d7226d5d3b6683d97c2a8a62818f9a95","bytes":606},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-proof-source-logic","identifier":"hunter-proof-source-logic","title":"Proof of Proof’s Source in Logic","author":"Maclain Hunter","sourceSha256":"5473c6366d0dd1544855f4711b6055a9773c50e983f082ce9ec07cf089134cce","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:06.572Z","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:07.917Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T, T -> U, U -> V} |= (((P & Q) & (R & S) & T) & U) & V","sourceOffset":1790,"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","T","U","V"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T","T -> U","U -> V"],"conclusion":"(((P & Q) & (R & S) & T) & U) & V","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 v6 : Bool) :\n    ((!((((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5)) && ((!v5) || v6))) || (((((v0 && v1) && (v2 && v3)) && v4) && v5) && v6)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> cases v6 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"08deae672a3cff0711c13c0db4f89a1aa2f3910bba61eaa5e27a778f141214ff","bytes":3259},"Proof.lean":{"sha256":"0232795a45093f4c044585d883b49a9bbcb1a600c43ac85df02f60ecfdfc457d","bytes":657},"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."},{"slug":"hunter-reality-narrative-proof","identifier":"hunter-reality-narrative-proof","title":"Proof of Reality’s Narrative","author":"Maclain Hunter","sourceSha256":"c792e250f2a55f5bf9fc1f22fcac66afa3149d42a7d754db3f19af0b5dd92038","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:08.816Z","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:08.858Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S, T, U} |= ((P & Q) & (R & S) & T) & U","sourceOffset":3494,"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","T","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"e4b1bd53b39a386f64f79d3cd274de7a3dfbcdafeb1eaa6439433aa31b9ad74c","bytes":7559},"Proof.lean":{"sha256":"9a61237ae554fd5fdcb270f404926412861d63f57a22560858667cef2cb4b8f9","bytes":555},"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."},{"slug":"hunter-reason-demanding-reasoning-realization","identifier":"hunter-reason-demanding-reasoning-realization","title":"Proof of Reason Demanding Reasoning and the Realization of Emergent Properties and Reality by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"a039265504533a8ab66bfd6e3a625cbd33993c9c78990f8f28cc6b388f44f6af","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:08.053Z","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:09.781Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= (P & Q) & (R & S) & T","sourceOffset":1198,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"(P & Q) & (R & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Logic is Logic","sourceOffset":125,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"041258f7693e3e5a0c43868439208f03b38a89066cd9d7067c7b8c93af93f451","bytes":4002},"Proof.lean":{"sha256":"051dfa98a2f8cbe6908b3df68b174a512b143003e1c6c933fd90ea40e7951770","bytes":746},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-universal-logic-axiom-proof","identifier":"hunter-universal-logic-axiom-proof","title":"Proof of the Axiom of Universal Logic","author":"Maclain Hunter","sourceSha256":"9a125b514846bbe64f392c43723b736ef257b61eb2e36f289e56ebb93775f7e0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:35.749Z","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:10.615Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= (P & Q) & (R & S)","sourceOffset":2702,"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"}],"files":{"source.json":{"sha256":"5176d37833d0a156baed3f275a54274d4f3c6d1baa5333be1ba71ffd27be3e7e","bytes":6686},"Proof.lean":{"sha256":"62420ffad45141339a3dacf23ee876c0fa72980ad0add205c3e6d555401c4540","bytes":531},"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."},{"slug":"hunter-unified-source-diversity","identifier":"hunter-unified-source-diversity","title":"Proof of the Necessity of a Unified Source for Diversity: A Variation of Al-Farabi's Argument","author":"Maclain Hunter","sourceSha256":"141e6c08d9504850fff7f6feb9fdab8632b5917cc59df19791c90ba6b7c62232","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:19.627Z","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:10.617Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"c507b0f27300355cb759563401daf2e567f05d920a16a0b5d0d161dfcefaf84b","bytes":6408},"Proof.lean":{"sha256":"bfb4b76c881a498c3d26c976347fdd710328322eb8b73f120c90dc2d4e53d1fc","bytes":345},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-psr-further-received-copy","identifier":"hunter-psr-further-received-copy","title":"Proof of the Principle of Sufficient Reason (PSR) by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"3398b27ce7ab9dc542f689a2b899dfc92aed182b1811a97b43ac505f243df9b3","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:11.071Z","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:11.504Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> S, S <-> R} |= (P & Q) <-> R","sourceOffset":3188,"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 <-> S","S <-> R"],"conclusion":"(P & Q) <-> R","status":"countermodel","countermodel":{"P":true,"Q":false,"R":true,"S":true},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":369,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"4b4c1e8ddfdfcd48bbbad7dbd44ca85d3e0690fcba7ca55a72e9c798655f1568","bytes":8137},"Proof.lean":{"sha256":"f70594ec7d51bad3620ace50adcd711db7f2b3d6e6d039ef4d7be9b576b0d618","bytes":419},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-psr-received-copy","identifier":"hunter-psr-received-copy","title":"Proof of the PSR — Full Supplied Copy","author":"Maclain Hunter","sourceSha256":"1777fd11e570cd38f3ff96ea507523cb5866cb1250be230d3405ebdfe0421079","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:49.835Z","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:12.501Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, (P & Q) -> R, S, S -> T, (S & T) -> U} |= U","sourceOffset":2082,"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","T","U"],"premises":["P","P -> Q","(P & Q) -> R","S","S -> T","(S & T) -> U"],"conclusion":"U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && ((!v0) || v1)) && ((!(v0 && v1)) || v2)) && v3) && ((!v3) || v4)) && ((!(v3 && v4)) || v5))) || v5) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"cf4a5791132681a1f6086438b70f8779f87240dda3e97776b23f0d18d3ada891","bytes":7588},"Proof.lean":{"sha256":"d79b3e61ac247c5226f5fbc8de002102454df5dfc1e10426dd680cf8d5e2c449","bytes":584},"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."},{"slug":"hunter-proof-terms-refutation","identifier":"hunter-proof-terms-refutation","title":"Proof Terms and Valid Refutation","author":"Maclain Hunter","sourceSha256":"1e7bf13dc98edb30c4b65e88a6ba262d876001e02dc779618087ead43dbcc0ab","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:14.059Z","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:13.398Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, ~~(P & Q)} |= (P & ~~P) & (Q & ~~Q)","sourceOffset":238,"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"],"premises":["P","Q","~~(P & Q)"],"conclusion":"(P & ~~P) & (Q & ~~Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && v1) && (!(!(v0 && v1))))) || ((v0 && (!(!v0))) && (v1 && (!(!v1))))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"cdbe7b4c3ebf79ddd5350721c195e7f01ffc2b31af6f6910800561a737ff03b0","bytes":857},"Proof.lean":{"sha256":"9f76ce6cf3c1b27dd16ec3b6bc5a687a50a526a68107c0c30749cfa58e17b47a","bytes":479},"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."},{"slug":"hunter-proof-evidence-logic-god","identifier":"hunter-proof-evidence-logic-god","title":"Proof, Evidence, Logic, and God by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"35240dabaf8486de71c3bd8107023ed1230dcef2a72d42a07f0ce5abfcf1f549","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:22.019Z","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:14.282Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q, Q, Q -> P, P} |= P & Q","sourceOffset":2907,"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"],"premises":["P <-> Q","Q","Q -> P","P"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((((v0 == v1) && v1) && ((!v1) || v0)) && v0)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P ↔ Q, Q, Q → P, P} ⊨ P ∧ Q is valid and follows accepted principles of formal logic.","sourceOffset":4189,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \".\"","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"57a8f72f279df61cc4885b434c00eda3e9f9e6cb8711cef28f42f56262384b6a","bytes":6024},"Proof.lean":{"sha256":"bb510779575a566e1180df9375cb4f24db96dc071df76953045a4f7970bd90ff","bytes":481},"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."},{"slug":"hunter-proof-god-consistency","identifier":"hunter-proof-god-consistency","title":"Proof, God, and Consistency by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"47b947f1c0e36578e02e0ab662f7ab20ece3352797276b713de470ac2023ed9a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:57:34.985Z","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:15.344Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, P <-> Q, P <-> R, Q <-> P, Q <-> R, R <-> P, R <-> Q, P <-> P, Q <-> Q, R <-> R, P, Q, R} |= (P & Q) & R","sourceOffset":3053,"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","P <-> Q","P <-> R","Q <-> P","Q <-> R","R <-> P","R <-> Q","P <-> P","Q <-> Q","R <-> R","P","Q","R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((((((((((((((v0 && v1) && v2) && (v0 == v1)) && (v0 == v2)) && (v1 == v0)) && (v1 == v2)) && (v2 == v0)) && (v2 == v1)) && (v0 == v0)) && (v1 == v1)) && (v2 == v2)) && v0) && 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"},{"id":"inference_2","sourceStatement":"{P, Q, R, P <-> P, Q <-> Q, R <-> R, P, Q, R} |= (P & Q) & R","sourceOffset":3182,"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","P <-> P","Q <-> Q","R <-> R","P","Q","R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 : Bool) :\n    ((!((((((((v0 && v1) && v2) && (v0 == v0)) && (v1 == v1)) && (v2 == v2)) && v0) && v1) && v2)) || ((v0 && v1) && v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"f7be5fed7160e6c84003843b04ec7cf55a08e287df6a53924e7e47793c9b94b0","bytes":9734},"Proof.lean":{"sha256":"f7138d165757b33f8f6437a9e650699536fab15978d4d167d176b44750049a75","bytes":892},"lean-check.txt":{"sha256":"9dd24ecb3d82c309e42e8e914b5df3ec490fd2259644de7d887fca9eeff5dfe5","bytes":174}},"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."},{"slug":"hunter-proper-competition","identifier":"hunter-proper-competition","title":"Proper Competition by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"31891c46741532e6e203059acdce85522b6761aa8c7a11c54589d4c130cc2680","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:20:47.766Z","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:15.348Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"7af0823efb5e8efc78d4db032493522a7a0fbc631aa93bd1c1e61a51a358badb","bytes":1756},"Proof.lean":{"sha256":"e18ef601b7bee6bba6496b5a25cfbe6ff39045ba6980a24e758e4a0d2705ce21","bytes":288},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-proto-meta-logic-hierarchy","identifier":"hunter-proto-meta-logic-hierarchy","title":"Proto-Logic (Logos in First Form) <-> Meta-Logic (Logos in self-referential form)","author":"Maclain Hunter","sourceSha256":"5d54758c6ff4201f603f830f0c675c5c110c9d5e6ed63e82b3620adcca7cbab4","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:02.744Z","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:15.349Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"e0799974ff978adb049e26b25980d2722179cc501aa2238fcc532a270f6375f0","bytes":6354},"Proof.lean":{"sha256":"5830044232d70bce796572113b6bba5799da69451cf3c18856bfbd105f9578ba","bytes":333},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-proven-facts","identifier":"hunter-proven-facts","title":"Proven Facts by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"012772d374485448686e90e3e8659e7c16f74f77f683d5a7b08e02b156da8bd1","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:04.010Z","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:16.310Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q, Q <-> R, R <-> S} |= (P & Q) <-> (R & S)","sourceOffset":2222,"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 <-> Q","Q <-> R","R <-> S"],"conclusion":"(P & Q) <-> (R & S)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((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"}],"files":{"source.json":{"sha256":"905042483cf09f96949627d7141e4d10708beac0af5ec6678cdce9039eba98c8","bytes":4028},"Proof.lean":{"sha256":"47be6cdb32a08dfc6c5b6dbe0e76f855b666d1e22f5e651e142839f613888f03","bytes":507},"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."},{"slug":"hunter-turing-lambda-coherence","identifier":"hunter-turing-lambda-coherence","title":"Proving the Coherence and Equivalence of Turing Machines and Lambda Calculus by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"7e0686233c15043e6b1e4a6de3c92cabce445411727110b63235d982115d1f45","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T14:38:26.954Z","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:17.365Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T, T <-> U, U -> V} |= (((P & Q) & (R & S) & T) & U) & V","sourceOffset":1225,"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","T","U","V"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T","T <-> U","U -> V"],"conclusion":"(((P & Q) & (R & S) & T) & U) & V","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 v6 : Bool) :\n    ((!((((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4)) && (v4 == v5)) && ((!v5) || v6))) || (((((v0 && v1) && (v2 && v3)) && v4) && v5) && v6)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> cases v6 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":182,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"4e4226b84ff5515c2d1bffde407a666514ed373eff1d9919e02254b88d4ccf25","bytes":2551},"Proof.lean":{"sha256":"bac087ddf3c2f2aaee0f6e9079b920355df86767a2fc609b2ef1cd0583c7ed39","bytes":803},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-pythagorean-proofs","identifier":"hunter-pythagorean-proofs","title":"Pythagorean Proofs by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"d6182166b343de6bd6f63d9927dc20d086c6c877b0337f9a90a9cea8e08a1bed","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:41:48.740Z","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:18.338Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.inference_3","HunterAuthored.inference_4","HunterAuthored.inference_5"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R} |= (P & Q) & R","sourceOffset":1395,"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","Q <-> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v0 == v1)) && (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"},{"id":"inference_2","sourceStatement":"{a, a <-> b, b <-> c, c <-> d} |= (d -> c) -> (b -> a)","sourceOffset":2218,"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","c <-> d"],"conclusion":"(d -> c) -> (b -> a)","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3))) || ((!((!v3) || v2)) || ((!v1) || v0))) = 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":"{A, A <-> B, B <-> C} |= (C -> B) -> A","sourceOffset":4676,"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"],"premises":["A","A <-> B","B <-> C"],"conclusion":"(C -> B) -> A","status":"candidate","leanStatement":"theorem inference_3 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v0 == v1)) && (v1 == v2))) || ((!((!v2) || v1)) || v0)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_3\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_3"},{"id":"inference_4","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":6080,"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_4 (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_4\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_4"},{"id":"inference_5","sourceStatement":"{P1, P1 <-> P2, P2 <-> P3} |= (P1 & P2) & P3","sourceOffset":7187,"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","P3"],"premises":["P1","P1 <-> P2","P2 <-> P3"],"conclusion":"(P1 & P2) & P3","status":"candidate","leanStatement":"theorem inference_5 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v0 == v1)) && (v1 == v2))) || ((v0 && v1) && v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_5\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_5"}],"files":{"source.json":{"sha256":"a5e7ed9b77e01637267eaa395a5c5115023c5bd5a2419906eed6f405adab6a68","bytes":8527},"Proof.lean":{"sha256":"db4962b81737ebc10fa472343a567db1bfe1202950ae011731bf614faf0d3978","bytes":1352},"lean-check.txt":{"sha256":"8bd83cac7b1813498b5b471d23e0c629fc6d126b59a48b827d19f768223491b4","bytes":351}},"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."},{"slug":"hunter-rationalism-phenomenology","identifier":"hunter-rationalism-phenomenology","title":"Rationalism and Phenomenology","author":"Maclain Hunter","sourceSha256":"b9f9c9ed74313f75e57dbc8d4bd6a0463b5f156951e5b2eebb2366ab93275fba","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:54.095Z","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:19.309Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q} |= P & Q","sourceOffset":227,"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"],"premises":["P","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"dc409005087a05b448ea3c1c7310fcd90700d06421994a952e8254cab4d3d219","bytes":817},"Proof.lean":{"sha256":"f66a17bb2826dc489cff212ab804a8b6a873d88d856070dc9788babe86f8a1f0","bytes":426},"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."},{"slug":"hunter-reality-logical-coherence","identifier":"hunter-reality-logical-coherence","title":"Reality’s Logical Coherence by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"e1b3ca8591290456f7f5f61874dffbf1c6ef9917701ab107f43d0500acf3cf81","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:41:48.607Z","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:20.515Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.inference_3","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T, T <-> U, U} |= (((P & Q) & (R & S) & T) & U)","sourceOffset":6770,"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","T","U"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T","T <-> U","U"],"conclusion":"(((P & Q) & (R & S) & T) & U)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!((((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4)) && (v4 == v5)) && v5)) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P, Q, R, S} |= (P & Q) & (R & S)","sourceOffset":13633,"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","Q","R","S"],"conclusion":"(P & Q) & (R & S)","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && v2) && v3)) || ((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":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":14411,"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_3 (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_3\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_3"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":2601,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"0566b1bdda70b135a48fd31258a1f328780204c4c2e0c83255e4a6b6b4ee18e5","bytes":16952},"Proof.lean":{"sha256":"9b775c426103efb554b2491fe7ae2b9adc1892ce4efdd858df4d77278e768ed2","bytes":1165},"lean-check.txt":{"sha256":"b2a13c78d5e07cc13897edfa6e4ad95b717a32423f43c97d6c342c394c93869c","bytes":301}},"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."},{"slug":"hunter-reason-universal-particular-order","identifier":"hunter-reason-universal-particular-order","title":"Reason — Universal and Particular Order","author":"Maclain Hunter","sourceSha256":"2bd0980823e07744e735437f03e5b6e8001eac3414bbfc6e7456acee4449c854","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:09.595Z","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:20.518Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{R, R<->E, E<->A, A<->S, S<->O, O<->N, N<->R} |= (((R & E) & (A & S) & O) & N","sourceOffset":1567,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{1, 1<->2, 2<->3, 3<->4, 4<->5, 5<->6, 6<->1} |= (((1 & 2) & (3 & 4) & 5) & 6","sourceOffset":1652,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"},{"id":"inference_3","sourceStatement":"{P, P<->Q, Q<->R, R<->S, S<->T, T<->U, U<->P} |= (((P & Q) & (R & S) & T) & U","sourceOffset":1736,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"},{"id":"inference_4","sourceStatement":"{~R, ~R<->~E, ~E<->~A, ~A<->~S, ~S<->~O, ~O<->~N, ~N<->~R} |= (((~R & ~E) & (~A & ~S) & ~O) & ~N","sourceOffset":1848,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"},{"id":"inference_5","sourceStatement":"{R, R<->E, E<->A, A<->S, S<->O, O<->N, N<->R} |= (((R & E) & (A & S) & O) & N","sourceOffset":2255,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"},{"id":"inference_6","sourceStatement":"{1, 1<->2, 2<->3, 3<->4, 4<->5, 5<->6, 6<->1} |= (((1 & 2) & (3 & 4) & 5) & 6","sourceOffset":2340,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"},{"id":"inference_7","sourceStatement":"{~R, ~R<->~E, ~E<->~A, ~A<->~S, ~S<->~O, ~O<->~N, ~N<->~R} |= (((~R & ~E) & (~A & ~S) & ~O) & ~N","sourceOffset":2452,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"066271c9a4818d3908959f10136bcfb59d6f594df23892c2599c5be48f47ae22","bytes":4673},"Proof.lean":{"sha256":"e4bdc344cf15b579d3367ef7ccb533b739a57a4d0356aaebb8ef310a3a40bb28","bytes":293},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-reason-god-love","identifier":"hunter-reason-god-love","title":"Reason as God and the Coherence of Love","author":"Maclain Hunter","sourceSha256":"b03437b3c73b494ff8fda428c7c32444c5b1e6099eefc33119db2329b695199c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:09.456Z","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:21.605Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (P & Q) -> 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","Q","R"],"premises":["P","Q","R"],"conclusion":"(P & Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && 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":"79a52ea31713fbc99f8ae6e8b4c6e83b5e326ae3ea4909482729ec782351eb5c","bytes":866},"Proof.lean":{"sha256":"4330f3a470bec2f333687c25a4a12e330dbb63929d66e4726f60379cccbba312","bytes":471},"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."},{"slug":"maclain-hunter-reason-as-ship-of-theseus","identifier":"maclain-hunter-reason-as-ship-of-theseus","title":"Reason as the Ship of Theseus by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"8bd8c1e324dbdd45f5e088ce01c766e470019695a267ea1e64b15598d156d26b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:20:01.587Z","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:22.928Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":3299,"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":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":2821,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"36efbe2b23373ae9c375103654802078bc0bb530f6dadce2debfc4449d5e688b","bytes":5433},"Proof.lean":{"sha256":"93985da220cf8791ddb25dc15a2f14ecc6da0b49d9d4307122d660e28009da4d","bytes":633},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-reason-belief-psr","identifier":"hunter-reason-belief-psr","title":"Reason, Belief, and the PSR","author":"Maclain Hunter","sourceSha256":"9d122383c61845237afef7770cd116a3eb60c7edb144f3721fad88fc0a802f2b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:38.556Z","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:24.110Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (P & Q) -> R","sourceOffset":253,"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"],"conclusion":"(P & Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && 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":"d5b9923505eb326bc0f8492f86623e386d078a906faf933e7e2cb30641c53a78","bytes":849},"Proof.lean":{"sha256":"28d304e54eea04d613f00619164fd380d2456631a372d35432a0bfb3e57453d3","bytes":459},"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."},{"slug":"hunter-reasons-reasoning","identifier":"hunter-reasons-reasoning","title":"Reason’s Reasoning","author":"Maclain Hunter","sourceSha256":"f800f0482b9d8a4fb1e71f63f37aa16f40b9a61f66db811f64f5d96982588c61","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:52.110Z","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:25.314Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, P -> R, P -> (Q <-> R), S, S -> T, T -> ((P & Q) & R)} |= P <-> (Q <-> R)","sourceOffset":936,"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","T"],"premises":["P","P -> Q","P -> R","P -> (Q <-> R)","S","S -> T","T -> ((P & Q) & R)"],"conclusion":"P <-> (Q <-> R)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((((v0 && ((!v0) || v1)) && ((!v0) || v2)) && ((!v0) || (v1 == v2))) && v3) && ((!v3) || v4)) && ((!v4) || ((v0 && v1) && v2)))) || (v0 == (v1 == v2))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"ba6e48e5c462ae2e32556bc884466695dea845654f1f30a88f8936d4d9e0573d","bytes":3631},"Proof.lean":{"sha256":"057ed0725d519e19a94908f6f34a158e63f1d8ea3c58343019f5edc69da52ccc","bytes":592},"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."},{"slug":"hunter-reasoned-love-god","identifier":"hunter-reasoned-love-god","title":"Reasoned Love and God","author":"Maclain Hunter","sourceSha256":"6e0fdf088d47c174501c653865ce9071c1fb9a97750a9db3797c4431e59d6750","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:12.864Z","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:26.374Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= (R <-> P) & (Q <-> P)","sourceOffset":198,"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","Q -> R"],"conclusion":"(R <-> P) & (Q <-> P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((v2 == v0) && (v1 == v0))) = 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":"2122439dfb9d41ccb84e6049fa06990156d8f6e98846fb2c891628d755333e57","bytes":810},"Proof.lean":{"sha256":"9a8218956d57d9ef2bac0e283758782fd3997eda2ddf6775a11f2ddbb7c25447","bytes":480},"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."},{"slug":"hunter-redundancy-proof-objective-principles","identifier":"hunter-redundancy-proof-objective-principles","title":"Redundancy in Proof for Logic, God, and Objective Principles by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"1823c904fdcb69e178c2200dd9b014d328cb7bbdf26a8f2a77cf36599972ad6d","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:04.306Z","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:26.377Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T} |= ((P & Q) & (R & S) & T","sourceOffset":2341,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"5167f39ac439397357b1d4d1fb65e91dba64142bbccf7dda94f813f084673656","bytes":5865},"Proof.lean":{"sha256":"777365d7b8c61ee7ad55f63db7bde7104d29b31c917fb0572385c4802d26142e","bytes":330},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-russells-folly","identifier":"hunter-russells-folly","title":"Russell’s Folly","author":"Maclain Hunter","sourceSha256":"b837bc4f8dc24b99b5e151897f3968764596d7ebd0860214955824561b2f555b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:58.718Z","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:26.378Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"a40e239f7f8651ac484d7fee2c7abad304b61784cfe6ea100e350abd9bd72ec9","bytes":2703},"Proof.lean":{"sha256":"eb43a91e7de00c3db81b9989d909990bfa96e566ec3d3c8ff77b8b892dd5b5fc","bytes":269},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-sages-observable-god-logic","identifier":"hunter-sages-observable-god-logic","title":"Sages and Observable God as Logic","author":"Maclain Hunter","sourceSha256":"4399be3a45669e5b160ebb30c1236dff190d59269905159fbe741e355ea51bd1","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:09.331Z","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:27.457Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> (Q & R)} |= R","sourceOffset":252,"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)"],"conclusion":"R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(v0 && ((!v0) || (v1 && v2)))) || 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":"515ed1bd3a46a7233b96be55fbc98ee5614b7f18fad6fcf73be4b94a1386d7c1","bytes":856},"Proof.lean":{"sha256":"a03bbd35285a71cf9f37048410f52e168bb16daa020decfb5765b120e1ed3c4f","bytes":457},"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."},{"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."},{"slug":"hunter-science-logic-contingencies","identifier":"hunter-science-logic-contingencies","title":"Science, Logic, and Contingencies","author":"Maclain Hunter","sourceSha256":"c62424eb3cb1e702ac9e48790db98999e1a5768b93f77127d61ea559c9796e29","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:25.229Z","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:29.937Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{R, R -> Q, (R -> Q) -> P} |= R -> ~(R & ~(Q & P))","sourceOffset":197,"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":["R","R -> Q","(R -> Q) -> P"],"conclusion":"R -> ~(R & ~(Q & P))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v2 && ((!v2) || v1)) && ((!((!v2) || v1)) || v0))) || ((!v2) || (!(v2 && (!(v1 && v0)))))) = 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":"ecfd2c42e8177f075ecf266bed59568d3a03df3ade80e06c9bbeb59ee21520cb","bytes":839},"Proof.lean":{"sha256":"1856446dcdede614625598a87f08f404052afdf5c8fa86b82d5a737733d53536","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."},{"slug":"hunter-scientific-coherence-proves-logos","identifier":"hunter-scientific-coherence-proves-logos","title":"Scientific Coherence Proves the Logos — Proof by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"01ee98668d7a09ff6dd69745d4864cc5e86f7e129124726585ea6e7510b256ce","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:32.234Z","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:31.083Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{A, B, C, D} |= (A & B) & (C & D)","sourceOffset":755,"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","B","C","D"],"conclusion":"(A & B) & (C & D)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && 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"}],"files":{"source.json":{"sha256":"79defa51d0078a914a5df23fa660f77ac9899a1cbf5e3f22f5cc39dc721c24dc","bytes":1769},"Proof.lean":{"sha256":"24eeb494d0149f5426ead4b65d590ec68ac07e1758361ca871c8d7beb9a8dda7","bytes":526},"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."},{"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."},{"slug":"hunter-scripture-logical-standard","identifier":"hunter-scripture-logical-standard","title":"Scripture and the Logical Standard","author":"Maclain Hunter","sourceSha256":"28c8195e881dd3b1e9aaaa6660c350b102da7c049151960c6faf600833e811ba","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:07.032Z","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:33.794Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) & R","sourceOffset":1603,"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","Q -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!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":"566a6e6c00842c66902d8feb964ffcc61da04222145211677588418dc986540a","bytes":3087},"Proof.lean":{"sha256":"2126f5493b4a36ca8108e2581cc6a34c88b12704beaaa7626ad91cf2aa09a0ea","bytes":485},"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."},{"slug":"hunter-search-logically-find-logic","identifier":"hunter-search-logically-find-logic","title":"Search Logically and Find Logic","author":"Maclain Hunter","sourceSha256":"22b720ebc9f0b9839ed7142b0bcb050d7801c6f4751fac4c687739c6168299de","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:54.990Z","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:34.763Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":464,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"71409a3022f61687019fc4f674c25ce50fdcc9437e64187532524c99d985e370","bytes":2896},"Proof.lean":{"sha256":"54b248b072addc358c914200dbd9923f4a95ee618e64eaee10a21a5e1d5f64a0","bytes":383},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-second-sieve","identifier":"hunter-second-sieve","title":"Second Sieve","author":"Maclain Hunter","sourceSha256":"72acc8098548198cf5a8796fee2ecc19ff9c9c8a1211c456b106885e6bc7788a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:56.133Z","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:35.908Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q, Q <-> R} |= R -> (Q <-> P)","sourceOffset":226,"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","Q <-> R"],"conclusion":"R -> (Q <-> P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 == v1) && (v1 == v2))) || ((!v2) || (v1 == v0))) = 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":"c5304ee482866a647060474d9c3b85448f3ddfaa916d7fb6cf5c51006c09f7d2","bytes":845},"Proof.lean":{"sha256":"0a25501702f3c845b94cf23381048b5bec7492e72a2521e0ecd22ce7e0fcf66b","bytes":452},"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."},{"slug":"hunter-second-timeless-superspace","identifier":"hunter-second-timeless-superspace","title":"Second Timeless-Superspace Theorem","author":"Maclain Hunter","sourceSha256":"d1c042cc0c5a15c5dca764a232ed24775e8d7603212cc6f3781c653ac15c03d0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:32:42.375Z","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:37.375Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":1542,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"aee3e85588aae170c904ede3d8d380be262e74a3ee21ab642291b6ed99429ff2","bytes":2773},"Proof.lean":{"sha256":"eeaa31f3b70f2ee8a270dddfb00568fd694e9aed4bd0f5c073836e51edac0506","bytes":386},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-seeing-logos-identity","identifier":"hunter-seeing-logos-identity","title":"Seeing Logos Through Identity","author":"Maclain Hunter","sourceSha256":"8320ce53ca6cdcb8af453f2bf8c9faf4f6f2a572a80e6a61bf9010572953199a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:30.689Z","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:38.610Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= (P -> (P & Q)) -> (P & (Q & R))","sourceOffset":221,"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","Q -> R"],"conclusion":"(P -> (P & Q)) -> (P & (Q & R))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((!((!v0) || (v0 && 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"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":68,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"c2d902c2f8735c6d4656e51389f2085afd0dc87086f56531695a387697015f2f","bytes":859},"Proof.lean":{"sha256":"f6dc612ddbd594c06e16a7c0ee9eb311544837d37f36e8723315af59e44fcdd8","bytes":611},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"archived-q1047-6ebffff22927","identifier":"archived-q1047-6ebffff22927","title":"Self-Entailing Rationality","author":"Maclain Hunter","sourceSha256":"6ebffff22927ec193db8bf26377e48e100a8a2abb46bf96ba1ab470146c0ada1","sourceKind":"archived-authored-source","recordedAt":null,"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:38.612Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"3bccbe387286cabb513b3b0c88c3a3090656d7306d705afec0d5de28bfb899fd","bytes":1454},"Proof.lean":{"sha256":"7d5d7d59b88279592df5545410d9b88ecf7e9cf7790f0d1e9c2239f77e9c753c","bytes":278},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"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."},{"slug":"hunter-self-evident-grasp-logic","identifier":"hunter-self-evident-grasp-logic","title":"Self-Evident Grasp of Logic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"c6151c7972859a75970f946e40b5556402deb37aa6a29864292b2cdbf40f47af","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T17:13:06.558Z","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.503Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"acdba9bd9c98795ba65db17b4c6a62420c46e37a07454087d0766302b8256d17","bytes":875},"Proof.lean":{"sha256":"0f4c58e4d87a087cf58356c4bcdeec4183f5f89d1e9952cd7a240f7192736255","bytes":297},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-self-evident-logical-foundations","identifier":"hunter-self-evident-logical-foundations","title":"Self-Evident Proof of Logical Foundations by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"94312d335a11ba8fe5c2b20fb4e275da62ed7de796977b38248ac578cb704d6e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:06.784Z","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:40.534Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, R, R -> P, R -> Q, S, S -> U, T, T -> U, U} |= ((P & Q) & (R & S) & T) & U","sourceOffset":8060,"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","T","U"],"premises":["P","P <-> Q","R","R -> P","R -> Q","S","S -> U","T","T -> U","U"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((((((v0 && (v0 == v1)) && v2) && ((!v2) || v0)) && ((!v2) || v1)) && v3) && ((!v3) || v5)) && v4) && ((!v4) || v5)) && v5)) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":6352,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"314c2b6c380d6153adca09ed71d2606b5543c72a8caa11b5746b4b0afeb2a862","bytes":15798},"Proof.lean":{"sha256":"85719e5750ecce7bd2a0273813459fbeace071208e291a987d2676fda98bd2c2","bytes":769},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-self-supporting-generation","identifier":"hunter-self-supporting-generation","title":"Self-Supporting Generation by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"6f9572f429bafbfe348e6578ea13c1c3928df4503d967fe9b71dd93ed7449e59","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T15:32:31.078Z","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:41.681Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T, T <-> U, U <-> P} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":632,"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","T","U"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T","T <-> U","U <-> P"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!((((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4)) && (v4 == v5)) && (v5 == v0))) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T, T <-> U, U <-> P} |= ((((P & Q) & R) & S) & T) & U","sourceOffset":2306,"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","T","U"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T","T <-> U","U <-> P"],"conclusion":"((((P & Q) & R) & S) & T) & U","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!((((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4)) && (v4 == v5)) && (v5 == v0))) || (((((v0 && v1) && v2) && v3) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"source_identity_rule","sourceStatement":"Logic is Logic","sourceOffset":2444,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"3c4a13a1108afb6a9968808c34a53bee1da0b52f6ab6489a8d14dd7a6557a1ab","bytes":3714},"Proof.lean":{"sha256":"1cb9620b5c62730148ca8669db3f4715051c86c544a0d4de7a74e2164f641c9d","bytes":1056},"lean-check.txt":{"sha256":"40b7da001d5d78d36b6960c8ae1b7c13a2ea6cf5f9da51ea55e40e490d78ea16","bytes":242}},"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."},{"slug":"formal-seven-cycle-logic-completeness","identifier":"formal-seven-cycle-logic-completeness","title":"Seven Cycle Logic Completeness","author":"Maclain Hunter","sourceSha256":"654f95901f1705d915a4354df1489a5498c1c8950014548c0ac177e91e874e61","sourceKind":"formal-theorem","recordedAt":null,"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:42.846Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.valid_unit_seven_checks","HunterAuthored.source_identity_rule"],"units":[{"id":"valid_unit_seven_checks","sourceStatement":"Formal statement: ∀u ∈ ValidMCBUnit: SevenCycle(u).cycleComplete = true","sourceOffset":0,"scope":"The seven displayed mathematical invariants for an admitted typed valid unit. Coherence/lawfulness are explicit admission evidence, not freely assigned flags. Runtime evidence that state matches the computed exponent, and execution of the host gate routine, remain separate.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def cycleSigned (b : Bool) : Int := if b then 1 else -1\nstructure ValidCycleUnit where\n  value : Int\n  state : Bool\n  depth : Nat\n  coherent : Bool\n  lawful : Bool\n  logosCoherence : coherent = true\n  logosLawful : lawful = true\ndef sevenChecks (u : ValidCycleUnit) : Prop :=\n  u.value = u.value ∧\n  ¬(cycleSigned u.state = 1 ∧ cycleSigned u.state = -1) ∧\n  (cycleSigned u.state = 1 ∨ cycleSigned u.state = -1) ∧\n  (u.coherent = true ∧ u.lawful = true) ∧\n  cycleSigned u.state = cycleSigned u.state ∧\n  (cycleSigned u.state = 1 ∨ cycleSigned u.state = -1) ∧\n  0 ≤ u.depth\ntheorem valid_unit_seven_checks (u : ValidCycleUnit) : sevenChecks u := by\n  refine ⟨rfl, ?_, ?_, ⟨u.logosCoherence, u.logosLawful⟩, rfl, ?_, Nat.zero_le u.depth⟩\n  · cases u.state <;> decide\n  · cases u.state\n    · exact Or.inr rfl\n    · exact Or.inl rfl\n  · cases u.state\n    · exact Or.inr rfl\n    · exact Or.inl rfl\n#print axioms valid_unit_seven_checks\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.valid_unit_seven_checks"},{"id":"source_identity_rule","sourceStatement":"A = A","sourceOffset":152,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"a9c73a34a51329f021dfad3947b409b1924140935e45cfdcfe1a64bb19d75378","bytes":1135},"Proof.lean":{"sha256":"6cb9bca44d2c08dae3ac711bf48e5014c18251eaf3fc31cdcc95bcc973d59a1d","bytes":1351},"lean-check.txt":{"sha256":"d44fad022cafaa113056e6cb57b4ec5a7ea60357f9e39dcc8f0883d3237d3148","bytes":195}},"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."},{"slug":"archived-q1059-edf5435c94cf","identifier":"archived-q1059-edf5435c94cf","title":"Seven Cycle Logic Completeness","author":"Maclain Hunter","sourceSha256":"edf5435c94cf8ae9f45ff709cfdbf56a5aa755162443eae3aa84ada56bcea050","sourceKind":"archived-authored-source","recordedAt":null,"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:43.858Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.valid_unit_seven_checks","HunterAuthored.source_identity_rule"],"units":[{"id":"valid_unit_seven_checks","sourceStatement":"{\n  \"name\": \"Seven Cycle Logic Completeness\",\n  \"formal\": \"∀u ∈ ValidMCBUnit: SevenCycle(u).cycleComplete = true\",\n  \"proof\": \"Each step follows from MCB construction invariants\",\n  \"steps\": [\n    \"Identity (A = A)\",\n    \"Non-Contradiction (¬(A ∧ ¬A))\",\n    \"Excluded Middle (A ∨ ¬A)\",\n    \"Logos Alignment\",\n    \"MCB Parity\",\n    \"4P Validation\",\n    \"Halting Proof\"\n  ]\n}","sourceOffset":0,"scope":"The seven displayed mathematical invariants for an admitted typed valid unit. Coherence/lawfulness are explicit admission evidence, not freely assigned flags. Runtime evidence that state matches the computed exponent, and execution of the host gate routine, remain separate.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def cycleSigned (b : Bool) : Int := if b then 1 else -1\nstructure ValidCycleUnit where\n  value : Int\n  state : Bool\n  depth : Nat\n  coherent : Bool\n  lawful : Bool\n  logosCoherence : coherent = true\n  logosLawful : lawful = true\ndef sevenChecks (u : ValidCycleUnit) : Prop :=\n  u.value = u.value ∧\n  ¬(cycleSigned u.state = 1 ∧ cycleSigned u.state = -1) ∧\n  (cycleSigned u.state = 1 ∨ cycleSigned u.state = -1) ∧\n  (u.coherent = true ∧ u.lawful = true) ∧\n  cycleSigned u.state = cycleSigned u.state ∧\n  (cycleSigned u.state = 1 ∨ cycleSigned u.state = -1) ∧\n  0 ≤ u.depth\ntheorem valid_unit_seven_checks (u : ValidCycleUnit) : sevenChecks u := by\n  refine ⟨rfl, ?_, ?_, ⟨u.logosCoherence, u.logosLawful⟩, rfl, ?_, Nat.zero_le u.depth⟩\n  · cases u.state <;> decide\n  · cases u.state\n    · exact Or.inr rfl\n    · exact Or.inl rfl\n  · cases u.state\n    · exact Or.inr rfl\n    · exact Or.inl rfl\n#print axioms valid_unit_seven_checks\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.valid_unit_seven_checks"},{"id":"source_identity_rule","sourceStatement":"A = A","sourceOffset":208,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"791b32edebcffd3204a81a56cba0cefb4ed106ed38edfe24a2890e0457646819","bytes":966},"Proof.lean":{"sha256":"9f135799fcf554323d53acc4eba40099e08fcce17d7a91372efd6d1db2292303","bytes":1351},"lean-check.txt":{"sha256":"d44fad022cafaa113056e6cb57b4ec5a7ea60357f9e39dcc8f0883d3237d3148","bytes":195}},"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."},{"slug":"formal-signature-verification-soundness","identifier":"formal-signature-verification-soundness","title":"Signature Verification Soundness","author":"Maclain Hunter","sourceSha256":"6862cd530b23f9ac5cf15008ce12cdc1198590279b5d5162069f0e8d016aa25e","sourceKind":"formal-theorem","recordedAt":null,"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:45.014Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.generated_signature_invariants"],"units":[{"id":"generated_signature_invariants","sourceStatement":"Formal statement: ∀v ∈ number[]: verifySignature(generateSignature(v)) = true","sourceOffset":0,"scope":"The exact depth, product and signed-state invariants listed in the authored proof, for every integer input list and deterministic parity function. Host hash encoding, floating-point intake and the Boolean verifier implementation are not substituted for this typed mathematical certificate.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def signatureSigned (b : Bool) : Int := if b then 1 else -1\ndef signatureValue : List Bool → Int\n  | [] => 1\n  | b :: bs => signatureSigned b * signatureValue bs\nstructure LogicalSignature where\n  sequence : List Bool\n  depth : Nat\n  value : Int\ndef generatedSignature (values : List Int) (parity : Int → Bool) : LogicalSignature :=\n  let sequence := values.map parity\n  ⟨sequence, sequence.length, signatureValue sequence⟩\ndef signatureInvariants (s : LogicalSignature) : Prop :=\n  s.depth = s.sequence.length ∧\n  s.value = signatureValue s.sequence ∧\n  ∀ b : Bool, b ∈ s.sequence → (signatureSigned b = 1 ∨ signatureSigned b = -1)\ntheorem generated_signature_invariants (values : List Int) (parity : Int → Bool) :\n    signatureInvariants (generatedSignature values parity) := by\n  refine ⟨rfl, rfl, ?_⟩\n  intro b _\n  cases b\n  · exact Or.inr rfl\n  · exact Or.inl rfl\n#print axioms generated_signature_invariants\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.generated_signature_invariants"}],"files":{"source.json":{"sha256":"c6c7892dc7e53e5407c32ba12c88661ba3f51796489a4d1832d48a0272e9a409","bytes":810},"Proof.lean":{"sha256":"1740da56ec020dea99d4722e8dd1aa93ae456603dba9306faaa14974aa46275a","bytes":1226},"lean-check.txt":{"sha256":"fbf9eb7a156f018c4a80ca3e05cb500d2b2e76511332af9ae1d93e01b74e693d","bytes":134}},"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."},{"slug":"archived-q1062-b4197f693207","identifier":"archived-q1062-b4197f693207","title":"Signature Verification Soundness","author":"Maclain Hunter","sourceSha256":"b4197f693207ff6b4de675095274785aac53984cc3811df745f0508287961f07","sourceKind":"archived-authored-source","recordedAt":null,"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:45.986Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.generated_signature_invariants"],"units":[{"id":"generated_signature_invariants","sourceStatement":"{\n  \"name\": \"Signature Verification Soundness\",\n  \"formal\": \"∀v ∈ number[]: verifySignature(generateSignature(v)) = true\",\n  \"proof\": \"Verification recomputes the same invariants as generation\",\n  \"implementation\": \"generateSignature, verifySignature\"\n}","sourceOffset":0,"scope":"The exact depth, product and signed-state invariants listed in the authored proof, for every integer input list and deterministic parity function. Host hash encoding, floating-point intake and the Boolean verifier implementation are not substituted for this typed mathematical certificate.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def signatureSigned (b : Bool) : Int := if b then 1 else -1\ndef signatureValue : List Bool → Int\n  | [] => 1\n  | b :: bs => signatureSigned b * signatureValue bs\nstructure LogicalSignature where\n  sequence : List Bool\n  depth : Nat\n  value : Int\ndef generatedSignature (values : List Int) (parity : Int → Bool) : LogicalSignature :=\n  let sequence := values.map parity\n  ⟨sequence, sequence.length, signatureValue sequence⟩\ndef signatureInvariants (s : LogicalSignature) : Prop :=\n  s.depth = s.sequence.length ∧\n  s.value = signatureValue s.sequence ∧\n  ∀ b : Bool, b ∈ s.sequence → (signatureSigned b = 1 ∨ signatureSigned b = -1)\ntheorem generated_signature_invariants (values : List Int) (parity : Int → Bool) :\n    signatureInvariants (generatedSignature values parity) := by\n  refine ⟨rfl, rfl, ?_⟩\n  intro b _\n  cases b\n  · exact Or.inr rfl\n  · exact Or.inl rfl\n#print axioms generated_signature_invariants\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.generated_signature_invariants"}],"files":{"source.json":{"sha256":"b9dba0294370b880fd6ccabbfdf1f2542d69976310958b426a4df224e1b5a724","bytes":821},"Proof.lean":{"sha256":"1c849475ab353119b49ab8fc6898c9cd31c5ee80a4cce04909828a110a2b78e3","bytes":1226},"lean-check.txt":{"sha256":"fbf9eb7a156f018c4a80ca3e05cb500d2b2e76511332af9ae1d93e01b74e693d","bytes":134}},"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."},{"slug":"hunter-since-so-reasoning","identifier":"hunter-since-so-reasoning","title":"Since-So Reasoning by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"1eace0e70fc8d3dbf3e8bbcb00fa01ee94980aa1d100057d6732ea28b3fb8bd7","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T19:42:37.518Z","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:46.929Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q} |= P & Q","sourceOffset":556,"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"],"premises":["P","P -> Q","Q"],"conclusion":"P & Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && v1)) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"885d8485e4d6306c4806fd125b19f9f1cbc49e79fdc925865f64d4ad5e51b21a","bytes":2426},"Proof.lean":{"sha256":"e2f053ce2b73cc1449e491fa50e5a73b4f6825392e28316658cb2d92ddfd0007","bytes":452},"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."},{"slug":"hunter-soundness-logos","identifier":"hunter-soundness-logos","title":"Soundness and Logos","author":"Maclain Hunter","sourceSha256":"afe9dfed33333d01a571f53e6596d6fb1690e0bc1947811b25e32248b4a4d314","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T22:14:04.048Z","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:46.932Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"2f4e445a1b3ce9d28f1683e56cbd0be8946e1a0626e5d6afb92500556fb66b0b","bytes":778},"Proof.lean":{"sha256":"bde9e5204e9bf5ea9134b707bac2d889c7ed2751c8e497e53607ed989a90b677","bytes":271},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-stipulated-god-judgment-swapped-copy","identifier":"hunter-stipulated-god-judgment-swapped-copy","title":"Stipulated God and Judgement — Swapped-Premise Version","author":"Maclain Hunter","sourceSha256":"d99c9d9a1176fcfdc26004d7436ec7cad8595ca8ca79965c702c1795e90a77df","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:22.388Z","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:48.022Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) -> R","sourceOffset":245,"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","Q -> R"],"conclusion":"(P & Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!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":"c19df2729b4b2621d86ebe8889d65fd5d7e8247b6377859fbb921ede82caffe7","bytes":896},"Proof.lean":{"sha256":"8598b1d6b80182978da8b163c495e1f61fce43b7841f12cff0e3d4d27fac8216","bytes":510},"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."},{"slug":"hunter-stipulated-god-judgment","identifier":"hunter-stipulated-god-judgment","title":"Stipulated God and the Ground of Judgement","author":"Maclain Hunter","sourceSha256":"f738e5d7a1e5db1a3b33898409c62670952d456820ef94b7ea23c7f6f917bd23","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:22.317Z","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:48.965Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= (P & Q) -> R","sourceOffset":244,"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","Q -> R"],"conclusion":"(P & Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!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":"ba06e2e60bfba67306dad8d864ba1e680f803f630d912249e41abe6dfdd3300f","bytes":867},"Proof.lean":{"sha256":"01bbf78bb80f3910da3e5fec6a684acd779f822c8a3bdcd92c6aac60206fcd6c","bytes":496},"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."},{"slug":"hunter-stoicism-epistemology","identifier":"hunter-stoicism-epistemology","title":"Stoicism and Grounded Epistemology","author":"Maclain Hunter","sourceSha256":"9ed5b55d1e966114ebc74967788cd5366ad9ab34a6c05f6de037c2072e3c87e5","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:57.286Z","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:49.886Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q} |= Q <-> P","sourceOffset":240,"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"],"premises":["P","P <-> Q"],"conclusion":"Q <-> P","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 && (v0 == v1))) || (v1 == v0)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"7e94d50794c46f032582d0d245aa0832767414fe8c2dd5ab20b2e10f4723bf38","bytes":846},"Proof.lean":{"sha256":"a51e92748307c495c7ef7f5437e6e00fd708f953a635ee1f2dbf58b5b3470398","bytes":439},"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."},{"slug":"hunter-subsistence-actualization","identifier":"hunter-subsistence-actualization","title":"Subsistence, Existence, and Actualization","author":"Maclain Hunter","sourceSha256":"a36c0bbd239021c9fe95b79a38596f650c5ce4386025a99423f5541e79a8e3e5","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:32.777Z","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:50.818Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> (Q & R)} |= R <-> (Q & P)","sourceOffset":245,"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)"],"conclusion":"R <-> (Q & P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(v0 && ((!v0) || (v1 && v2)))) || (v2 == (v1 && v0))) = 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":"49884e6a21a41dcf0fadd37fbf6ea098e7f36eeb25f00d33f3a24606fed17332","bytes":874},"Proof.lean":{"sha256":"4b44c8554339f3f1750a9e335995d710cb7e94b3e3819e7efde51383f5ad3eee","bytes":481},"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."},{"slug":"hunter-substantive-form-energy-asr","identifier":"hunter-substantive-form-energy-asr","title":"Substantive Energy, Energy in Form, and ASR","author":"Maclain Hunter","sourceSha256":"07ce482a1a74b675f715edda3ceea3bdc4fd46fb7747b67b51e781289d28d32a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:12:06.343Z","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:50.821Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P -> Q, (P & Q) -> R} |= (P & Q) & R","sourceOffset":231,"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","(P & Q) -> R"],"conclusion":"(P & Q) & R","status":"countermodel","countermodel":{"P":false,"Q":false,"R":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"d758944e4e1363fe61f6d1186589645d67a2c62628387ee49f5dff9cc75ec422","bytes":874},"Proof.lean":{"sha256":"76164f9fe285600883f3e3d2f59124b14bb44e4a354657cb3740e9c28eed7400","bytes":295},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-system-h","identifier":"hunter-system-h","title":"System H","author":"Maclain Hunter","sourceSha256":"4b81cd82480df8f561c9cd48dae5d241e46717c2104895c192e0c299ce8e9c0e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:39.312Z","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:50.823Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"1dfbae5ba8eb3056ad8012101c7a7bd56df49a618c8d94f1b6c3d9116eaca689","bytes":3803},"Proof.lean":{"sha256":"5daf2d6ee55dfd0860536672387a94d19b76a1d090a5217ded6ee88124abdbda","bytes":260},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-tautological-formal-systems","identifier":"hunter-tautological-formal-systems","title":"Tautological Formal Systems of Logic","author":"Maclain Hunter","sourceSha256":"a8c841517693417574606e51b96d4f36bb87ffec3a3a2489ff0c88f134cfa539","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:12.666Z","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:51.768Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, P <-> Q} |= (P & Q) & ~~(P & Q)","sourceOffset":236,"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"],"premises":["P","Q","P <-> Q"],"conclusion":"(P & Q) & ~~(P & Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && v1) && (v0 == v1))) || ((v0 && v1) && (!(!(v0 && v1))))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"3f40d50690b4c0852d5d9824ea88048afe872a974d3cc9839ecaa91df1ccf32e","bytes":874},"Proof.lean":{"sha256":"131e64ef06f724dbeb0a0491d79bb43e9da6ec45ab36bb5f55d10814919c75db","bytes":471},"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."},{"slug":"hunter-tautological-mastery","identifier":"hunter-tautological-mastery","title":"Tautological Mastery by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"0b204d1d90a8b1707a3f19271300756d029ea461fef5a20542c6f4bcb36c3d60","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:10:32.310Z","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:51.770Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"97aa4957a52b92c2676b90c3187d4136aedcefede2199ca551db2be520a55ea9","bytes":1017},"Proof.lean":{"sha256":"57d3657f117be9f36b55c6ccb669b9969b266ddc3c0cc3adc72d7e43e742e98b","bytes":290},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"formal-tautological-sieve","identifier":"formal-tautological-sieve","title":"Tautological Sieve","author":"Maclain Hunter","sourceSha256":"9ef24015eeb741e6e8aae4c48216cdd856cd9612dad1c271d62de479b116d515","sourceKind":"formal-theorem","recordedAt":null,"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:52.679Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P ↔ Q, Q ↔ R} |= R → (Q ↔ P)","sourceOffset":18,"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","Q ↔ R"],"conclusion":"R → (Q ↔ P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 == v1) && (v1 == v2))) || ((!v2) || (v1 == v0))) = 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":"c37298c3ed4cdcf48def48c5f148ef8680edea65967a2560f4e6fe8419f41fd1","bytes":758},"Proof.lean":{"sha256":"78e41099d6a78d2327ab381efafad00cb6aaf8c21becf97d79ba536107f02e6b","bytes":458},"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."},{"slug":"archived-q1065-170b83f87aff","identifier":"archived-q1065-170b83f87aff","title":"Tautological Sieve","author":"Maclain Hunter","sourceSha256":"170b83f87affcfac1f15fcf09329c6a222e49f710c69b7f219395fea02712732","sourceKind":"archived-authored-source","recordedAt":null,"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:53.573Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P ↔ Q, Q ↔ R} |= R → (Q ↔ P)\",","sourceOffset":47,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \"\\\",\"","kernelStatus":"not_checked"},{"id":"source_identity_rule","sourceStatement":"A = A","sourceOffset":775,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"57e506f849e4bd1316b9a1a0fdb2fe1b3155de5de6cb872193984f3ccbd0ade0","bytes":1491},"Proof.lean":{"sha256":"f92ef3e4f3ac59e9996164077bf949280d2ab6cd1b34a0d0dcf81e06cae85e60","bytes":370},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-tautological-true-statements","identifier":"hunter-tautological-true-statements","title":"Tautological True Statements & Convincing Deductive Reasoning by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"21470014aecf24939393bd5d205181b4e58e5313c692e5a8a18a8717918e15b0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:20:16.589Z","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:54.456Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":2244,"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":"source_identity_rule","sourceStatement":"A is A","sourceOffset":531,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"749a1e26f2ae6af3a0a3b75d078acd23bd9540636f46d63358c4c9fc620a1f82","bytes":3910},"Proof.lean":{"sha256":"5429248f10c9dfc3ff570886e590a583c9bbf8b66032e2099124f284597faf8f","bytes":665},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-appearance-of-a-paradox","identifier":"hunter-appearance-of-a-paradox","title":"The Appearance of a Paradox by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"6b440525a80e6efd2ba6d948fe46ecc50df305a92b5d7f8c5cc7d2e5a54cb068","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T15:32:29.681Z","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:55.398Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T, T <-> U} |= (((P & Q) & (R & S)) & T) & U","sourceOffset":1936,"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","T","U"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T","T <-> U"],"conclusion":"(((P & Q) & (R & S)) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4)) && (v4 == v5))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"356d850a9ae1f860ba7517c3d2ddf70844de3a67ed744f285c2023c85889db01","bytes":7311},"Proof.lean":{"sha256":"c0aa2b4b05dcc94cce60f5c8e889c489e2844d0e0d6c63826877101f622668e0","bytes":610},"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."},{"slug":"hunter-the-atheists-truth","identifier":"hunter-the-atheists-truth","title":"The Atheist’s Truth by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"aee3ff5f237aec81e5f784fff7c4179daa06b0279d71944884e2f6166f196017","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:20:54.245Z","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:56.255Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (P & Q) -> R","sourceOffset":864,"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"],"conclusion":"(P & Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && 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":"7355b3eef3e9a2a1674cd0f44858b3dd201279331c138ad3e5a03aefd383fa09","bytes":2152},"Proof.lean":{"sha256":"5fe17342f2ffaf2d269ac8f21479b63f05d119e0aeb15d791ef19f68dcec70d2","bytes":471},"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."},{"slug":"hunter-geometry-received-copy","identifier":"hunter-geometry-received-copy","title":"The Axiom of Geometry — Full Supplied Copy","author":"Maclain Hunter","sourceSha256":"300affdcd708e7b2a90581dbe1f692b1194f53b2d33f645bf720074ae6e76925","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:58.220Z","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:57.191Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.inference_3","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S} |= (P & Q) <-> (R & S)","sourceOffset":11383,"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","Q","R","S"],"conclusion":"(P & Q) <-> (R & S)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && 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":"{P, P <-> Q, Q <-> R} |= (P & Q) & R","sourceOffset":25265,"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","Q <-> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v0 == v1)) && (v1 == v2))) || ((v0 && v1) && v2)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{a, a <-> b, b <-> c, c <-> d} |= (d -> c) -> (b -> a)","sourceOffset":26088,"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","c <-> d"],"conclusion":"(d -> c) -> (b -> a)","status":"candidate","leanStatement":"theorem inference_3 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3))) || ((!((!v3) || v2)) || ((!v1) || v0))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_3\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_3"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":2054,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"0b4da4779480f20663fbaf9b21452936a0674a7a6c34eafcc99f58926e174271","bytes":29005},"Proof.lean":{"sha256":"cf2e54b5c52fb2aec866a43c0879f18683fef92934fe06f79cf91d9c9e3c16da","bytes":1043},"lean-check.txt":{"sha256":"b2a13c78d5e07cc13897edfa6e4ad95b717a32423f43c97d6c342c394c93869c","bytes":301}},"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."},{"slug":"hunter-bible-reality-finite-mind-mirror","identifier":"hunter-bible-reality-finite-mind-mirror","title":"The Bible and Reality as a Mirror to the Finite Mind","author":"Maclain Hunter","sourceSha256":"0c2b7a3147d81fb1e6556b15020dcfeaa93bd2fd96707f6738620c539d220f8f","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:22.822Z","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:57.194Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"2d475204d02046b7a8534784256c3f28a541a9810325fa83be09d9755f5dfcda","bytes":1476},"Proof.lean":{"sha256":"ea75f28e7f918b659ea3f0e2e948895328b1970507f93f9497ad4bff73153eec","bytes":304},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-bonded-energy-physical-output","identifier":"hunter-bonded-energy-physical-output","title":"The Bonded Energy System and Physical Output Path","author":"Maclain Hunter","sourceSha256":"84f4a532345385f2d1c1141d7d2368d890377e765767b18d8be8b173c1d4df04","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:12:08.806Z","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:58.069Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P -> Q} |= (P -> P) -> (Q -> Q)","sourceOffset":236,"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"],"premises":["P -> Q"],"conclusion":"(P -> P) -> (Q -> Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((!v0) || v1)) || ((!((!v0) || v0)) || ((!v1) || v1))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"d10b2e8263d9d54ecc443a7e28cbdfffc6dc9720cb099a543ac9c4051b96193b","bytes":874},"Proof.lean":{"sha256":"1551baae7d2102bccaa6ae42876e03c6492115c24124ccab0771c45eb9bb17a3","bytes":474},"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."},{"slug":"hunter-dialogue-cosmic-genesis","identifier":"hunter-dialogue-cosmic-genesis","title":"The Dialogue of Cosmic Genesis","author":"Maclain Hunter","sourceSha256":"3481ea6c76bcb432bf1fa4b065b6affe3c4342afb6006fa9e1ab15da7c8cb3af","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:27.557Z","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:58.929Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":880,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"22a0132f962c051adaea71db1ddbac3feffd4a617f013ba61d4c8af285bc66e2","bytes":2959},"Proof.lean":{"sha256":"01f67be1c910202c6a142dec13b3e78e9f5215e1d1659e8d865c2614f22fa206","bytes":382},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"archived-q1049-8cbad4face92","identifier":"archived-q1049-8cbad4face92","title":"The Ego of Logic and Reflexive Identity","author":"Maclain Hunter","sourceSha256":"8cbad4face927fe201a17be5f29c4d39c46266c00d8cb9d34f3008d2383611a8","sourceKind":"archived-authored-source","recordedAt":null,"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:59.836Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{I, I <-> ~(~I v (I & ~I))} |= I & ~~I","sourceOffset":63,"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"],"premises":["I","I <-> ~(~I v (I & ~I))"],"conclusion":"I & ~~I","status":"candidate","leanStatement":"theorem inference_1 (v0 : Bool) :\n    ((!(v0 && (v0 == (!((!v0) || (v0 && (!v0))))))) || (v0 && (!(!v0)))) = true := by\n  cases v0 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"8bc7aad993d5785fe7a05e2889bee94fa615d106f2193f243100fb2f385d375c","bytes":653},"Proof.lean":{"sha256":"92cc44a965aed596d0e9d8eed4c1a0760c72646a4bcb22ab9b6cf4373620691c","bytes":459},"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."},{"slug":"maclain-hunter-falseness-of-falsifiability","identifier":"maclain-hunter-falseness-of-falsifiability","title":"The Falseness of Falsifiability by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"f73d4a7c5b829d1f96652209359d2510180a141ee2bf52d1889887ce5a65ca3b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:20:06.223Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:00.707Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":2400,"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"}],"files":{"source.json":{"sha256":"366a1094dbb6bdfa33dad4d23b0e2547af6ee4a9a2304dd1879a36191625d16f","bytes":6220},"Proof.lean":{"sha256":"8a6e6f54c4e008607287f1ca95b30e03bfaefed50fde71aa77a8fff04a648e05","bytes":534},"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."},{"slug":"hunter-famous-logic","identifier":"hunter-famous-logic","title":"The Famous Logic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"5682e034418c7b82c0587ecd5b51fef53868d42f980471958c988a2e2daab059","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:46:50.046Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:01.565Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S} |= ((P & Q) & (R & S)) v ~((P & Q) & (R & S))","sourceOffset":1493,"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)) v ~((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)) || (!((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"}],"files":{"source.json":{"sha256":"8377b1c3dcdbff4dd2d7f936cd3f3e7ef818003905a420359d32428d870bbfef","bytes":3887},"Proof.lean":{"sha256":"ff09978ab069c16ede036edb819b87afefd72b649cccefe0768e80b6e0fc7c2e","bytes":563},"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."},{"slug":"hunter-illogical-origin-futility","identifier":"hunter-illogical-origin-futility","title":"The Futility and Result of Conceiving Illogical Origins by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"c07ed80f9ce0e7d011dac96a99e00f0942ebd7f7636a8c3f0ed83141662bb7f9","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:27.048Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:02.492Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S, T, U} |= ((P & Q) & (R & S)) <-> (T & U)","sourceOffset":2226,"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","T","U"],"premises":["P","Q","R","S","T","U"],"conclusion":"((P & Q) & (R & S)) <-> (T & U)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((v0 && v1) && v2) && v3) && v4) && v5)) || (((v0 && v1) && (v2 && v3)) == (v4 && v5))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"3888d764a6501f699bbae5af5a379146eae5ae1c0026cf0cb59976af9434238b","bytes":5977},"Proof.lean":{"sha256":"23d0968db6049e3d7b8350f03f6c157c7a397042805e4c87246dd9133fef67af","bytes":598},"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."},{"slug":"hunter-genuine-musician-received-copy","identifier":"hunter-genuine-musician-received-copy","title":"The Genuine Musician — Additional Supplied Copy","author":"Maclain Hunter","sourceSha256":"3605fb262ad640a69ef6f0af2edc8a51b410cf6316f44728c5610ae050cb171c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:46.794Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:03.398Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= ((P & Q) & (R & S)) <-> T","sourceOffset":4756,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"((P & Q) & (R & S)) <-> T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || (((v0 && v1) && (v2 && v3)) == v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"dfaf340980571fc20797c64146e7598a15b10f6b4ef0e1b47d90335209aa3437","bytes":13068},"Proof.lean":{"sha256":"cfa32b7da62b841536795cfd59a0cb4191940a60b8b341ad0f57718545bf7ec5","bytes":586},"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."},{"slug":"hunter-genuine-musician","identifier":"hunter-genuine-musician","title":"The Genuine Musician by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"38f29ec7091d1741fa2b07b9d243e1a3c9f78dcd57776f520005972417c190d4","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T19:42:31.693Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:04.301Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= ((P & Q) & (R & S)) <-> T","sourceOffset":4756,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"((P & Q) & (R & S)) <-> T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || (((v0 && v1) && (v2 && v3)) == v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"02692046962d16008e92908f928e860074eb0082702fb76c364434d4d39a1b0e","bytes":12599},"Proof.lean":{"sha256":"321b60ffa9e492305e4b5c1157e7daa2d3e5e41b27b7f4de0079adab8ce78092","bytes":575},"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."},{"slug":"hunter-reason-origin-isomorphic-identity","identifier":"hunter-reason-origin-isomorphic-identity","title":"The God of Reason and the Isomorphic Logical Origin","author":"Maclain Hunter","sourceSha256":"458dbc17c53f2d20dbd7d4cb11f0a8ff3e3dd273ef3ea203402362b3df2a5fcc","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:11.644Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:04.304Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"adc60a2a9b4a8f8247472748ec30dec16b628108d8ced75e119a0c85ad1d1c11","bytes":1489},"Proof.lean":{"sha256":"ad357a39cbb49cd43cea0594b7e26f563dd331269617c7780814b1284620f773","bytes":303},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-the-gold-is-mine","identifier":"hunter-the-gold-is-mine","title":"The Gold is Mine by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"14525aad430a34dd90f7387a496c6a6b21e722420335705784c85feed8d690e2","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:00:01.163Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:05.223Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S} |= ((P & Q) & R) -> S","sourceOffset":1254,"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","Q","R","S"],"conclusion":"((P & Q) & R) -> S","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && 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":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":7935,"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_2 (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_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":6871,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"fd77a15fae49b2f01287a87e251b8d4253dd87a89bf8f82c1520ec089943fda5","bytes":13112},"Proof.lean":{"sha256":"b7654b0a2bbe61dd54a3b3878fd96d5f1286cdccdc332a0092ad06221eac850a","bytes":833},"lean-check.txt":{"sha256":"40b7da001d5d78d36b6960c8ae1b7c13a2ea6cf5f9da51ea55e40e490d78ea16","bytes":242}},"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."},{"slug":"hunter-the-gold-is-mine-second-copy","identifier":"hunter-the-gold-is-mine-second-copy","title":"The Gold is Mine by Maclain Hunter — second supplied copy","author":"Maclain Hunter","sourceSha256":"e9fcadf7c93888db45959fa75139f2ffec8a61f83ef6e691b3b933a74cb44650","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:20:47.737Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:06.117Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S} |= ((P & Q) & R) -> S","sourceOffset":1254,"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","Q","R","S"],"conclusion":"((P & Q) & R) -> S","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && 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":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":7935,"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_2 (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_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":6871,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"052b53dfc8e42c887142b4ad0fe3a24a5201a394952147cb73fcaa1747e0b74a","bytes":13151},"Proof.lean":{"sha256":"f1b91dd4c827e92304b5bcd409547249df22c513188578dfa171bd25d70b4104","bytes":858},"lean-check.txt":{"sha256":"40b7da001d5d78d36b6960c8ae1b7c13a2ea6cf5f9da51ea55e40e490d78ea16","bytes":242}},"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."},{"slug":"hunter-good-in-people","identifier":"hunter-good-in-people","title":"The Good in People by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"d0f26fd8ad64df517cefd0608ba0bf548daa06193b5f38d94cb08c846b7f6472","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:57:25.144Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:06.121Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"971c62d149c8502edd7328e027cedf8487aaa0f3870a0f69eaa8790a8ddc40df","bytes":5026},"Proof.lean":{"sha256":"fbfcca6847fd730e2c112f9cbc8c785040db89b03f4c18c5d33f8d49dccd0e7e","bytes":288},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-grand-loop","identifier":"hunter-grand-loop","title":"The Grand Loop","author":"Maclain Hunter","sourceSha256":"ce242959d2333e6dcedb61d5c33506ff698f04381a311d0b8e2944f6ea479b29","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:32:03.466Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:07.063Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P,P>Q,Q>R, R>S,S>T,T>U,U>P}\n|=((P&Q)&(R&S)&T)&U)","sourceOffset":17,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \">Q\"","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{P, P → Q, Q → R, R → S, S → T, T → U, U → P, ~(~P & ~Q & ~R & ~S & ~T & ~U)} |= ((P & Q) & (R & S) & T) & U","sourceOffset":69,"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","T","U"],"premises":["P","P → Q","Q → R","R → S","S → T","T → U","U → P","~(~P & ~Q & ~R & ~S & ~T & ~U)"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5)) && ((!v5) || v0)) && (!((((((!v0) && (!v1)) && (!v2)) && (!v3)) && (!v4)) && (!v5))))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"5868775f8efb8bf01031852837ee8bd6194781fc8fc33979abea9cf838cbf20f","bytes":3311},"Proof.lean":{"sha256":"c2db3d2497de1a71d0d4fba159a262b13988478baee3b6184559dc34c2248ba0","bytes":682},"lean-check.txt":{"sha256":"740863296048b83b7cd879ce809b9047c55288a43dfa8b77f4b45e1d50e9c3b3","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."},{"slug":"hunter-coherent-logician-standard","identifier":"hunter-coherent-logician-standard","title":"The Greatest Logician and the Coherence Standard","author":"Maclain Hunter","sourceSha256":"6ae4480106d00cd8a34c387cd4a317aad049710f1c15385b08c830ad44d8dc34","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:10:05.835Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:07.972Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, (P & Q) -> R} |= (P & Q) & R","sourceOffset":228,"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","(P & Q) -> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && ((!(v0 && 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":"22298de40cf5c7698744b36a3324d123825af1c9c68d4d32527dfba2034d5126","bytes":868},"Proof.lean":{"sha256":"be785c31ab407f6f539e14d1cb70c714255af73fa77fcf4f518ec4b48a089173","bytes":496},"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."},{"slug":"hunter-greatest-philosopher","identifier":"hunter-greatest-philosopher","title":"The Greatest Philosopher by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"7561eff1e9695e8c65568eed51a5f4247713452b6ae9daeb127409786e7dd739","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:00:08.778Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:08.852Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, P -> Q, Q -> P, P <-> Q, P & Q} |= (((P -> Q) & (Q -> P)) & (P & Q))","sourceOffset":1026,"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"],"premises":["P","Q","P -> Q","Q -> P","P <-> Q","P & Q"],"conclusion":"(((P -> Q) & (Q -> P)) & (P & Q))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(((((v0 && v1) && ((!v0) || v1)) && ((!v1) || v0)) && (v0 == v1)) && (v0 && v1))) || ((((!v0) || v1) && ((!v1) || v0)) && (v0 && v1))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"04a50dd6bba2f89ef14b2ba5c3723d1cac1ef4a0aafcf1ca9de2cf6c64b189f0","bytes":3929},"Proof.lean":{"sha256":"892a83ef647ab800b066a3dff0f33e8cfd5b80c35443cba937b75a534ade273e","bytes":547},"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."},{"slug":"hunter-grounding-of-logic","identifier":"hunter-grounding-of-logic","title":"The Grounding of Logic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"e90490726127e3c6a1bac523aa85ebbb09829f06da7ea2064e3af39d0b8b882b","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:57:52.298Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:09.739Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{A -> B, A -> C} |= A -> (B & C)","sourceOffset":2008,"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"],"premises":["A -> B","A -> C"],"conclusion":"A -> (B & C)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((!v0) || v1) && ((!v0) || 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"},{"id":"inference_2","sourceStatement":"{P, P & Q, Q & R, R & S} |= (P <-> Q) <-> (R <-> S)","sourceOffset":3012,"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_2 (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_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"source_identity_rule","sourceStatement":"Logic is Logic","sourceOffset":647,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"02f452b000a6ea41ba086bec29981c1404d4516aa4c720cd803bfc64ccf7c3e5","bytes":8874},"Proof.lean":{"sha256":"03b1519fdd0c4ffe91ecdfbf14002fe50635049423d5d90fbfb33cbfb41a7e8f","bytes":821},"lean-check.txt":{"sha256":"40b7da001d5d78d36b6960c8ae1b7c13a2ea6cf5f9da51ea55e40e490d78ea16","bytes":242}},"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."},{"slug":"hunter-holistic-integration-theorems","identifier":"hunter-holistic-integration-theorems","title":"The Holistic Integration Theorems","author":"Maclain Hunter","sourceSha256":"4431ba4bfe65b0be2ad35b89c41b5a4e992b0e3c7068f37c69f78212e3c52735","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:32:41.461Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:10.574Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":7370,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"be33ed4d4439ed009ffc71b378c89c2a3cbf67e8616b31c94283986e99bb5d78","bytes":11298},"Proof.lean":{"sha256":"4ba1d4984a02b7e154bac2e3db28516d53e65215652525e110c136c303b8057e","bytes":385},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-illogic-atheism","identifier":"hunter-illogic-atheism","title":"The Illogic of Atheism by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"6a5ce6d6604f27371da31e4f4f4820a93793b4791862daacbefaa519cf296058","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:09.241Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:10.577Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P, P, -> Q, Q -> R, R -> S, S -> T} |= (P & Q) & (R & S) & T","sourceOffset":1622,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Expected proposition identity","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"56adf30e325648274e783e31b124090df1dad9a119929ec21ca6fbf0dde49e53","bytes":3191},"Proof.lean":{"sha256":"ebd0b94689ef661283871b8905046cba1666945724f287cf53f241417e35a577","bytes":292},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-illogic-atheist-mindset","identifier":"hunter-illogic-atheist-mindset","title":"The Illogic of the Atheist Mindset by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"53449e76d2a7f444c49b953e472ada254e8e45f67fbfb788ebe1f03cdd97a684","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T17:13:02.206Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:11.454Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":1113,"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"}],"files":{"source.json":{"sha256":"0ab1834b52d9ab4c86a55999a2fe3e0f67ddb5d3617f67f93c54f1f9a69a6544","bytes":2955},"Proof.lean":{"sha256":"7a5c640833656d4b72823108286577d26aa9cf3f6a24618c24d635dec1f25b9e","bytes":537},"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."},{"slug":"archived-q1046-6c1c2f61cdb5","identifier":"archived-q1046-6c1c2f61cdb5","title":"The Law of Grounded Identity (LGI)","author":"Maclain Hunter","sourceSha256":"6c1c2f61cdb5aa6d34fa1310071618f42c09e4a5b5987e18d8f3337dc3426210","sourceKind":"archived-authored-source","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:12.339Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{(A -> A) -> L, L -> T} |= ((((A -> A) -> L) -> T) & (((A -> A) -> ~L) -> ~T))","sourceOffset":816,"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","L","T"],"premises":["(A -> A) -> L","L -> T"],"conclusion":"((((A -> A) -> L) -> T) & (((A -> A) -> ~L) -> ~T))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(((!((!v0) || v0)) || v1) && ((!v1) || v2))) || (((!((!((!v0) || v0)) || v1)) || v2) && ((!((!((!v0) || 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"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":84,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"d5ca16b3b89738184622bf5c8df3ed57f6a5944faab473e995095947d083f000","bytes":1948},"Proof.lean":{"sha256":"4482c7d24c1005964d977be5a291ef36e0f519b05fb35201e1fef5ecac184782","bytes":653},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-logic-before-time","identifier":"hunter-logic-before-time","title":"The Logic Before Time by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"2faa3875a2c83257ccf6b648c722c7f2d8ccc5aafdb73d8f5ef46e098c150193","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T17:32:10.640Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:13.216Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S} |= ((P & Q) & R) <-> S","sourceOffset":2426,"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","Q","R","S"],"conclusion":"((P & Q) & R) <-> S","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && 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"}],"files":{"source.json":{"sha256":"ef5718961324f2ff3374f6e3570dcd6d7d512fe78b5c13d7fdcf313cda704916","bytes":5680},"Proof.lean":{"sha256":"5bdcb7aabc1032ee59cc13363b26350a620999979b1f05e3e9afed41fd6b5513","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."},{"slug":"hunter-logic-comedy","identifier":"hunter-logic-comedy","title":"The Logic of Comedy by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"fcaf95ebdb3285657b7f346dacf07c480412d769e113f7a7ab7b99a9cf3694c2","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:46:58.787Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:13.219Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T, T -> U} |= (((P & Q) & (R & S)) & T) & U)","sourceOffset":3864,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unconsumed formal tokens; no prose or connectives discarded","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"b317d6c2e98dcadebb5661caf2240fd37e04727c7bca90388cac4ea43fe0d0a5","bytes":8618},"Proof.lean":{"sha256":"c0f38d9ea38ec8339bb9d6b7bde65c7929f4b5bc405943ffc2543cb1a9d6c2b6","bytes":289},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-logic-discovery","identifier":"hunter-logic-discovery","title":"The Logic of Discovery by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"a276d9a3aa5f3faba47f4130b5764f6aa59e523220286285d706b289539c69d5","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:22:43.099Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:14.078Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= (((P <-> Q) <-> R) <-> (R <-> Q) <-> P","sourceOffset":1676,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":839,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"e19f764f8cea9949e6b0c6210fab1efd0e1319a61f9d7f6ccf351926b45270b1","bytes":3750},"Proof.lean":{"sha256":"a826e67242fb96067a4c84b8ac5c40dd6e2935d2ca836721dbbc6a5c99564512","bytes":392},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-logos-origin-commentary-copy","identifier":"hunter-logos-origin-commentary-copy","title":"The Logic of the Universe as the Logical Origin — Commentary Version","author":"Maclain Hunter","sourceSha256":"1328528cd50fac197c3a1384bf567350e5a56675fdedf3b4ff926a05b46fc706","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:19.500Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:14.080Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"24ae294de2331777276ffffd7cef1e8716db06eb9be7c29c7a1aba7465828e82","bytes":7885},"Proof.lean":{"sha256":"a4e09c151b08f0c76dd0169b83813ec4d47fa9b99ba819085ac1ec1ae59f37d1","bytes":322},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-logos-origin-proof-two","identifier":"hunter-logos-origin-proof-two","title":"The Logic of the Universe as the Logical Origin — Proof Two","author":"Maclain Hunter","sourceSha256":"0ebc8172b776cfb12eb0f4a9d0dc23aae0a05b9757f6a4249b15e848e39e7361","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:15.542Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:14.083Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"9b23c59180a43ebf8df94229fb86bc2a987c88e682ab8cbf9073c819248ce0f4","bytes":5687},"Proof.lean":{"sha256":"e8fec8c43ea4374f7e017307c2ea1f68a92c355803ec8988cd086f7761c3d661","bytes":313},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-logos-origin-uppercase-copy","identifier":"hunter-logos-origin-uppercase-copy","title":"The Logic of the Universe as the Logical Origin — Uppercase Version","author":"Maclain Hunter","sourceSha256":"bbb36838fd4c5d9742971debabe08b8b4b94f7c66221ee0eda429bac04ec0910","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:23.323Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:15.011Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P → Q, Q → R, R → S, S → T, T → U, U → P, ~(~P & ~Q & ~R & ~S & ~T & ~U)} |= ((P & Q) & (R & S) & T) & U","sourceOffset":1663,"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","T","U"],"premises":["P","P → Q","Q → R","R → S","S → T","T → U","U → P","~(~P & ~Q & ~R & ~S & ~T & ~U)"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5)) && ((!v5) || v0)) && (!((((((!v0) && (!v1)) && (!v2)) && (!v3)) && (!v4)) && (!v5))))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"529e02a5d7cf9b41a4974bce9de5288f255b0bc988102e20c8cc5262e4d00a6e","bytes":3439},"Proof.lean":{"sha256":"6e6330785f53c22edaa9760e223e8334407901adde689fd4c38357bfbd6f3382","bytes":737},"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."},{"slug":"hunter-giving-hearing-explanations","identifier":"hunter-giving-hearing-explanations","title":"The Logical and Metaphysical Implications of Giving and Hearing Explanations by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"784b4f2773192c764f0340085eeae9162ed8199a13fae19ac825e8efbfcb3406","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:22:36.304Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:15.896Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R} |= ((P <-> Q) <-> (Q <-> R)) <-> (R <-> P)","sourceOffset":873,"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"],"conclusion":"((P <-> Q) <-> (Q <-> R)) <-> (R <-> P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && v1) && v2)) || (((v0 == v1) == (v1 == v2)) == (v2 == v0))) = 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":"6425049bdc965e96d70d1605c280fb3e22c24d1b0fb9c5b100722516547988f5","bytes":3397},"Proof.lean":{"sha256":"b6e9d8545d07d53a2d2d44397f39d0ef1c43b221de00c9bc7430bd0730f2036d","bytes":547},"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."},{"slug":"hunter-mathematics-foundational-coherence","identifier":"hunter-mathematics-foundational-coherence","title":"The Logical Derivation of Mathematics from Foundational Coherence by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"57f7cbd65da7482c23ff33727ac6ce93932b5e2f6690a46629f687b2bd647525","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:33:25.691Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:16.825Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T} |= (P & Q) & (R & S) & T","sourceOffset":1464,"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","T"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T"],"conclusion":"(P & Q) & (R & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4))) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"bfc3aed964eefb5008a10734ad892140aab9b24c4aaa87ac913dedf680c86576","bytes":5367},"Proof.lean":{"sha256":"1274943439da902024506b40434a62d24749ba336344c423ad455ce08a067cbb","bytes":608},"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."},{"slug":"hunter-driveshaft-equivalence","identifier":"hunter-driveshaft-equivalence","title":"The Logical Driveshaft of Memory and Processing by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"deb179a4a0d489eae62f659e8ef6dc4dfeb4a220351777b1602b7667e7ba1631","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T15:11:08.584Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:16.828Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"1a59c8e5ad8612fd3773a074622e5bbcb448916740e1eba2241f95f3fc323ef7","bytes":878},"Proof.lean":{"sha256":"61dd749499c92eb6d165a7dd03c5405d842bdc259314a5490265893d6004939d","bytes":317},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-logical-shaping-of-logic","identifier":"hunter-logical-shaping-of-logic","title":"The Logical Shaping of Logic by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"8eccaa3646c1a3095b32697e8cf49a1f741f87d547a1e1ae8925a0cb539c8cba","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:18.942Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:19.881Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T, T <-> U, U <-> V, V <-> W, W <-> X} |= (((((P & Q) & (R & S) & T) & U) & V) & W) & X","sourceOffset":2564,"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","T","U","V","W","X"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T","T <-> U","U <-> V","V <-> W","W <-> X"],"conclusion":"(((((P & Q) & (R & S) & T) & U) & V) & W) & X","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 v6 v7 v8 : Bool) :\n    ((!((((((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4)) && (v4 == v5)) && (v5 == v6)) && (v6 == v7)) && (v7 == v8))) || (((((((v0 && v1) && (v2 && v3)) && v4) && v5) && v6) && v7) && v8)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> cases v6 <;> cases v7 <;> cases v8 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"4fc051de3e328ab65d20a607fce81fb4c53606a21c12a42de7552f70be592294","bytes":3711},"Proof.lean":{"sha256":"76913e88dd0777acd7cec3b1aba3bfc0764f463213d3d1bb5aea44cc7d98da5c","bytes":731},"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."},{"slug":"hunter-logically-coherent-cosmological-argument","identifier":"hunter-logically-coherent-cosmological-argument","title":"The Logically Coherent Cosmological Argument","author":"Maclain Hunter","sourceSha256":"fa90c2f2ce132f1416df8e969c8da3430b56c005d35eda8446ca193fe893c953","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:06.581Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:19.884Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"0c6a40e7bfc7b4238040b6db1fa1b126e531119db9f58dc2b31a6f80466fe65b","bytes":1590},"Proof.lean":{"sha256":"a02ebe001cd43014f84257d6d8b9ba69953d0fe7649ef88da3a2916afa8db192","bytes":296},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-maker-of-syllogism","identifier":"hunter-maker-of-syllogism","title":"The Maker of the Syllogism by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"c34fe81f7f0331e1eee7213440e5da1820b784fc2b726c0673874921f6a28e9c","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:57:24.378Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:20.781Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q -> R} |= (P & Q) -> R","sourceOffset":1721,"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","Q -> R"],"conclusion":"(P & Q) -> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v0 == v1)) && ((!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"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":449,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"29daa5e136ac9c4f171e5a7f17cc0ee5624bddec1815c9b3375fad96c1a6a8df","bytes":3239},"Proof.lean":{"sha256":"dec20ac8c88544d3d66a6343ab4dd8dd132761c99feb49b45179029b0a9a65ab","bytes":596},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-moral-nations-service","identifier":"hunter-moral-nations-service","title":"The Moral Standard and Service to Nations","author":"Maclain Hunter","sourceSha256":"a0ffeba5909b0ef2a5bdce416fc4c870b47b9611301b1218d2a4a6d632a47eee","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:36.416Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:21.648Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R} |= R","sourceOffset":251,"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","Q -> R"],"conclusion":"R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || 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":"b8417d94551a326919396a6a0629cbffd5e2f512fe11508c78b0803ea9e5f4d9","bytes":860},"Proof.lean":{"sha256":"70fc5cf82242518b0915f80ea4cecc5ca9a8718afc595a7a0b560775c4851133","bytes":476},"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."},{"slug":"hunter-personal-impersonal-ground","identifier":"hunter-personal-impersonal-ground","title":"The Non-Dual Ground of Personal and Impersonal","author":"Maclain Hunter","sourceSha256":"86314eac5cabd9ee9ee7cb8ef773448ec0224c5270f2b695aba3a2180844e262","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:02.729Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:22.518Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P -> P} |= (P -> P) -> ((Q -> Q) & (R -> R))","sourceOffset":223,"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"],"conclusion":"(P -> P) -> ((Q -> Q) & (R -> R))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((!v0) || v0)) || ((!((!v0) || v0)) || (((!v1) || v1) && ((!v2) || 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":"0d443cc5db496eda1ebb15db39f56d7ff9a364b7d0237c835013207d4dcc4d88","bytes":870},"Proof.lean":{"sha256":"4177f1dfd7c3a92dc68c19b73a54dfcd3ce11f90bbb609629960fbfb6fff960a","bytes":506},"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."},{"slug":"hunter-the-one-law","identifier":"hunter-the-one-law","title":"The One Law by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"8d21210d649c6e02d7973ec43382dab7250526b78c5bda4f6f718aba62b7ccb8","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:00:04.523Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:23.422Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R} |= (P & Q) <-> R","sourceOffset":1523,"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","Q <-> R"],"conclusion":"(P & Q) <-> R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v0 == v1)) && (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"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":206,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"dcf24995a98fe8bfeeb2a5d60a9dcdd1dc4e8914bbedac8eb65b46bb969fd988","bytes":3825},"Proof.lean":{"sha256":"b64448e74e2100559f9beb798d022a6a4bb6d2c01544bd6215d80322410692ed","bytes":575},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-proof-source-personal-link","identifier":"hunter-proof-source-personal-link","title":"The Personal Logical Chain of Proof","author":"Maclain Hunter","sourceSha256":"fa8afc327a4d85c6508dc3757a99e3c23f455454174990bfd40d0d60f1688df4","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:45:05.043Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:24.285Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q ->R} |= (P & R) -> Q","sourceOffset":243,"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","Q ->R"],"conclusion":"(P & R) -> Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((!(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":"af230b8d0ce3cdd2ddd128841e0656fe60c87b56543395fda6329994c2627a21","bytes":863},"Proof.lean":{"sha256":"12945d1ec60a51b25e0a72219c6d84bd581b15eae6e2c45f0c2069bafb597a84","bytes":489},"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."},{"slug":"hunter-pythagorean-syllogism","identifier":"hunter-pythagorean-syllogism","title":"The Pythagorean Syllogism by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"0ecfc3f2a29d5c314280ce4f570292c46fbc6973c68c88ad8b2fefb676549a90","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:41:42.160Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:25.151Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{A, A <-> B, B <-> C} |= (C -> B) -> A","sourceOffset":2375,"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"],"premises":["A","A <-> B","B <-> C"],"conclusion":"(C -> B) -> A","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v0 == v1)) && (v1 == v2))) || ((!((!v2) || v1)) || v0)) = 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":"f1828129cf1011aa9ecabf63415a80dfed388c2b5724718759dc2f1887d03437","bytes":5581},"Proof.lean":{"sha256":"14a98f5983482b394de840726e4f105b6b2e73a55166e4d2041c34dbba90fcd8","bytes":494},"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."},{"slug":"hunter-rational-cause-rational-causes","identifier":"hunter-rational-cause-rational-causes","title":"The Rational Cause for Rational Causes by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"77688563ba11ddc8a5fd635910eb0c02cb3fa3fe1db4ef632823c06833221676","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:23.654Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:26.057Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q -> R, P -> S, S <-> T, S} |= (P & Q) & (R & S) & T","sourceOffset":2540,"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","T"],"premises":["P","P <-> Q","Q -> R","P -> S","S <-> T","S"],"conclusion":"(P & Q) & (R & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!(((((v0 && (v0 == v1)) && ((!v1) || v2)) && ((!v0) || v3)) && (v3 == v4)) && v3)) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"8b6158bf21729df4c5183ad15ac7be9559e68f41f5036b40bce6c62d89f6cc23","bytes":6445},"Proof.lean":{"sha256":"593183aec4b163f4b23869db8b29d3f67f6aaa138403cc5da28d3051e6ddc705","bytes":595},"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."},{"slug":"hunter-rational-death-agnosticism","identifier":"hunter-rational-death-agnosticism","title":"The Rational Death of Agnosticism by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"3895e59355fa843bfd3b82e4acdb4dee77c0a7ed54456a11b98f3f17a132f4bc","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:13.158Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:27.024Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T, T} |= (P & Q) & (R & S) & T","sourceOffset":2497,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T","T"],"conclusion":"(P & Q) & (R & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!(((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && v4)) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"8331c56f6572a9030c996eee52eb4137c8aa2b27d45e915bbf4928220c56d3a6","bytes":5273},"Proof.lean":{"sha256":"9b8dbd86a08bcc11270008c8dc38a11cc5ebe2e711af605791bd0551bf66f1ee","bytes":596},"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."},{"slug":"hunter-redundancy-pythagorean-proof","identifier":"hunter-redundancy-pythagorean-proof","title":"The Redundancy of Proof for the Pythagorean Theorem by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"c7fd9ee9e8abcd219b079284cb28403ac24cee528e0954dcac541b4a97ff763f","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:41:43.461Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:27.911Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R} |= (P & Q) & R","sourceOffset":1337,"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","Q <-> R"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v0 == v1)) && (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"},{"id":"inference_2","sourceStatement":"{a, a <-> b, b <-> c, c <-> d} |= (d -> c) -> (b -> a)","sourceOffset":2160,"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","c <-> d"],"conclusion":"(d -> c) -> (b -> a)","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3))) || ((!((!v3) || v2)) || ((!v1) || v0))) = 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":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":2848,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"db3a758f8a16a61f715982ed281fc922cdd36099239ed02363bb82159e370800","bytes":4716},"Proof.lean":{"sha256":"bc5305e6dede5ee01725aff143ea17d420fc0b6ed9125cca82703a0b55a39983","bytes":858},"lean-check.txt":{"sha256":"40b7da001d5d78d36b6960c8ae1b7c13a2ea6cf5f9da51ea55e40e490d78ea16","bytes":242}},"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."},{"slug":"hunter-rule-logic-knowledge","identifier":"hunter-rule-logic-knowledge","title":"The Rule of Logic and Proof Knowledge","author":"Maclain Hunter","sourceSha256":"919ec6a81d4d9c29e8e5873ecad247c506879133137901dd0e736a23f17ec5aa","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:08:44.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:42:28.819Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{A, A -> A} |= (B v ~B) & ~(C & ~C)","sourceOffset":62,"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"],"premises":["A","A -> A"],"conclusion":"(B v ~B) & ~(C & ~C)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(v0 && ((!v0) || v0))) || ((v1 || (!v1)) && (!(v2 && (!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"},{"id":"inference_2","sourceStatement":"{P, P -> Q, Q -> R, R -> P} |= (Q <-> P) & (R -> R)","sourceOffset":211,"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","Q -> R","R -> P"],"conclusion":"(Q <-> P) & (R -> R)","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 : Bool) :\n    ((!(((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v0))) || ((v1 == v0) && ((!v2) || v2))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"45fea3bac5edad030ab7f29f900108e2464dea287f81a76f98572e85e6859e82","bytes":851},"Proof.lean":{"sha256":"6b868d18ec0e65c6bc1216d53adbae8af44324bf904a18ef717463a75824b911","bytes":716},"lean-check.txt":{"sha256":"9dd24ecb3d82c309e42e8e914b5df3ec490fd2259644de7d887fca9eeff5dfe5","bytes":174}},"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."},{"slug":"hunter-rules-of-logic-science-proof","identifier":"hunter-rules-of-logic-science-proof","title":"The Rule(s) of Logic and Logic Applied to Logic, Science, and Proof by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"9a721430954eafb053405f7db703d2158b367d1000a39c0598cf1e3e3b8f913a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T14:38:29.622Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:29.891Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_2","HunterAuthored.inference_4","HunterAuthored.inference_5","HunterAuthored.inference_7","HunterAuthored.inference_8","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{1, 1 <-> 2, 2 <-> 3, 4 <-> 5, 5 <-> 6, 6 <-> 7}\n|= (((1 & 2) & (3 & 4) & 5) & 6) & 7","sourceOffset":3407,"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":["1","2","3","4","5","6","7"],"premises":["1","1 <-> 2","2 <-> 3","4 <-> 5","5 <-> 6","6 <-> 7"],"conclusion":"(((1 & 2) & (3 & 4) & 5) & 6) & 7","status":"countermodel","countermodel":{"1":true,"2":true,"3":true,"4":false,"5":false,"6":false,"7":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{P, P <-> P, P <-> ~Q} |= P & ~Q","sourceOffset":7840,"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"],"premises":["P","P <-> P","P <-> ~Q"],"conclusion":"P & ~Q","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 : Bool) :\n    ((!((v0 && (v0 == v0)) && (v0 == (!v1)))) || (v0 && (!v1))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{P, P -> Q} |= P and it leads to logical contradiction. It amounts to saying Logic is “not Logic” which is not Logic (Valid Order and Reasoning). To assume God (Logos) is not God (Logic) would mean that God’s output (Reality - All Existence) is not Reality (what Logic entails).","sourceOffset":7918,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \". It amounts to saying Logic is “not Logic” w\"","kernelStatus":"not_checked"},{"id":"inference_4","sourceStatement":"{P <-> Q, Q <-> R} |= (P <-> Q) & (Q <-> R)","sourceOffset":9412,"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","Q <-> R"],"conclusion":"(P <-> Q) & (Q <-> R)","status":"candidate","leanStatement":"theorem inference_4 (v0 v1 v2 : Bool) :\n    ((!((v0 == v1) && (v1 == v2))) || ((v0 == v1) && (v1 == v2))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_4\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_4"},{"id":"inference_5","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= ((P & Q) & (R & S)) & T","sourceOffset":12522,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"((P & Q) & (R & S)) & T","status":"candidate","leanStatement":"theorem inference_5 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_5\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_5"},{"id":"inference_6","sourceStatement":"{LL <-> LS} |= LL & LS","sourceOffset":14864,"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":["LL","LS"],"premises":["LL <-> LS"],"conclusion":"LL & LS","status":"countermodel","countermodel":{"LL":false,"LS":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"inference_7","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T, T -> U, U -> V} |= (((P & Q) & (R & S) & T) & U) & V","sourceOffset":16894,"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","T","U","V"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T","T -> U","U -> V"],"conclusion":"(((P & Q) & (R & S) & T) & U) & V","status":"candidate","leanStatement":"theorem inference_7 (v0 v1 v2 v3 v4 v5 v6 : Bool) :\n    ((!((((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5)) && ((!v5) || v6))) || (((((v0 && v1) && (v2 && v3)) && v4) && v5) && v6)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> cases v6 <;> decide\n#print axioms inference_7\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_7"},{"id":"inference_8","sourceStatement":"{P1, P2, P3, P4} |= (P1 & P2) & (P3 & P4)","sourceOffset":17894,"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","P3","P4"],"premises":["P1","P2","P3","P4"],"conclusion":"(P1 & P2) & (P3 & P4)","status":"candidate","leanStatement":"theorem inference_8 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && v2) && v3)) || ((v0 && v1) && (v2 && v3))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_8\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_8"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":188,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"7c038326d254e0bc55e3759ae4ed7daffe422a0fddd58676442ebf53b3200df9","bytes":19939},"Proof.lean":{"sha256":"07683b66598bae415a0140aea9283fdac45cb1b88e793416a1bba445a78fe100","bytes":1675},"lean-check.txt":{"sha256":"f7147632b8cdf7e8a4669af00efd4f866c629251cbfa28b166f6be529a37fb26","bytes":419}},"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."},{"slug":"hunter-rules-logic-god-concepts-copy","identifier":"hunter-rules-logic-god-concepts-copy","title":"The Rules of Logic Applied to the Concept(s) of God, Logic, Logos, and Reason by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"7f55bfff882b85ca51fe5e2998cdee862acca6bb050aff9b14e10948ca4c10d0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:14.921Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:30.755Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{1, 1 <-> 2, 2 <-> 3, 4 <-> 5, 5 <-> 6, 6 <-> 7}\n|= (((1 & 2) & (3 & 4) & 5) & 6) & 7","sourceOffset":3360,"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":["1","2","3","4","5","6","7"],"premises":["1","1 <-> 2","2 <-> 3","4 <-> 5","5 <-> 6","6 <-> 7"],"conclusion":"(((1 & 2) & (3 & 4) & 5) & 6) & 7","status":"countermodel","countermodel":{"1":true,"2":true,"3":true,"4":false,"5":false,"6":false,"7":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":141,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"a54c6a6939e80995df2460a4d7740004e90d8663adb27ecac370dbf7b2c33244","bytes":5239},"Proof.lean":{"sha256":"f7a139cbca3edb50456fd043542a851d6097b703a7b04c15a23c8e0c1815e5ef","bytes":447},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-rules-logic-science-latest-copy","identifier":"hunter-rules-logic-science-latest-copy","title":"The Rules of Logic, the Rule of Logic, and Logic Applied to Logic and Science by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"c46dffe19eedddaed435945b17584caa159a9dfd7c87a109cd1bb826010dd286","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:02.415Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:31.710Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_2","HunterAuthored.inference_4","HunterAuthored.inference_5","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{1, 1 <-> 2, 2 <-> 3, 4 <-> 5, 5 <-> 6, 6 <-> 7}\n|= (((1 & 2) & (3 & 4) & 5) & 6) & 7","sourceOffset":3417,"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":["1","2","3","4","5","6","7"],"premises":["1","1 <-> 2","2 <-> 3","4 <-> 5","5 <-> 6","6 <-> 7"],"conclusion":"(((1 & 2) & (3 & 4) & 5) & 6) & 7","status":"countermodel","countermodel":{"1":true,"2":true,"3":true,"4":false,"5":false,"6":false,"7":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{P, P <-> P, P <-> ~Q} |= P & ~Q","sourceOffset":7850,"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"],"premises":["P","P <-> P","P <-> ~Q"],"conclusion":"P & ~Q","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 : Bool) :\n    ((!((v0 && (v0 == v0)) && (v0 == (!v1)))) || (v0 && (!v1))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{P, P -> Q} |= P and it leads to logical contradiction. It amounts to saying Logic is “not Logic” which is not Logic (Valid Order and Reasoning). To assume God (Logos) is not God (Logic) would mean that God’s output (Reality - All Existence) is not Reality (what Logic entails).","sourceOffset":7928,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unsupported formal syntax near \". It amounts to saying Logic is “not Logic” w\"","kernelStatus":"not_checked"},{"id":"inference_4","sourceStatement":"{P <-> Q, Q <-> R} |= (P <-> Q) & (Q <-> R)","sourceOffset":9422,"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","Q <-> R"],"conclusion":"(P <-> Q) & (Q <-> R)","status":"candidate","leanStatement":"theorem inference_4 (v0 v1 v2 : Bool) :\n    ((!((v0 == v1) && (v1 == v2))) || ((v0 == v1) && (v1 == v2))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_4\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_4"},{"id":"inference_5","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T} |= ((P & Q) & (R & S)) & T","sourceOffset":12532,"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","T"],"premises":["P","P -> Q","Q -> R","R -> S","S -> T"],"conclusion":"((P & Q) & (R & S)) & T","status":"candidate","leanStatement":"theorem inference_5 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4))) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_5\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_5"},{"id":"inference_6","sourceStatement":"{LL <-> LS} |= LL & LS","sourceOffset":14874,"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":["LL","LS"],"premises":["LL <-> LS"],"conclusion":"LL & LS","status":"countermodel","countermodel":{"LL":false,"LS":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"inference_7","sourceStatement":"{P1 <-> P2, P2 <-> P3} |= (P1 & P2) & P3","sourceOffset":15230,"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","P3"],"premises":["P1 <-> P2","P2 <-> P3"],"conclusion":"(P1 & P2) & P3","status":"countermodel","countermodel":{"P1":false,"P2":false,"P3":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":198,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"30bac1b200d062a45430d31d6add0e43f4492dfd38da441683950a972ec99c58","bytes":17223},"Proof.lean":{"sha256":"e2f6615fa6a8cdb3bb97b2b1fd890a15cf8bbf4386fd37e89ea56d443322a0df","bytes":1103},"lean-check.txt":{"sha256":"2bd205af14174a8f5ef46f66d5324ded0e4f36cefdfc7baacf3370492b00ebe5","bytes":301}},"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."},{"slug":"hunter-solely-coherent-perspective","identifier":"hunter-solely-coherent-perspective","title":"The Solely Coherent Perspective","author":"Maclain Hunter","sourceSha256":"65c5b8e027c894900731be6799b26fa41a27bdcb2013356b513c83e7ddfea5b1","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:26.363Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:32.601Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T, T -> U, U -> P} |= (((P & Q) & (R & S) & T) & U","sourceOffset":1250,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"},{"id":"inference_2","sourceStatement":"{P, P -> Q, Q -> R, R -> S, S -> T, T -> U, U -> P} |= (((P & Q) & (R & S) & T) & U","sourceOffset":1779,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":349,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"44cec9672d1dde3b03324cd5ab5f399c2c082e58960f39c5cd4013089c05e433","bytes":3029},"Proof.lean":{"sha256":"e537ebda32444221ae9053a05f2e0a207f6b31c0314b03a19fc338054d55e7f2","bytes":383},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-source-rationality","identifier":"hunter-source-rationality","title":"The Source of Rationality by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"da627b2f4a587cbb45b9994129d09cdfbe101beda57b69c57012559b93c7deaf","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T17:59:54.100Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:32.603Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"70f0d481d2afe3c99b5545d1a8c28413a2a4fab88cea76b6311af5d2f6762dba","bytes":994},"Proof.lean":{"sha256":"c42cd0f262d044185545d9a9854720797d93b2f1c1c5ec8e5ea90ea013a57731","bytes":295},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-standard-reality-self-coherence","identifier":"hunter-standard-reality-self-coherence","title":"The Standard of Reality and Self-Coherence","author":"Maclain Hunter","sourceSha256":"4cd62a99178e4924e507a1c89feb91ad84acf65437bf7ae9e2fa7b1570d8a50e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:33.488Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:32.606Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"9803a8b2e7c38ae642168c99290755dca011c1af04fe759b5da9de342b358a97","bytes":874},"Proof.lean":{"sha256":"c965158736d56ba341402eaf61c532034c680ba9fc2dda4908c1bf68a726d8fd","bytes":294},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-zaqar-allegory-additional-copy","identifier":"hunter-zaqar-allegory-additional-copy","title":"The Tale of Zaqar — Additional Supplied Copy","author":"Maclain Hunter","sourceSha256":"7baf9245524faae90b71f48911f82c4744f09811a4aaad7544fc4bebda1d71ab","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:32:38.050Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:33.514Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":3011,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"daf470ce085519fb52f575c3294fd0c5b453fb8b1358ff6aa5a028b43211adee","bytes":110868},"Proof.lean":{"sha256":"532b953c40370d2fe38e3dc5f69aa26d2045cd945b4930e50b38d22aacfe0971","bytes":398},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-zaqar-allegory","identifier":"hunter-zaqar-allegory","title":"The Tale of Zaqar and the Patriarchs and Prophets of Memundi","author":"Maclain Hunter","sourceSha256":"5113cc85a7b0889545b4127345c671f06e68ac0f6d32057c0ca8e0d406bda2cf","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:32:19.432Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:34.435Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":3074,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"6e1ad19febd920395780a293048b7d18ad467d7965c64fe8eea98ca708dbae1a","bytes":156501},"Proof.lean":{"sha256":"64f2f88678ce2a454e02eaa1696a3b1fc1406df5ed091a0e08fab13d211ad126","bytes":412},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-trinity-godhead-supplied-copy","identifier":"hunter-trinity-godhead-supplied-copy","title":"The Trinity — Supplied Version","author":"Maclain Hunter","sourceSha256":"62e3df758ce4f2e96ce1204db725e088eed845b8b19323851755880b5a35e9a7","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:18.329Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:35.361Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{A, A -> (B & C), (B & C) -> D, A -> A} |= D & (D -> D)","sourceOffset":174,"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 & C)","(B & C) -> D","A -> A"],"conclusion":"D & (D -> D)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && ((!v0) || (v1 && v2))) && ((!(v1 && v2)) || v3)) && ((!v0) || v0))) || (v3 && ((!v3) || 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"}],"files":{"source.json":{"sha256":"9343281a15d5f9de97cc48a89007d048aff799a4e695c92713ad17f16a6e2c75","bytes":862},"Proof.lean":{"sha256":"80377b8d0278e1d332a5dd6e0a4746e9e0e0c61190937371b070067e9be0ec76","bytes":537},"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."},{"slug":"hunter-unified-rule-of-logic","identifier":"hunter-unified-rule-of-logic","title":"The Unified Rule of Logic — Authored Supplied Version","author":"Maclain Hunter","sourceSha256":"c6745241564094a3162fa40244df42d0a37203aa0a16743724aa8477e4d91fd7","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:23.378Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:35.364Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"e83ace28637225a73f03780102bd13393c748459a43da7184415d24c14ae4313","bytes":914},"Proof.lean":{"sha256":"19b5d6d3c3a34f4c46aacd80c916476c15bdbe24ea2f20bb994ff9d84b5bbba7","bytes":307},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-universe-code-coherence","identifier":"hunter-universe-code-coherence","title":"The Universal Code and Coherent Decoding","author":"Maclain Hunter","sourceSha256":"dd5b75a721134bee159fc58ef61d0f07160c060090004495785b76df41d4bd59","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:27.700Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:36.241Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P -> Q, Q -> P} |= (P -> Q) & (Q <-> P)","sourceOffset":236,"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"],"premises":["P -> Q","Q -> P"],"conclusion":"(P -> Q) & (Q <-> P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(((!v0) || v1) && ((!v1) || v0))) || (((!v0) || v1) && (v1 == v0))) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"9c3f49216676a3f07d847599188f62b6f196577b57c38efd0dc4dd33de1c0068","bytes":872},"Proof.lean":{"sha256":"9f8e4d15f9aa9eb2b839418ec25f007c46692fd72799fc2fbe147188e679b726","bytes":478},"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."},{"slug":"hunter-things-happen","identifier":"hunter-things-happen","title":"Things Happen by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"18379759c420cca4b22d7d835c526f52ab2fd76f28ff2d9ffef3d8af07416d17","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:34.857Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:37.153Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, Q, R, S} |= (P <-> Q) <-> (R & S)","sourceOffset":915,"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","Q","R","S"],"conclusion":"(P <-> Q) <-> (R & S)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && v1) && 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"}],"files":{"source.json":{"sha256":"91035ecd42627ad65506c90ba71c25f73560fe3dce62598bc52eb21ad376ef5d","bytes":2387},"Proof.lean":{"sha256":"ace3f93a0657e93d0392711025ecdfe3469f8d23c10d438f36bf9ab3e8adf719","bytes":492},"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."},{"slug":"hunter-third-sieve","identifier":"hunter-third-sieve","title":"Third Sieve","author":"Maclain Hunter","sourceSha256":"e9c49d04dce083e6344d94be888ebd52fa77cc1ec9067e4287adb9dfccfa2e72","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:52.012Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:38.031Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q, Q <-> R} |= R -> (Q <-> P)","sourceOffset":225,"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","Q <-> R"],"conclusion":"R -> (Q <-> P)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 == v1) && (v1 == v2))) || ((!v2) || (v1 == v0))) = 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":"7c41f9e5792078f72b57efe1fb7e940b3b5098159b506b4f4cbd7cc9f37fa760","bytes":847},"Proof.lean":{"sha256":"5360477cb231010a4a70f14a8bd84b6ad66b08bb000216f229b6ee49248eb66a","bytes":451},"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."},{"slug":"hunter-three-theological-questions","identifier":"hunter-three-theological-questions","title":"Three Theologically Relevant Questions","author":"Maclain Hunter","sourceSha256":"ee401fde0f24444892b91d3047ba168962bb2d00027a67dde69547fcde45d3f0","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:11.927Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:38.034Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"7dfd73b2084ba7c9469aa1fb075c8226b78581898a66d7a4b4350b328aafa041","bytes":3457},"Proof.lean":{"sha256":"eeac71cf4de3f4718acda9bb9163b429727cb0efcf795fc3bbab57b112d458cc","bytes":290},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-timeless-logos","identifier":"hunter-timeless-logos","title":"Timeless Logos and Contingent Spacetime","author":"Maclain Hunter","sourceSha256":"faf48edaff241c4123a59b34ba177ad1b8ec23fca3128691d88f35da6fea0aa1","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:05.283Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:38.910Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q ->R} |= (P & R) -> Q","sourceOffset":215,"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","Q ->R"],"conclusion":"(P & R) -> Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && ((!v1) || v2))) || ((!(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":"95a83f891232c97533cbe3a62d441520c996106de2f48c0dc7578ee578454981","bytes":825},"Proof.lean":{"sha256":"b7cd235f2548c8479ca88afe8cce8f184c109516e9e0b745934b3db139fa2476","bytes":493},"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."},{"slug":"hunter-trinity-godhead","identifier":"hunter-trinity-godhead","title":"Trinity of Godhead","author":"Maclain Hunter","sourceSha256":"1a3f70be28f659acbb1a71551cde8d2df1e4eacdac2cac84ab7df9f993675d5d","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:19.017Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:39.817Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{A, A -> (B & C), (B & C) -> D, A -> A} |= D & (D -> D)","sourceOffset":213,"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 & C)","(B & C) -> D","A -> A"],"conclusion":"D & (D -> D)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 : Bool) :\n    ((!(((v0 && ((!v0) || (v1 && v2))) && ((!(v1 && v2)) || v3)) && ((!v0) || v0))) || (v3 && ((!v3) || 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"}],"files":{"source.json":{"sha256":"397067a3772e465fb416b46b0daa8fa9d8d5ac540daab7922a299d2ed0ee9b82","bytes":868},"Proof.lean":{"sha256":"f354e75f81314bd05a881b00fee463218c4ca927983641d9ca50e8096fdffe4f","bytes":523},"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."},{"slug":"hunter-true-love-caprice","identifier":"hunter-true-love-caprice","title":"True Love and Caprice","author":"Maclain Hunter","sourceSha256":"9b53bd628290d2c604fa4ec935a25530bc761015d460063bbf637ec66e696d19","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:11:06.324Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:39.819Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{(P & Q) -> (R & ~S} |= (P & Q) -> ~(~R & S)","sourceOffset":211,"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":[],"premises":[],"conclusion":"","status":"unsupported","reason":"Unmatched formal parentheses","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"d4b004b0b391f855332f95702bf8294850673496b071551fa3780ba33f92b83e","bytes":822},"Proof.lean":{"sha256":"3c092befc333b03048b1a0f720aad12637c385eca319e3a101848e577990c052","bytes":273},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-true-premises-interconnectedness","identifier":"hunter-true-premises-interconnectedness","title":"True Premises and Interconnected Principles","author":"Maclain Hunter","sourceSha256":"8447f672c768d093cbef23df4766d4e41c1eb116d43a0f36b8a7d4570b70bd60","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:32:19.477Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:39.821Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"ee4990c4fdfc023d432e918be83e314bf9da284ca736e52bf7c8500346b1edde","bytes":2888},"Proof.lean":{"sha256":"4d4e68f2a998a8727d77a0a8830f59f4880da7a5974ec2923ba826231e737ca7","bytes":295},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-truth-reality-identity","identifier":"hunter-truth-reality-identity","title":"Truth, Reality, and the Law of Identity","author":"Maclain Hunter","sourceSha256":"d70fd4159d5ebd87872232c9c0642b3ea4b89885bb20becafea388514d8141c5","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:14.906Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:40.689Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, ~~Q, P <-> Q} |= (P & Q)","sourceOffset":252,"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"],"premises":["P","~~Q","P <-> Q"],"conclusion":"(P & Q)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!((v0 && (!(!v1))) && (v0 == v1))) || (v0 && v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":184,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"c7a5aa8adc00334f89cde02eed38827a872c895f3778e7ee63df56d7e2ee8ff3","bytes":862},"Proof.lean":{"sha256":"214e983e88c7cd378d4f42be002b8b5e413fd92b906c693289d02615a37b8981","bytes":559},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-truth-identity-beyond-perception","identifier":"hunter-truth-identity-beyond-perception","title":"Truth’s Identity beyond Perception","author":"Maclain Hunter","sourceSha256":"4f4e9a0286746c9aaf341441e93263399cf6597edd727a5bf96db3b8d1e72b49","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:26.513Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:41.598Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q} |= P <-> Q","sourceOffset":348,"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"],"premises":["P <-> Q"],"conclusion":"P <-> Q","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 : Bool) :\n    ((!(v0 == v1)) || (v0 == v1)) = true := by\n  cases v0 <;> cases v1 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":3,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"fbb20e7105ae685f460bcc2d674877f0367f33fbd02dbaa4a71779be0fb45706","bytes":1746},"Proof.lean":{"sha256":"8f62627ee8cd840318df24a7de7530d08e206311e63893ffb995a8d12ba71466","bytes":534},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"hunter-unified-physics-metaphysics-theory","identifier":"hunter-unified-physics-metaphysics-theory","title":"Unified Formal Theory of Physics and Metaphysics","author":"Maclain Hunter","sourceSha256":"62ec45f808fe1e1cd90adf633ee2955b8131be99b8a15b9fc70875e7ee4f99a6","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:31:12.208Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:42.472Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.source_identity_rule"],"units":[{"id":"source_identity_rule","sourceStatement":"Law of Identity","sourceOffset":15122,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"eddb84cdca101b9739175fb386722072bdb71d40f3b74082362e629c751252d5","bytes":27877},"Proof.lean":{"sha256":"a4373c38754805ba9564e0a95f8d3855fe3abe2a2fc5f1ce8fa63162a79296ad","bytes":400},"lean-check.txt":{"sha256":"4ed6a13ccfe3148cc7a097f30883f0988ff5bbcbcdbbdc21ba6fe51f44db47a8","bytes":124}},"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."},{"slug":"hunter-latin-unity-noncontradiction","identifier":"hunter-latin-unity-noncontradiction","title":"Unity, Reason, and Non-Contradiction","author":"Maclain Hunter","sourceSha256":"0a72eab876da327b22c4f2f070da0564f52960854145ef6ae9682b58b22dcead","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:09:11.672Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:43.328Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q -> R} |= ((P & Q) & R) -> ~(((P & Q) & R) & ~((P & Q) & R))","sourceOffset":205,"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","Q -> R"],"conclusion":"((P & Q) & R) -> ~(((P & Q) & R) & ~((P & Q) & R))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && (v0 == v1)) && ((!v1) || v2))) || ((!((v0 && v1) && v2)) || (!(((v0 && 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":"b4cd3d82c80218c6e089e2d2092814b7a71536be44cc0881c38da7ffbd58bedf","bytes":868},"Proof.lean":{"sha256":"1db1821a47d13b9088e3e7a612d8f47c70812e8b90e52cb7ae973397beb4b527","bytes":541},"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."},{"slug":"hunter-universal-dynamic-proof","identifier":"hunter-universal-dynamic-proof","title":"Universal (Dynamic) Proof for Universal Tautological Logic (Logos)","author":"Maclain Hunter","sourceSha256":"4bad0a6aca82c72c0b8ae89c7859348ba9c541ef4748d7583159688d31b0ab69","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T17:44:37.422Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:43.330Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"f89d4609585ffc6fde5c2ec19c1b8615abeb65cfef3988ca9332f8ea33c726ea","bytes":2961},"Proof.lean":{"sha256":"27c4816ac4bb5575a4455ea23ed007d478802c5d49817bd7494675f5a732527c","bytes":318},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-universal-finite-mind","identifier":"hunter-universal-finite-mind","title":"Universal and Finite Mind","author":"Maclain Hunter","sourceSha256":"51dea0e2f1cfaf34a0ae3a6e7ab65f2aba1439764e9407fcba97ebdf406b1079","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:45:08.456Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:43.333Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"72cb134d4c7f8b74ca8deeccf1ee91b297f471dc8dba37bd72b9b57c9c87fe26","bytes":838},"Proof.lean":{"sha256":"8e57eeec3d82bd750881b61bbcb7e910d43f9fdd898dbbd278fc16aef4aa9085","bytes":277},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-universal-local-logic","identifier":"hunter-universal-local-logic","title":"Universal and Local Logic — Two Proofs","author":"Maclain Hunter","sourceSha256":"625cd13b2caf40d627cd65f682bf377b27eaee3b11d9951641273fed26a7d6f3","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T21:46:47.892Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:43.335Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"3075da9d82efc5b59e961dd1317d6b2348e1138fb0f68f0f28bcf9a1a7b5f364","bytes":5098},"Proof.lean":{"sha256":"b66e085b0cd27fdd908f500e6cabd04e8fb859cbb53e98dedf50712cd0d590e5","bytes":292},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-universal-logic-proof-coherence","identifier":"hunter-universal-logic-proof-coherence","title":"Universal Application of Logic, Proof, and Coherence by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"31cc47c5bffec4d256409bb250f6d1a1ac1818a1f680e4e1a48aa5f79f49638a","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:35:17.183Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:44.245Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S, S <-> T} |= (P & Q) & (R & S) & T","sourceOffset":2343,"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","T"],"premises":["P","P <-> Q","Q <-> R","R <-> S","S <-> T"],"conclusion":"(P & Q) & (R & S) & T","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && (v0 == v1)) && (v1 == v2)) && (v2 == v3)) && (v3 == v4))) || (((v0 && v1) && (v2 && v3)) && v4)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"c6dcc5450f5d60fa4c55e218a35c2420b1b66d79de947311481290476b0fbe40","bytes":3917},"Proof.lean":{"sha256":"e3b052af0cd9d387977059e8e40d936f03ab8b3dff982e360b8732350b1a02bd","bytes":595},"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."},{"slug":"hunter-rigorous-six-stage-logos-proof","identifier":"hunter-rigorous-six-stage-logos-proof","title":"Universal Logic — Six-Stage Scientific-Test Submission","author":"Maclain Hunter","sourceSha256":"ed56a9f94a6f2afe7e8172d224cc9da10a0c1f1fb47428a5ccb61df80e90bb74","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:37:26.944Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:45.188Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P → Q, Q → R, R → S, S → T, T → U, U → P, ~(~P & ~Q & ~R & ~S & ~T & ~U)} |= ((P & Q) & (R & S) & T) & U","sourceOffset":214,"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","T","U"],"premises":["P","P → Q","Q → R","R → S","S → T","T → U","U → P","~(~P & ~Q & ~R & ~S & ~T & ~U)"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5)) && ((!v5) || v0)) && (!((((((!v0) && (!v1)) && (!v2)) && (!v3)) && (!v4)) && (!v5))))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"5a260d7c288412963ac0fde80311075eb1e6c941df157ea2822baa8e6e880d8c","bytes":2274},"Proof.lean":{"sha256":"0a8728122daf6b882b2935a7b819632e6b8f3e047b381adb61f32c681c557a00","bytes":724},"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."},{"slug":"hunter-framework-local-refutation","identifier":"hunter-framework-local-refutation","title":"Universal Logic and Local Framework Refutation","author":"Maclain Hunter","sourceSha256":"2c5e58ef44156e19265df06cd87b0ae9a49a6cf18865ec09fc2f96f6de2b15f3","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:43:55.297Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:46.039Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> (Q & R)} |= P -> ~(P -> ~(Q & R))","sourceOffset":225,"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)"],"conclusion":"P -> ~(P -> ~(Q & R))","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!(v0 && ((!v0) || (v1 && v2)))) || ((!v0) || (!((!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":"26c6f73b78efe1d508bf626a4718b7b26ccf647699b7a98eea862bac049b1e32","bytes":869},"Proof.lean":{"sha256":"ae7a9550bcc7533cb2c058f76540a91ed0f692e70d345b372a7c9fb07b4c147f","bytes":506},"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."},{"slug":"hunter-universal-origin-logic-identity","identifier":"hunter-universal-origin-logic-identity","title":"Universal Logic and Origin — Necessary Identity","author":"Maclain Hunter","sourceSha256":"792095b1e01e947ea6449267fb42d941ba1537460dfccff7e5b33a3111d63896","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:34:30.142Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:46.902Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P} |= P","sourceOffset":577,"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"],"premises":["P"],"conclusion":"P","status":"candidate","leanStatement":"theorem inference_1 (v0 : Bool) :\n    ((!v0) || v0) = true := by\n  cases v0 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"3674547a7bae608272be7673a37a5bc8357e85c17608ba8b19d15a4d76d04380","bytes":1355},"Proof.lean":{"sha256":"a108f8d22e61b59eb744fece799181e60f61ad9975c628b70044040240ae41c4","bytes":414},"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."},{"slug":"universal-logic-implication-cycle","identifier":"universal-logic-implication-cycle","title":"Universal Logic Implication Cycle by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"232de602289f0b875b23dab7618f969bde1fbbeaeae9cffbcd09042c27b8e7ec","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T14:16:31.768Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:47.937Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P → Q, Q → R, R → S, S → T, T → U, U → P, ~(~P & ~Q & ~R & ~S & ~T & ~U)} |= ((P & Q) & (R & S) & T) & U","sourceOffset":0,"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","T","U"],"premises":["P","P → Q","Q → R","R → S","S → T","T → U","U → P","~(~P & ~Q & ~R & ~S & ~T & ~U)"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5)) && ((!v5) || v0)) && (!((((((!v0) && (!v1)) && (!v2)) && (!v3)) && (!v4)) && (!v5))))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"}],"files":{"source.json":{"sha256":"c14bb01cb687189e776ba339445e97474902c63cc0ba93b26addd9befc9e070c","bytes":2556},"Proof.lean":{"sha256":"299dd566b323b91000b06bbfce2f3734c8dd628691572ee228d8217282d31820","bytes":719},"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."},{"slug":"hunter-universal-logos-contingent-doubt","identifier":"hunter-universal-logos-contingent-doubt","title":"Universal Logos and Contingent Doubt","author":"Maclain Hunter","sourceSha256":"56ea4b44cb883fec6dac22e93015e82e488a387d2d414c4733a827ee6d90e70e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T23:44:17.276Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:47.939Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"ef641078782e1a58ef560f1a72bd63b0fd9a94f89402824ba4dfc4044baca195","bytes":889},"Proof.lean":{"sha256":"895c01029231174f8623c670db3b030cd1298e52aec40aace1888fc4438d47b9","bytes":288},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-unfixed-universal-proof","identifier":"hunter-unfixed-universal-proof","title":"Universal Proof — Unfixed Tautological Logic","author":"Maclain Hunter","sourceSha256":"a5828a7c49078cbca07ee182620037afb61f5c5adacdd68b703c2879345e627f","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:31:49.895Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:47.943Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"d5e31ebe2ac74a8cdd15e2b6e21500082c508aed8e540accb37615727faf6037","bytes":90529},"Proof.lean":{"sha256":"3d8053ae2dd65098c28dba308ef54ac29753187f5266cff8159c5755c19edfae","bytes":298},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-universal-reason-universe-identity","identifier":"hunter-universal-reason-universe-identity","title":"Universal Reason and the Universe’s Identity","author":"Maclain Hunter","sourceSha256":"fabaa888a666117f6fea28fc3fdf7df90d795cab05deb39565b5bc59877ab279","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:36:30.362Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:47.945Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[{"id":"inference_1","sourceStatement":"{P <-> Q} |= P & Q","sourceOffset":503,"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"],"premises":["P <-> Q"],"conclusion":"P & Q","status":"countermodel","countermodel":{"P":false,"Q":false},"reason":"The written sequent alone has a countermodel. No authored wording or unstated premise was changed.","kernelStatus":"not_checked"}],"files":{"source.json":{"sha256":"7cf110011579f6d22b44b4fd44cccc15e5dd27d7dac2149727b831d908e3dee2","bytes":1379},"Proof.lean":{"sha256":"0fe6f1e2faee2ca979ff124320dd1c3f862c3ef1e4279aecc73da4157daf5de4","bytes":298},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-universal-vector-tensor-lts","identifier":"hunter-universal-vector-tensor-lts","title":"Universal Vector, Universal Tensor, and Logical Translation Symmetry","author":"Maclain Hunter","sourceSha256":"baed4920cdd834ebb573fc4030679079376e7a97507e8aee1d23904a5767c48f","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:39.270Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:47.947Z","status":"requires_formalization","axiomFree":null,"axioms":[],"theoremNames":[],"units":[],"files":{"source.json":{"sha256":"3882fcfb16585eb4a848b7e8a876a113e608f5dda236add7e052d6fe30e3c60e","bytes":4966},"Proof.lean":{"sha256":"11ef4bb92acdf14ac99265c5739d06e1072036aecbac032354f1c9d07adbc28e","bytes":320},"lean-check.txt":{"sha256":"ee8e375e20cedc97916ebcc5a9aed9ee99873e74e0ce3ca61dc4ef2dff4f1149","bytes":106}},"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."},{"slug":"hunter-validating-pythagorean-theorem","identifier":"hunter-validating-pythagorean-theorem","title":"Validating the Pythagorean Theorem by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"d0e8bae2d21f0593b87ea501ef998c27ae970fb582504535a38dd586b5aa4cff","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T16:41:39.389Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:48.834Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P <-> Q, Q <-> R, R <-> S} |= (P & Q) & (R & S)","sourceOffset":440,"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"}],"files":{"source.json":{"sha256":"26b8c16b04d5404d186068566e3aae0957168a09480df69d4ff783af47f6d39a","bytes":2915},"Proof.lean":{"sha256":"7c34070272e0581cc7cf2178097f95d23965e4e74c8e8d79979469b242c3f34c","bytes":537},"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."},{"slug":"hunter-validation-tautological-sieve","identifier":"hunter-validation-tautological-sieve","title":"Validation Via Tautological Sieve","author":"Maclain Hunter","sourceSha256":"7c57bf304b2a920bc99e730fa761f3d8c06b3bd11709eaa4347e0e39678ee343","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:29:49.848Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:49.793Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2","HunterAuthored.inference_3"],"units":[{"id":"inference_1","sourceStatement":"{A, A -> ~B, (B & C) -> E, (C & D) -> D} |= (D -> ~(B & E)) & (D -> A)","sourceOffset":421,"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","E"],"premises":["A","A -> ~B","(B & C) -> E","(C & D) -> D"],"conclusion":"(D -> ~(B & E)) & (D -> A)","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!(((v0 && ((!v0) || (!v1))) && ((!(v1 && v2)) || v4)) && ((!(v2 && v3)) || v3))) || (((!v3) || (!(v1 && v4))) && ((!v3) || v0))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P <-> Q, Q <-> R} |= R -> (Q <-> P)","sourceOffset":1172,"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","Q <-> R"],"conclusion":"R -> (Q <-> P)","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 : Bool) :\n    ((!((v0 == v1) && (v1 == v2))) || ((!v2) || (v1 == v0))) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"},{"id":"inference_3","sourceStatement":"{W, X, Y, (W & X) -> Z, (X & Y) -> Z} |= Z <-> X","sourceOffset":2295,"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":["W","X","Y","Z"],"premises":["W","X","Y","(W & X) -> Z","(X & Y) -> Z"],"conclusion":"Z <-> X","status":"candidate","leanStatement":"theorem inference_3 (v0 v1 v2 v3 : Bool) :\n    ((!((((v0 && v1) && v2) && ((!(v0 && v1)) || v3)) && ((!(v1 && v2)) || v3))) || (v3 == v1)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> decide\n#print axioms inference_3\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_3"}],"files":{"source.json":{"sha256":"8a8d028f638416af0fbe91e451b46f1408a4530a3e261bcd212b40fba01f3af7","bytes":2995},"Proof.lean":{"sha256":"25a84ed30582d5be09549a3dc7ea66dd8cd6b6716038bbe557435e57b526755f","bytes":1008},"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."},{"slug":"hunter-six-stage-proof-two-versions","identifier":"hunter-six-stage-proof-two-versions","title":"Version One — Self-Evident Truth and Logos","author":"Maclain Hunter","sourceSha256":"c03d1a3f419ddfa9dcca81b4a54ab39effa3229caf4eb612a0417b86d3eed843","sourceKind":"authored-foundational-record","recordedAt":"2026-10-03T01:30:26.416Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:50.879Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.inference_2"],"units":[{"id":"inference_1","sourceStatement":"{P, P → Q, Q → R, R → S, S → T, T → U, U → P, ~(~P & ~Q & ~R & ~S & ~T & ~U)} |= ((P & Q) & (R & S) & T) & U","sourceOffset":12,"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","T","U"],"premises":["P","P → Q","Q → R","R → S","S → T","T → U","U → P","~(~P & ~Q & ~R & ~S & ~T & ~U)"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5)) && ((!v5) || v0)) && (!((((((!v0) && (!v1)) && (!v2)) && (!v3)) && (!v4)) && (!v5))))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"inference_2","sourceStatement":"{P, P → Q, Q → R, R → S, S → T, T → U, U → P, ~(~P & ~Q & ~R & ~S & ~T & ~U)} |= ((P & Q) & (R & S) & T) & U","sourceOffset":670,"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","T","U"],"premises":["P","P → Q","Q → R","R → S","S → T","T → U","U → P","~(~P & ~Q & ~R & ~S & ~T & ~U)"],"conclusion":"((P & Q) & (R & S) & T) & U","status":"candidate","leanStatement":"theorem inference_2 (v0 v1 v2 v3 v4 v5 : Bool) :\n    ((!(((((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && ((!v2) || v3)) && ((!v3) || v4)) && ((!v4) || v5)) && ((!v5) || v0)) && (!((((((!v0) && (!v1)) && (!v2)) && (!v3)) && (!v4)) && (!v5))))) || ((((v0 && v1) && (v2 && v3)) && v4) && v5)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> cases v5 <;> decide\n#print axioms inference_2\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_2"}],"files":{"source.json":{"sha256":"f8705968b5df33c35df9bf391e10bdb224d17cf421895a221269200eba693d04","bytes":2821},"Proof.lean":{"sha256":"24f536fad9e0f35798a21315f9728a929f4dc422bb707c504b821e23deda8d9c","bytes":1129},"lean-check.txt":{"sha256":"9dd24ecb3d82c309e42e8e914b5df3ec490fd2259644de7d887fca9eeff5dfe5","bytes":174}},"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."},{"slug":"hunter-we-understand-one-god","identifier":"hunter-we-understand-one-god","title":"We Understand One God by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"fe5fcd6f22c4c01159fd1ce79fd78665a0417e6977ced075a6be0159619a2a4e","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T18:42:14.915Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:51.786Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1","HunterAuthored.source_identity_rule"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, Q -> R, R <-> S, S <-> T} |= ((T & S) & (R & Q)) <-> P","sourceOffset":2629,"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","T"],"premises":["P","P -> Q","Q -> R","R <-> S","S <-> T"],"conclusion":"((T & S) & (R & Q)) <-> P","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 v3 v4 : Bool) :\n    ((!((((v0 && ((!v0) || v1)) && ((!v1) || v2)) && (v2 == v3)) && (v3 == v4))) || (((v4 && v3) && (v2 && v1)) == v0)) = true := by\n  cases v0 <;> cases v1 <;> cases v2 <;> cases v3 <;> cases v4 <;> decide\n#print axioms inference_1\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.inference_1"},{"id":"source_identity_rule","sourceStatement":"A is A","sourceOffset":1060,"scope":"The explicitly named Identity rule, over every type and element. The remaining prose is not replaced by this witness.","status":"candidate","variables":[],"premises":[],"conclusion":"∀ (α : Type) (a : α), a = a","leanStatement":"theorem source_identity_rule (α : Type) (a : α) : a = a := rfl\n#print axioms source_identity_rule\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.source_identity_rule"}],"files":{"source.json":{"sha256":"73afd7aafaa0db1d9a3bb128c2cf865b555a3ff1f03535e0e1a4ab7792c18449","bytes":7456},"Proof.lean":{"sha256":"db71aee36c0697adaa4518c97b91023cc669bbb952480bb1c173af203f22fb5e","bytes":671},"lean-check.txt":{"sha256":"c984470b7e70c1b533a43d5274fb204be8ef76a0e5c9aaacde641a6b4b8b74fd","bytes":183}},"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."},{"slug":"formal-xor-self-inverse","identifier":"formal-xor-self-inverse","title":"XOR Self-Inverse","author":"Maclain Hunter","sourceSha256":"28472d6dc9c60fbdbba33f9b0355e6ac0a4b3bbf26b0fca5bad11409894eb6a3","sourceKind":"formal-theorem","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:52.751Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.exponent_xor_self_positive"],"units":[{"id":"exponent_xor_self_positive","sourceStatement":"Formal statement: ∀a ∈ MCBExponent: state(XOR(a,a)) = +1","sourceOffset":0,"scope":"The authored parity of the sum of magnitudes, defined by an unbounded even/odd recurrence, has positive self-output. This is a signed exponent-state operation, not Boolean XOR substitution.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def evenNat : Nat → Bool\n  | 0 => true\n  | n + 1 => !(evenNat n)\ntheorem even_add (a b : Nat) : evenNat (a + b) = (evenNat a == evenNat b) := by\n  induction b with\n  | zero =>\n    change evenNat a = (evenNat a == true)\n    cases evenNat a <;> rfl\n  | succ b ih =>\n    calc\n      evenNat (a + (b + 1)) = !(evenNat (a + b)) := rfl\n      _ = !(evenNat a == evenNat b) := congrArg Bool.not ih\n      _ = (evenNat a == !(evenNat b)) := by cases evenNat a <;> cases evenNat b <;> rfl\ndef exponentXorState (a b : Int) : Int :=\n  if evenNat (a.natAbs + b.natAbs) then 1 else -1\ntheorem exponent_xor_self_positive (a : Int) : exponentXorState a a = 1 := by\n  unfold exponentXorState\n  rw [even_add]\n  cases evenNat a.natAbs <;> rfl\n#print axioms exponent_xor_self_positive\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.exponent_xor_self_positive"}],"files":{"source.json":{"sha256":"f937c14c0eecba7d7c9ca58b85e32f4433a3f519e2959f4e8a6e3dfd667da811","bytes":698},"Proof.lean":{"sha256":"e5e31ee55281fded83bea8fd36fa3851ba066b58cd445a79965e394f253eaebf","bytes":1033},"lean-check.txt":{"sha256":"5c48e53f06f145df62d5d1a8aedfa00efd24d384d14ad3e2b7b20a49987a569e","bytes":130}},"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."},{"slug":"archived-q1057-58ed7e9b6ca8","identifier":"archived-q1057-58ed7e9b6ca8","title":"XOR Self-Inverse","author":"Maclain Hunter","sourceSha256":"58ed7e9b6ca841f3d468ab5fa6085ba089acb15df13ea37f7fec47e3c9f87b2e","sourceKind":"archived-authored-source","recordedAt":null,"recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:53.902Z","status":"partial","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.exponent_xor_self_positive"],"units":[{"id":"exponent_xor_self_positive","sourceStatement":"{\n  \"name\": \"XOR Self-Inverse\",\n  \"formal\": \"∀a ∈ MCBExponent: state(XOR(a,a)) = +1\",\n  \"proof\": \"(|a| + |a|) mod 2 = 0, and (-1)^0 = +1\",\n  \"implementation\": \"mcbExponentXOR(a: MCBExponent, b: MCBExponent): MCBExponent\"\n}","sourceOffset":0,"scope":"The authored parity of the sum of magnitudes, defined by an unbounded even/odd recurrence, has positive self-output. This is a signed exponent-state operation, not Boolean XOR substitution.","status":"candidate","variables":[],"premises":[],"conclusion":"See the exact typed Lean theorem","leanStatement":"def evenNat : Nat → Bool\n  | 0 => true\n  | n + 1 => !(evenNat n)\ntheorem even_add (a b : Nat) : evenNat (a + b) = (evenNat a == evenNat b) := by\n  induction b with\n  | zero =>\n    change evenNat a = (evenNat a == true)\n    cases evenNat a <;> rfl\n  | succ b ih =>\n    calc\n      evenNat (a + (b + 1)) = !(evenNat (a + b)) := rfl\n      _ = !(evenNat a == evenNat b) := congrArg Bool.not ih\n      _ = (evenNat a == !(evenNat b)) := by cases evenNat a <;> cases evenNat b <;> rfl\ndef exponentXorState (a b : Int) : Int :=\n  if evenNat (a.natAbs + b.natAbs) then 1 else -1\ntheorem exponent_xor_self_positive (a : Int) : exponentXorState a a = 1 := by\n  unfold exponentXorState\n  rw [even_add]\n  cases evenNat a.natAbs <;> rfl\n#print axioms exponent_xor_self_positive\n","kernelStatus":"verified","axioms":[],"axiomFree":true,"reportedTheorem":"HunterAuthored.exponent_xor_self_positive"}],"files":{"source.json":{"sha256":"e39a5442d01b952df5cd6a5defdd25e3fd0328932b55ced536322874d99f46a1","bytes":774},"Proof.lean":{"sha256":"43020d17ffaae1627a953b657c4e1b2b5a471bc35f19ee95fe4cdae54a891470","bytes":1033},"lean-check.txt":{"sha256":"5c48e53f06f145df62d5d1a8aedfa00efd24d384d14ad3e2b7b20a49987a569e","bytes":130}},"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."},{"slug":"hunter-youd-know-if-you-knew","identifier":"hunter-youd-know-if-you-knew","title":"You’d Know If You Knew by Maclain Hunter","author":"Maclain Hunter","sourceSha256":"3efdd9303ca4ae0372c0d907e5876e161793db72fb1a693132695abc36bf17e2","sourceKind":"authored-foundational-record","recordedAt":"2026-10-02T20:20:50.766Z","recordedAtMeaning":"Database registration time, not a claim of original handwritten authorship.","originalAuthoredAt":null,"formalizedAt":"2026-10-03T10:37:05.082Z","checkedAt":"2026-10-03T10:42:54.835Z","status":"verified","axiomFree":true,"axioms":[],"theoremNames":["HunterAuthored.inference_1"],"units":[{"id":"inference_1","sourceStatement":"{P, P -> Q, R <-> P} |= (P & Q) & R","sourceOffset":1439,"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 <-> P"],"conclusion":"(P & Q) & R","status":"candidate","leanStatement":"theorem inference_1 (v0 v1 v2 : Bool) :\n    ((!((v0 && ((!v0) || v1)) && (v2 == v0))) || ((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":"f7e7e43240c89066b612c97ae0c4f10c6109d404c82185bb910e8b997ab98d08","bytes":2849},"Proof.lean":{"sha256":"62c2bad8273215b956cc9fb2df46855ca922c9dbb90a13eece9f7e90f904f883","bytes":490},"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."}]}}