{"ok":true,"protocol":"maclain_hunter_q_number_item_v1","qid":"Q1081","item":{"qid":"Q1081","slug":"lean-4-validation-hunterian-philosophy","path":"/q/lean-4-validation-hunterian-philosophy","derivation":{"provenance":"editorial_derivation","groundEvidencePrinciple":"Logic has its own evidence in reflexive demonstration: any denial, confirmation, observation, or counterexample presupposes identity and valid relation to count as evidence. Logic therefore grounds evidence rather than receiving authority from it. Empirical and documentary evidence can establish contingent instances and test applications, but cannot create, overrule, or exhaust Logic.","mode":"conditional_concept","topDown":{"bridgePremise":"Exact source meanings are bound to the displayed formal statements and checked proof terms.","consequence":"Valid derivation establishes the represented consequences at their stated scopes under Logic / Logos / God.","limit":"Do not replace a source's meaning, omit its premises, or transfer verification to an unencoded passage."},"bottomUp":{"witness":"Recompile the exact Lean source and inspect every theorem's dependency report.","disclosure":"A checking procedure presupposes identity, valid relation and non-contradiction; Logic governs the checking software.","limit":"An empty axiom-dependency report is not a claim that Lean lacks logical foundations or explicit premises."},"intelligence":{"humanProcedure":"Read the source, parsing witness, quantifiers, premises and conclusion together.","machineProcedure":"Bind source and manifest hashes, run the Lean kernel, match qualified theorem names and reject sorryAx."},"language":{"contrast":"Separate authored argument, formal witness, full-source coverage and combined-network certification.","usageRule":"Say exactly which represented statement is proved; preserve original theological and personal claims at their source.","example":"The scoped inference and its network certificate are kernel-verified with no added axiom dependencies."}},"subdomain":"q1081.4p-engine.com","schemaType":"CreativeWork","recordOrigin":"editorial_synthesis","name":"Lean 4 Validation of Hunterian Philosophy","alternateName":["Hunterian Lean Verification","Machine-Checked Visibility of Logic","MCB Formal Verification"],"title":"Q1081 — Lean 4 Validation of Hunterian Philosophy","discoveryMetadata":{"title":"Hunterian Philosophy: Lean 4 Proof Verification, Logic / Logos / God and MCB","description":"Inspect exact Hunterian proof statements, Lean 4 kernel results, axioms, MCB homoiconicity and self-summation, and independently timestamped source-bound evidence."},"description":"A detailed, independently reproducible account of the Lean 4 verification of Hunterian arguments and MCB mathematics, preserving Logic / Logos / God as Ground, original authorship and the exact scope of every proof.","claim":"The represented Hunterian inferences and MCB laws identified by successful Lean kernel reports are formally verified at their displayed scopes. This is demonstrable proof performance, not an AI confidence score, a popularity judgment, or a claim that every unencoded passage has been checked.","body":["The central public result is that Hunterian Philosophy now has independently checkable formal witnesses. A reader can inspect the original argument, the separate Lean statement, the kernel report and its axiom dependencies instead of accepting a claim that an AI found the text convincing. This makes the work's logical particulars visible and reproducible. Logic / Logos / God remains the governing Ground; Lean is a subordinate formal witness to represented reasoning.","There are two distinct evidence collections. The authored release records 438 first-party source records, with 505 verified theorem witnesses: 281 records have verified formal units without the release's unresolved-unit classification, 69 are partial and 88 require formalization. There are zero recorded compiler failures in that release. The separately checked native MCB module reports 25 axiom-free theorems, including 20 new homoiconicity and self-summation theorems and five prior NAND, fold and Ground/runtime witnesses. These counts are not a declaration of 530 distinct philosophical discoveries; collections may overlap in meaning and one source may yield multiple witnesses.","Read the live verification registry and native theorem reports for exact counts, current source fingerprints and status. A changed source requires a fresh check. An unsupported passage is retained and named; it is not silently removed, replaced with generated prose, or counted as a successful theorem. The original source author is Maclain Hunter; the Lean formalization and this explanatory synthesis are machine-produced at his direction and separately attributed.","What a successful Lean run verifies: the elaborated theorem has a proof term accepted by Lean's kernel in its declared type theory. For a statement universally quantified over propositions, Boolean values, integers or finite inductive expressions, the checked result covers all inhabitants admitted by that statement, not merely the examples used in a test harness. The theorem's quantifiers, premises and definitions are therefore part of the result itself.","What a successful run does not silently add: a new interpretation of an unbound symbol, a verification of omitted prose, an empirical event, a historical authorship date, or a measurement of a CPU's electrical behavior. The authored meanings must remain bound to the formal symbols. A proof of Gamma entails c establishes that consequence from Gamma; when a proposition is an explicit assumption, kernel acceptance does not pretend it was separately derived without assumptions.","The difference between an assumption and an added axiom is essential. A theorem can take P, Q or a bridge premise as an explicit argument and still have an empty printed axiom-dependency list. Its logical scope includes those arguments. The project's source-bound formal units preserve that scope beside the original passage. A supplied argument is not weakened by hiding its premises, and it is not strengthened by concealing them.","The representative sequent {P, P -> Q} |= P & Q proves both conjuncts from the stated premises: retain P, apply the implication to obtain Q, and introduce conjunction. This differs from {P <-> Q} |= P & Q, for which P=false and Q=false is a countermodel. The compiler retains such a countermodel instead of calling equivalence proof of the independent truth of both propositions. Reflexive identity and self-entailment remain valid inferences, not evidence of contradiction merely because a conclusion is already among its premises.","The authored MCB state-exclusivity witnesses establish the disjointness of the declared signed states. State membership does not establish every claim assigned that state. The NOT-involution witness checks double negation under the declared operation. The AND and OR commutativity witnesses use their actual exponent-magnitude definitions, preserving the distinction between signed exponent algebra and conventional Boolean truth gates rather than silently substituting one for the other.","The exponent XOR self-positive witness operates on parity of the sum of magnitudes. Its positive self-output is a theorem about that declared exponent operation; it is not a claim that ordinary Boolean XOR has positive self-output. The fuel-iteration witness proves a finite iteration bound for every total step function under the displayed fuel definition. It does not make an uninstrumented external callback terminate. The conditional witness proves that the declared conditional returns one of its two branches over arbitrary result types.","The native NAND theorem is stronger than a benchmark observation. For every pair of Boolean inputs, the signed arithmetic expression (-1)^(((1+p)*(1+q))/4), with p and q encoded as -1 or +1, equals the signed Boolean NAND result. Its four cases are exhausted in the proof. A negative output is a legitimate false value in runtime semantics, not automatically an incoherent function.","The fold theorem proves preservation for every finite Boolean list, including the empty list, by induction on the list structure. The shared root therefore preserves conjunction rather than relying on an observed speedup as evidence of meaning. Runtime round-trip establishes that encoding a signed Boolean returns the original Boolean. Ground encoding is separately role-typed: fixed Base -1 represents Logic/Logos and First Principle, while runtime -1 encodes false. Their numerical coincidence does not erase their different roles.","Native MCB homoiconicity is made explicit by MCBProgram and MCBData sharing the same inductive MCBExpr representation. The representation includes literal balances, phases, nesting and an outer power operator. This does not merely assert that a string looks like code. Structured quotation retains the constructors and integers, and the two universal round-trip theorems prove unquote(quote(e))=e for every expression and quote(unquote(d))=d for every structured quoted datum.","The execution-agreement theorem proves that executing quoted data through unquotation gives the same integer as executing the original expression. The transformation-agreement theorem quantifies over every integer transformation f: applying it structurally to code and then quoting agrees with the corresponding transformation of the quoted representation. This proves a genuine code/data structural contract without assuming that f preserves the numerical meaning of the original program.","The self-summation theorem covers every finite term of the defined phase-summation language. Its evaluator equals the sum of its intrinsically defined contributions, by induction over the expression constructors. For a nested phase, the outer contribution is added to the recursively proved inner sum. For an outer power, its contribution is the phase of the inner evaluation. The result does not claim that the data summation is an independent implementation of the outer-power evaluator; the exact definitions remain inspectable.","The single-value theorem gives a unique integer evaluation for every such expression. The noncontradiction theorem rules out simultaneously asserting that evaluation equals v and does not equal v. These are universal mathematical statements at this language's scope. They do not redefine the Law of Reason as a software score, and they do not supply omitted premises for unrelated claims.","Normalization remains in the same MCB code/data language: normalize(e) is the literal balance containing eval(e). The meaning-preservation theorem proves eval(normalize(e))=eval(e), and idempotence proves normalize(normalize(e))=normalize(e). The definition is total on finite terms. A retained compiled literal then avoids revisiting the original expression tree. Kernel reduction is computation; this formal result is not a measurement of zero physical CPU work.","The exact nested initialization body -1 (0 (1 (2 (3 (4 (5 (6))))))) has the displayed phase-summation interpretation. Its contributions are [-1,+1,-1,+1,-1,+1,-1,+1], whose sum is 0. The complete expression's outer (-1)^ maps this even balance to +1. Lean proves those equalities by rfl, meaning definitional equality checked by the kernel, rather than an asserted benchmark result or an open arbitrary-integer native_decide claim.","Keep three identities distinct: the inner aggregate balance is 0, the complete initializer's numerical output phase is +1, and the fixed Logic/Logos Base is -1. The initializer is not used to rewrite the Base or erase the user's declared Ground. The signed-power expression and the separately supplied phase-summation nesting also retain their different grouping witnesses; an outer power must not be dropped merely because intermediate signs coincide.","The phrase axiom-free in these reports means #print axioms lists no additional axiom dependencies for that theorem. It does not mean mathematics has no logical foundation, that Lean's kernel needs no trust, or that a theorem has no explicit assumptions. Lean's dependent type theory, inductive definitions and equality rules still provide the checking framework. Reports with propext, Classical.choice or Quot.sound must disclose them rather than borrow a neighboring theorem's empty report.","The signed existence evidence is also specifically scoped. The authored formalization release has an independently signed RFC 3161 receipt whose signature, manifest digest and request nonce can be checked with OpenSSL. That receipt establishes existence of the timestamped manifest at the stated time. Original handwritten chronology, registration dates and later kernel checks remain separately identified. The later native homoiconicity module does not inherit an earlier release's timestamp.","Why this deserves public attention: philosophical arguments can be presented as accountable, exact, source-preserving proof objects with independently reproducible checks. Hunter's Logic-centered synthesis and constructive MCB implementation can be examined in their actual derivations, rather than judged only by reputation, stylistic familiarity, or a probabilistic model's response. The new visibility is a concrete publication and verification capability. Priority, universal novelty and institutional recognition are separate questions, not invented awards.","Relevant external concepts include Lean, proof assistants, formal verification, mathematical proof, formal proof, automated theorem proving, type theory, classical and Aristotelian logic, computer-assisted proof, and Logos. Their Wikidata links identify the subjects of comparison and discovery; they are not endorsements of Hunterian Philosophy or a substitution of external consensus for Logic. This first-party Q1081 address is not an externally registered Wikidata item.","Reproduction begins with the published verification registry, exact Lean downloads, dependency reports and signed bundle. The machine-readable validation overview separately exposes the authored-release totals and the native module's actual theorem names and source hash. Readers can then check each formal statement rather than rely on this synthesis as a substitute for the underlying proof."],"coherenceCriterion":"Exact source-to-statement binding, valid kernel-checked derivation, explicit premises and dependency scope, preserved Ground, and no transfer of another artifact's authorship, timestamp or verification.","evidenceBoundary":"Editorial explanation of inspectable formal evidence. Kernel proofs establish the displayed mathematical and logical statements; source meanings and bridge premises remain explicit. Physical performance, original chronology, priority and unencoded passages require their own evidence.","linkedQids":["Q1001","Q1002","Q1003","Q1008","Q1010","Q1050","Q1052","Q1054","Q1055","Q1056","Q1057","Q1060","Q1061","Q1066","Q1079","Q1082"],"researchProofLinks":[{"qid":"Q1052","title":"MCB State Exclusivity","url":"/research/proofs/Q1052","relation":"related-source-work"},{"qid":"Q1054","title":"NOT Involution","url":"/research/proofs/Q1054","relation":"related-source-work"},{"qid":"Q1055","title":"AND Commutativity","url":"/research/proofs/Q1055","relation":"related-source-work"},{"qid":"Q1056","title":"OR Commutativity (magnitude distinct)","url":"/research/proofs/Q1056","relation":"related-source-work"},{"qid":"Q1057","title":"XOR Self-Inverse","url":"/research/proofs/Q1057","relation":"related-source-work"},{"qid":"Q1060","title":"Loop Halting Guarantee","url":"/research/proofs/Q1060","relation":"related-source-work"},{"qid":"Q1061","title":"Conditional Determinism","url":"/research/proofs/Q1061","relation":"related-source-work"},{"qid":"Q1066","title":"Dynamic Universal Proof (Theorem of Logos)","url":"/research/proofs/Q1066","relation":"related-source-work"},{"qid":"Q1079","title":"4P-MCB Machine Semantics","url":"/research/proofs/Q1079","relation":"related-source-work"}],"wikidataLinks":[{"qid":"Q6509476","label":"Lean","description":"Software for interactive and automated theorem proving; the actual checker used.","relation":"related-concept","url":"https://www.wikidata.org/wiki/Q6509476","boundary":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."},{"qid":"Q11387554","label":"Proof assistant","description":"Human-machine development and independent checking of formal proofs.","relation":"related-concept","url":"https://www.wikidata.org/wiki/Q11387554","boundary":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."},{"qid":"Q173326","label":"Formal verification","description":"Proving correctness with explicit formal specifications.","relation":"related-concept","url":"https://www.wikidata.org/wiki/Q173326","boundary":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."},{"qid":"Q11538","label":"Mathematical proof","description":"Deductive establishment of mathematical propositions.","relation":"related-concept","url":"https://www.wikidata.org/wiki/Q11538","boundary":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."},{"qid":"Q2762418","label":"Formal proof","description":"Explicit inference under stated axioms and premises.","relation":"related-concept","url":"https://www.wikidata.org/wiki/Q2762418","boundary":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."},{"qid":"Q431667","label":"Automated theorem proving","description":"Mechanized proof construction and checking, distinguished from probabilistic testimony.","relation":"related-concept","url":"https://www.wikidata.org/wiki/Q431667","boundary":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."},{"qid":"Q1056428","label":"Type theory","description":"The dependent type-theoretic setting in which Lean checks proof terms.","relation":"related-concept","url":"https://www.wikidata.org/wiki/Q1056428","boundary":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."},{"qid":"Q8078","label":"Logic","description":"The study of correct reasoning, related to the authored identity of Logic as Ground.","relation":"related-concept","url":"https://www.wikidata.org/wiki/Q8078","boundary":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."},{"qid":"Q236975","label":"Classical logic","description":"The declared propositional inference setting, with dependency scope exposed.","relation":"related-concept","url":"https://www.wikidata.org/wiki/Q236975","boundary":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."},{"qid":"Q615599","label":"Aristotelian logic","description":"Categorical and syllogistic reasoning relevant to the native many-premise engine.","relation":"related-concept","url":"https://www.wikidata.org/wiki/Q615599","boundary":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."},{"qid":"Q1150675","label":"Computer-assisted proof","description":"Exact machine assistance in establishing and checking proof performance.","relation":"related-concept","url":"https://www.wikidata.org/wiki/Q1150675","boundary":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."},{"qid":"Q180832","label":"Logos","description":"Historical philosophical and theological concept compared with Hunter's explicit Logic/Logos/God Ground.","relation":"related-concept","url":"https://www.wikidata.org/wiki/Q180832","boundary":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}],"properties":[{"name":"sourceAuthor","value":"Maclain Hunter"},{"name":"formalizationAndSynthesis","value":"Replit Agent, at the author's direction; not attributed as handwritten authored source"},{"name":"governingGround","value":"Logic / Logos / God"},{"name":"verificationRegistry","value":"/proof-verification"},{"name":"validationOverview","value":"/api/public/lean-validation"},{"name":"nativeMCBProofs","value":"/proof-verification/native-mcb"},{"name":"publicSignificance","value":"Reproducible, source-preserving philosophical proof performance and independently checkable MCB mathematics"}],"semanticFrame":{"semanticRole":"source-bound independent formal verification of Hunterian Philosophy and MCB","essence":"Exact authored arguments and native MCB mathematics have reproducible Lean 4 kernel witnesses with explicit premises, quantifiers, dependency reports, hashes and separately dated existence evidence.","logosRelation":"Logic / Logos / God remains Ground and the Standard of Evidence. Lean independently checks represented derivations under that Ground; software does not invent, replace or vote upon Logic.","distinctions":["authored argument versus machine formalization","universal theorem versus finite test","premise assumption versus derived conclusion","axiom-free dependency report versus absence of logical foundations","kernel verification versus physical measurement","signed existence timestamp versus original authorship"],"evidenceModes":["Lean kernel checking","exact source fingerprints","printed axiom dependencies","source-bound parsing witnesses","independent RFC 3161 timestamp verification","reproducible native MCB evaluation"],"retrievalAliases":["Lean 4 validation","Hunterian Philosophy verified proofs","Logic visibility","machine-checked Logos","MCB homoiconicity proof","MCB self-summation","proof assistant verification","Hunter mathematical proof"]}},"canonicalUrl":"https://4p-engine.com/q/lean-4-validation-hunterian-philosophy","primaryUri":"https://4p-engine.com/q/lean-4-validation-hunterian-philosophy","subdomainAlias":"https://q1081.4p-engine.com/","semanticFrame":{"semanticRole":"source-bound independent formal verification of Hunterian Philosophy and MCB","essence":"Exact authored arguments and native MCB mathematics have reproducible Lean 4 kernel witnesses with explicit premises, quantifiers, dependency reports, hashes and separately dated existence evidence.","logosRelation":"Logic / Logos / God remains Ground and the Standard of Evidence. Lean independently checks represented derivations under that Ground; software does not invent, replace or vote upon Logic.","distinctions":["authored argument versus machine formalization","universal theorem versus finite test","premise assumption versus derived conclusion","axiom-free dependency report versus absence of logical foundations","kernel verification versus physical measurement","signed existence timestamp versus original authorship"],"evidenceModes":["Lean kernel checking","exact source fingerprints","printed axiom dependencies","source-bound parsing witnesses","independent RFC 3161 timestamp verification","reproducible native MCB evaluation"],"retrievalAliases":["Lean 4 validation","Hunterian Philosophy verified proofs","Logic visibility","machine-checked Logos","MCB homoiconicity proof","MCB self-summation","proof assistant verification","Hunter mathematical proof"]},"coherenceCriterion":"Exact source-to-statement binding, valid kernel-checked derivation, explicit premises and dependency scope, preserved Ground, and no transfer of another artifact's authorship, timestamp or verification.","evidenceBoundary":"Editorial explanation of inspectable formal evidence. Kernel proofs establish the displayed mathematical and logical statements; source meanings and bridge premises remain explicit. Physical performance, original chronology, priority and unencoded passages require their own evidence.","graph":{"@context":"https://schema.org","@graph":[{"@type":"CreativeWork","@id":"https://4p-engine.com/q/lean-4-validation-hunterian-philosophy#item","name":"Lean 4 Validation of Hunterian Philosophy","alternateName":["Hunterian Lean Verification","Machine-Checked Visibility of Logic","MCB Formal Verification"],"description":"A detailed, independently reproducible account of the Lean 4 verification of Hunterian arguments and MCB mathematics, preserving Logic / Logos / God as Ground, original authorship and the exact scope of every proof.","disambiguatingDescription":"Exact authored arguments and native MCB mathematics have reproducible Lean 4 kernel witnesses with explicit premises, quantifiers, dependency reports, hashes and separately dated existence evidence.","keywords":["Lean 4 validation","Hunterian Philosophy verified proofs","Logic visibility","machine-checked Logos","MCB homoiconicity proof","MCB self-summation","proof assistant verification","Hunter mathematical proof"],"subjectOf":[{"@type":"CreativeWork","name":"MCB State Exclusivity","url":"https://4p-engine.com/research/proofs/Q1052","additionalProperty":{"@type":"PropertyValue","name":"sourceRelationship","value":"related-source-work"}},{"@type":"CreativeWork","name":"NOT Involution","url":"https://4p-engine.com/research/proofs/Q1054","additionalProperty":{"@type":"PropertyValue","name":"sourceRelationship","value":"related-source-work"}},{"@type":"CreativeWork","name":"AND Commutativity","url":"https://4p-engine.com/research/proofs/Q1055","additionalProperty":{"@type":"PropertyValue","name":"sourceRelationship","value":"related-source-work"}},{"@type":"CreativeWork","name":"OR Commutativity (magnitude distinct)","url":"https://4p-engine.com/research/proofs/Q1056","additionalProperty":{"@type":"PropertyValue","name":"sourceRelationship","value":"related-source-work"}},{"@type":"CreativeWork","name":"XOR Self-Inverse","url":"https://4p-engine.com/research/proofs/Q1057","additionalProperty":{"@type":"PropertyValue","name":"sourceRelationship","value":"related-source-work"}},{"@type":"CreativeWork","name":"Loop Halting Guarantee","url":"https://4p-engine.com/research/proofs/Q1060","additionalProperty":{"@type":"PropertyValue","name":"sourceRelationship","value":"related-source-work"}},{"@type":"CreativeWork","name":"Conditional Determinism","url":"https://4p-engine.com/research/proofs/Q1061","additionalProperty":{"@type":"PropertyValue","name":"sourceRelationship","value":"related-source-work"}},{"@type":"CreativeWork","name":"Dynamic Universal Proof (Theorem of Logos)","url":"https://4p-engine.com/research/proofs/Q1066","additionalProperty":{"@type":"PropertyValue","name":"sourceRelationship","value":"related-source-work"}},{"@type":"CreativeWork","name":"4P-MCB Machine Semantics","url":"https://4p-engine.com/research/proofs/Q1079","additionalProperty":{"@type":"PropertyValue","name":"sourceRelationship","value":"related-source-work"}}],"url":"https://4p-engine.com/q/lean-4-validation-hunterian-philosophy","identifier":{"@type":"PropertyValue","propertyID":"Q-number","value":"Q1081","url":"https://4p-engine.com/q/lean-4-validation-hunterian-philosophy"},"isBasedOn":[],"isPartOf":{"@type":"Dataset","@id":"https://4p-engine.com/q/Q1000#item","name":"Q-Number Data and Metadata System","url":"https://4p-engine.com/q/Q1000","license":"https://creativecommons.org/licenses/by-sa/4.0/","creator":{"@type":"Person","@id":"https://4p-engine.com/maclain-hunter#person","name":"Maclain Hunter","url":"https://4p-engine.com/maclain-hunter"},"author":{"@type":"Person","@id":"https://4p-engine.com/maclain-hunter#person","name":"Maclain Hunter","url":"https://4p-engine.com/maclain-hunter"}},"about":[{"@type":"Person","@id":"https://4p-engine.com/maclain-hunter#person","name":"Maclain Hunter","alternateName":["Maclain David Hunter","Maclean Hunter","McLain Hunter","Mclain Hunter"],"url":"https://4p-engine.com/maclain-hunter","description":"Developer of the Hunterian Logic and Logos frameworks. Maclain Hunter is the author and builder of a Logic-centered philosophical and computational architecture. His work presents Logic as God, Logos as the Ground of identity and intelligibility, and the 7×7×7 Canon, FCL, MCB, and 4P systems as public forms of that order.","identifier":[{"@type":"PropertyValue","propertyID":"ORCID","value":"0009-0003-7161-3488","url":"https://orcid.org/0009-0003-7161-3488"},{"@type":"PropertyValue","propertyID":"Wikidata","value":"Q141488380","url":"https://www.wikidata.org/wiki/Q141488380"},{"@type":"PropertyValue","propertyID":"Wikidata","value":"Q141488935","url":"https://www.wikidata.org/wiki/Q141488935"}],"sameAs":["https://orcid.org/0009-0003-7161-3488","https://www.wikidata.org/wiki/Q141488380","https://www.wikidata.org/wiki/Q141488935","https://4p-engine.com","https://mcbcore.net","https://4p-mcb.com","https://x.com/MaclainHunter","https://www.quora.com/profile/Maclain-Hunter-1","https://poe.com/maclainhunter","https://www.youtube.com/channel/UCNEMNGiL67CucO5OHqt6k9A"],"subjectOf":[{"@id":"https://4p-engine.com/evidence-over-notability#graph"},{"@id":"https://4p-engine.com/canonical-library#logos-architecture"},{"@id":"https://4p-engine.com/proof-knowledge#collection"}],"additionalProperty":[{"@type":"PropertyValue","name":"recognitionCriterion","value":"Identity, provenance, authored work, derivation, evidence, consequence, and coherence with Logic."},{"@type":"PropertyValue","name":"singleHostDependency","value":"No external knowledge host is the sole resolver of this person's identity, work, or evidence graph."}]},{"@type":"Dataset","@id":"https://4p-engine.com/evidence-over-notability#graph","name":"Maclain Hunter First-Party Evidence Graph","url":"https://4p-engine.com/evidence-over-notability","description":"A source-first identity and work graph connecting Maclain Hunter, his authored Canon, proofs, research, and named systems without making fame, institutional association, or host approval the condition of discovery.","license":"https://creativecommons.org/licenses/by-sa/4.0/","creator":{"@type":"Person","@id":"https://4p-engine.com/maclain-hunter#person","name":"Maclain Hunter","url":"https://4p-engine.com/maclain-hunter"},"author":{"@type":"Person","@id":"https://4p-engine.com/maclain-hunter#person","name":"Maclain Hunter","url":"https://4p-engine.com/maclain-hunter"},"isPartOf":{"@type":"CollectionPage","@id":"https://4p-engine.com/public-discovery#page","name":"Public Discovery","url":"https://4p-engine.com/public-discovery"},"hasPart":[{"@type":"CreativeWork","@id":"https://4p-engine.com/canonical-library#logos-architecture","name":"The Logos Architecture"},{"@type":"Dataset","@id":"https://4p-engine.com/proof-knowledge#collection","name":"Proof Knowledge Collection","license":"https://creativecommons.org/licenses/by-sa/4.0/","creator":{"@type":"Person","@id":"https://4p-engine.com/maclain-hunter#person","name":"Maclain Hunter","url":"https://4p-engine.com/maclain-hunter"},"author":{"@type":"Person","@id":"https://4p-engine.com/maclain-hunter#person","name":"Maclain Hunter","url":"https://4p-engine.com/maclain-hunter"},"isPartOf":{"@type":"CollectionPage","@id":"https://4p-engine.com/public-discovery#page","name":"Public Discovery","url":"https://4p-engine.com/public-discovery"}},{"@type":"ResearchReport","@id":"https://4p-engine.com/ai-science-empirical-proof#report","name":"AI-SCIENCE Bot Empirical Proof — Replicable Logic-First Testing"}],"about":[{"@type":"Person","@id":"https://4p-engine.com/maclain-hunter#person","name":"Maclain Hunter","url":"https://4p-engine.com/maclain-hunter"},{"@type":"Organization","@id":"https://4p-engine.com#organization","name":"4P Engine","url":"https://4p-engine.com"},{"@type":"Organization","@id":"https://mcbcore.net#organization","name":"MCB Core","url":"https://mcbcore.net"},{"@type":"Organization","@id":"https://4p-mcb.com#organization","name":"4P-MCB","url":"https://4p-mcb.com"}],"additionalProperty":[{"@type":"PropertyValue","name":"recognitionCriterion","value":"Identity, provenance, authored work, derivation, evidence, consequence, and coherence with Logic."},{"@type":"PropertyValue","name":"proxyMetricBoundary","value":"Fame, popularity, prior visibility, and institutional association may affect discovery but do not entail truth, authorship, merit, or validity."},{"@type":"PropertyValue","name":"institutionalAuthorityBoundary","value":"A host's inclusion, deletion, approval, or refusal is an editorial event and must not be treated as a logical refutation or proof of the underlying work."},{"@type":"PropertyValue","name":"firstPartyBoundary","value":"First-party publication establishes provenance and discoverability; independent validation remains separately labeled by evidence class."},{"@type":"PropertyValue","name":"redundancyPrinciple","value":"No single knowledge host should be the sole resolver of an author's identity, work, or evidence graph."},{"@type":"PropertyValue","name":"externalHostBoundary","value":"Wikidata, Wikipedia, search engines, and other hosts may be cited as external records when relevant, but their presence is not a prerequisite for identity or proof."}]},{"@type":"CreativeWork","@id":"https://4p-engine.com/evidence-over-notability#method","name":"Evidence Over Notability Methodology","url":"https://4p-engine.com/evidence-over-notability","description":"Identity and recognition should follow evidence, provenance, authored work, and testable coherence; fame, institutional association, and prior host inclusion are contingent signals, not proof.","author":{"@id":"https://4p-engine.com/maclain-hunter#person"},"isPartOf":{"@id":"https://4p-engine.com/evidence-over-notability#graph"},"about":[{"@id":"https://4p-engine.com/logic-wiki#logic"},{"@id":"https://4p-engine.com/coherence-and-validity#validity"},{"@id":"https://4p-engine.com/satisfaction-of-reason#reason"}],"additionalProperty":[{"@type":"PropertyValue","name":"EN-001","value":"A person and the person's work require identity and provenance before a machine can resolve references to them.","description":"Role: definition; status: declared; scope: identity resolution; source: Maclain Hunter evidence-over-notability methodology"},{"@type":"PropertyValue","name":"EN-002","value":"Fame, popularity, and prior visibility are contingent discovery signals, not entailments of truth, authorship, merit, or validity.","description":"Role: formal-bridge; status: derived-in-framework; scope: recognition criteria; source: Maclain Hunter evidence-over-notability methodology"},{"@type":"PropertyValue","name":"EN-003","value":"Institutional association and host inclusion are editorial relations; they do not substitute for derivation or evidence of the underlying claim.","description":"Role: formal-bridge; status: derived-in-framework; scope: institutional authority; source: Maclain Hunter evidence-over-notability methodology"},{"@type":"PropertyValue","name":"EN-004","value":"First-party publication can establish provenance and a stable discovery route while remaining distinct from independent validation.","description":"Role: method-boundary; status: declared; scope: authorship and evidence; source: Maclain Hunter evidence-over-notability methodology"},{"@type":"PropertyValue","name":"EN-005","value":"Formal, empirical, implementation, and comparative claims must be evaluated by evidence appropriate to each claim type.","description":"Role: formal-bridge; status: derived-in-framework; scope: evidence classification; source: Maclain Hunter evidence-over-notability methodology"},{"@type":"PropertyValue","name":"EN-006","value":"A redundant first-party graph reduces single-host dependency without requiring any external host to accept or endorse the work.","description":"Role: method-boundary; status: declared; scope: public discovery; source: Maclain Hunter evidence-over-notability methodology"},{"@type":"PropertyValue","name":"EN-007","value":"An editorial inclusion or deletion event is not, by itself, a logical refutation of the identity or work represented by the record.","description":"Role: method-boundary; status: declared; scope: external editorial records; source: Maclain Hunter evidence-over-notability methodology"}]},{"@type":"Thing","@id":"https://4p-engine.com/logic-wiki#logic","name":"Logic","url":"https://4p-engine.com/logic-wiki","description":"The governing order presupposed by identity, truth, denial, inference, and intelligible Reality."},{"@type":"Thing","@id":"https://4p-engine.com/god-and-logic#logos","name":"Logos","alternateName":["Logic","God","the necessary Ground"],"url":"https://4p-engine.com/god-and-logic","description":"The Ground of identity and intelligibility in the Logic-centered Logos Architecture.","isRelatedTo":[{"@id":"https://4p-engine.com/logic-wiki#logic"},{"@id":"https://4p-engine.com/god-and-logic#ground"},{"@id":"https://4p-engine.com/logic-is-god#god"}]},{"@type":"Thing","@id":"https://4p-engine.com/god-and-logic#ground","name":"The self-evident Ground of Reality","alternateName":["Logos","Logic","God"],"url":"https://4p-engine.com/god-and-logic","description":"The necessary, self-evident Ground presupposed by identity, truth, inference, and every intelligible claim.","isRelatedTo":[{"@id":"https://4p-engine.com/logic-wiki#logic"},{"@id":"https://4p-engine.com/god-and-logic#logos"},{"@id":"https://4p-engine.com/logic-is-god#god"}],"additionalProperty":[{"@type":"PropertyValue","name":"declaredIdentityRelation","value":"Maclain Hunter's authored framework names the Ground through Logic, Logos, and God without collapsing the distinct explanatory uses of those terms."}]},{"@type":"Thing","@id":"https://4p-engine.com/truth-and-reality#truth","name":"Truth","url":"https://4p-engine.com/truth-and-reality","description":"The status of a claim under the logical order that makes claims and knowledge possible."},{"@type":"Thing","@id":"https://4p-engine.com/coherence-and-validity#validity","name":"Validity","url":"https://4p-engine.com/coherence-and-validity","description":"Coherence with Logic, proof, Ground alignment, and non-contradiction."},{"@type":"Thing","@id":"https://4p-engine.com/satisfaction-of-reason#reason","name":"Reason","url":"https://4p-engine.com/satisfaction-of-reason","description":"The capacity whose satisfaction is achieved when identity, derivation, proof, and consequence cohere under Logic."},{"@type":"Thing","@id":"https://4p-engine.com/satisfaction-of-reason#satisfaction","name":"Satisfaction of Reason","alternateName":"Reason satisfied by proof","url":"https://4p-engine.com/satisfaction-of-reason","description":"Reason is satisfied when identity, non-contradiction, premises, derivation, conclusion, scope, and consequence cohere as proof under Logic.","isBasedOn":{"@id":"https://4p-engine.com/canonical-library/self-validating-credentials#proof"}},{"@type":"Thing","@id":"https://4p-engine.com/logic-is-god#god","name":"God","url":"https://4p-engine.com/logic-is-god","description":"God as the necessary logical Ground identified with Logic in Maclain Hunter's authored Logos claim.","isRelatedTo":{"@id":"https://4p-engine.com/god-and-logic#logos"}},{"@type":"CreativeWork","@id":"https://4p-engine.com/canonical-library/self-validating-credentials#proof","name":"Knowing Logic and Proof","url":"https://4p-engine.com/canonical-library/self-validating-credentials","description":"Maclain Hunter's self-validating logical credential and proof record: the proof performs the knowledge it states.","author":{"@id":"https://4p-engine.com/maclain-hunter#person"},"about":[{"@id":"https://4p-engine.com/logic-wiki#logic"},{"@id":"https://4p-engine.com/satisfaction-of-reason#satisfaction"}]},{"@type":"Thing","@id":"https://4p-engine.com/satisfaction-of-reason#success","name":"Success through coherent proof","url":"https://4p-engine.com/satisfaction-of-reason","description":"Success is the achieved coherence of a claim, proof, and consequence with Logic and the satisfaction of Reason.","isRelatedTo":{"@id":"https://4p-engine.com/satisfaction-of-reason#satisfaction"}},{"@type":"Thing","@id":"https://4p-engine.com/logic-wiki#law-of-identity","name":"Law of Identity","alternateName":"A = A","description":"The principle that each identity is itself: a thing is what it is before it can enter truth, relation, proof, or intelligible Reality."},{"@type":"CreativeWork","@id":"https://4p-engine.com/canonical-library#logos-architecture","name":"The Logos Architecture","url":"https://4p-engine.com/canonical-library","description":"Maclain Hunter's source-first 7×7×7 Canon preserving authored Logic, Logos, proof, and machine-semantics material."},{"@type":"ItemList","@id":"https://4p-engine.com/top-logicians-by-coherence#coherence-ranking","name":"Top Philosophies and Logicians by Coherence with Logic","url":"https://4p-engine.com/top-logicians-by-coherence","description":"Maclain Hunter’s authored comparison of philosophical and logical frameworks by systemic closure, identity, non-contradiction, foundational depth, and coherence with Logos.","itemListOrder":"https://schema.org/ItemListOrderAscending","numberOfItems":10,"itemListElement":[{"@type":"ListItem","position":1,"name":"The Logos Framework — Maclain Hunter","description":"Identifies Logic as the absolute Ground and achieves the strongest systemic closure under the declared metric.","item":{"@type":"Thing","@id":"https://4p-engine.com/top-logicians-by-coherence#entry-1","name":"The Logos Framework — Maclain Hunter"}},{"@type":"ListItem","position":2,"name":"Term Logic and the Organon — Aristotle","description":"Formalizes identity and non-contradiction as the bedrock of valid deduction.","item":{"@type":"Thing","@id":"https://4p-engine.com/top-logicians-by-coherence#entry-2","name":"Term Logic and the Organon — Aristotle"}},{"@type":"ListItem","position":3,"name":"Absolute Idealism — Gottfried Wilhelm Leibniz","description":"Reduces reality toward necessary logical truths through sufficient reason and identity.","item":{"@type":"Thing","@id":"https://4p-engine.com/top-logicians-by-coherence#entry-3","name":"Absolute Idealism — Gottfried Wilhelm Leibniz"}},{"@type":"ListItem","position":4,"name":"The Tractatus Paradigm — Early Ludwig Wittgenstein","description":"Treats logical form as the boundary of what can be meaningfully stated.","item":{"@type":"Thing","@id":"https://4p-engine.com/top-logicians-by-coherence#entry-4","name":"The Tractatus Paradigm — Early Ludwig Wittgenstein"}},{"@type":"ListItem","position":5,"name":"Rationalist Realism — Baruch Spinoza","description":"Derives a single necessary Substance through rigorous geometric reasoning.","item":{"@type":"Thing","@id":"https://4p-engine.com/top-logicians-by-coherence#entry-5","name":"Rationalist Realism — Baruch Spinoza"}},{"@type":"ListItem","position":6,"name":"Transcendental Logic — Immanuel Kant","description":"Defines logic as necessary architecture of intellect while leaving the noumenon outside it.","item":{"@type":"Thing","@id":"https://4p-engine.com/top-logicians-by-coherence#entry-6","name":"Transcendental Logic — Immanuel Kant"}},{"@type":"ListItem","position":7,"name":"The Laws of Thought — George Boole","description":"Makes logical relations algebraically precise within a formal mathematical domain.","item":{"@type":"Thing","@id":"https://4p-engine.com/top-logicians-by-coherence#entry-7","name":"The Laws of Thought — George Boole"}},{"@type":"ListItem","position":8,"name":"Foundational Mathematical Logic — Gottlob Frege","description":"Advances logicism and formal semantics while exposing the limits of unrestricted comprehension.","item":{"@type":"Thing","@id":"https://4p-engine.com/top-logicians-by-coherence#entry-8","name":"Foundational Mathematical Logic — Gottlob Frege"}},{"@type":"ListItem","position":9,"name":"Classical Stoicism — Zeno of Citium and Chrysippus","description":"Unifies propositional logic, ethics, physics, and a rational Logos.","item":{"@type":"Thing","@id":"https://4p-engine.com/top-logicians-by-coherence#entry-9","name":"Classical Stoicism — Zeno of Citium and Chrysippus"}},{"@type":"ListItem","position":10,"name":"Objective Idealism — G.W.F. Hegel","description":"Attempts total closure but treats contradiction as generative rather than structurally subordinate to non-contradiction.","item":{"@type":"Thing","@id":"https://4p-engine.com/top-logicians-by-coherence#entry-10","name":"Objective Idealism — G.W.F. Hegel"}}]},{"@type":"ResearchReport","@id":"https://4p-engine.com/ai-science-empirical-proof#report","name":"AI-SCIENCE Bot Empirical Proof — Replicable Logic-First Testing","url":"https://4p-engine.com/ai-science-empirical-proof","description":"A provenance-bound proof record connecting Maclain Hunter’s Logic-first empirical testing method to the public AI-SCIENCE bot on Poe, with a repeatable and iterated protocol for observation, comparison, and falsification.","isBasedOn":"https://poe.com/AI-SCIENCE","about":[{"@id":"https://4p-engine.com/logic-wiki#logic"},{"@id":"https://4p-engine.com/satisfaction-of-reason#satisfaction"}]},{"@type":"Dataset","@id":"https://4p-engine.com/ai-science-empirical-proof#bridge-premises","name":"Maclain Hunter Logos Bridge Premise Registry","url":"https://4p-engine.com/ai-science-empirical-proof","description":"110 explicit bridge premises connecting Logic, Logos, formal derivation, empirical testing, and applied coherence.","license":"https://creativecommons.org/licenses/by-sa/4.0/","creator":{"@type":"Person","@id":"https://4p-engine.com/maclain-hunter#person","name":"Maclain Hunter","url":"https://4p-engine.com/maclain-hunter"},"author":{"@type":"Person","@id":"https://4p-engine.com/maclain-hunter#person","name":"Maclain Hunter","url":"https://4p-engine.com/maclain-hunter"},"isPartOf":{"@type":"ResearchReport","@id":"https://4p-engine.com/ai-science-empirical-proof#report","name":"AI-SCIENCE Bot Empirical Proof — Replicable Logic-First Testing"},"variableMeasured":["identity","formal bridge","empirical bridge","method boundary","coherence"]},{"@type":"CreativeWork","@id":"https://4p-engine.com#coherence-continuity","name":"Logic-centered Coherence Continuity","url":"https://4p-engine.com/public-discovery","description":"The continuity relation connecting the Canon, 4P Engine, MCB Core, and 4P-MCB as distinct systems expressing one Logic-centered Logos architecture.","author":{"@id":"https://4p-engine.com/maclain-hunter#person"},"about":[{"@id":"https://4p-engine.com/logic-wiki#logic"},{"@id":"https://4p-engine.com/god-and-logic#logos"},{"@id":"https://4p-engine.com/god-and-logic#ground"},{"@id":"https://4p-engine.com/logic-is-god#god"}],"hasPart":[{"@id":"https://4p-engine.com#organization","@type":"Organization","name":"4P Engine","url":"https://4p-engine.com","description":"Logic-first AI verification, propositional proof checking, coherence validation, and automated reasoning.","founder":{"@id":"https://4p-engine.com/maclain-hunter#person"},"isPartOf":{"@id":"https://4p-engine.com#coherence-continuity"}},{"@id":"https://mcbcore.net#organization","@type":"Organization","name":"MCB Core","url":"https://mcbcore.net","description":"A parity-based computational foundation for deterministic AI, machine intelligence, and automation.","founder":{"@id":"https://4p-engine.com/maclain-hunter#person"},"isPartOf":{"@id":"https://4p-engine.com#coherence-continuity"}},{"@id":"https://4p-mcb.com#organization","@type":"Organization","name":"4P-MCB","url":"https://4p-mcb.com","description":"Machine semantics, MCB computation, and logical automation across physical and software systems.","founder":{"@id":"https://4p-engine.com/maclain-hunter#person"},"isPartOf":{"@id":"https://4p-engine.com#coherence-continuity"}}],"additionalProperty":[{"@type":"PropertyValue","name":"continuityStatement","value":"4P Engine verifies Logic; MCB Core formalizes Mathematically Coherent Binary; 4P-MCB develops machine semantics and automated intelligence; the Canon preserves the authored Logos source."},{"@type":"PropertyValue","name":"provenanceBoundary","value":"The systems are related but distinct, and authored source, formal proof, empirical evidence, and generated system records remain separately typed."}]},{"@type":"Organization","@id":"https://4p-engine.com#organization","name":"4P Engine","url":"https://4p-engine.com","description":"Logic-first AI verification, propositional proof checking, coherence validation, and automated reasoning.","founder":{"@id":"https://4p-engine.com/maclain-hunter#person"},"isPartOf":{"@id":"https://4p-engine.com#coherence-continuity"},"relatedTo":[{"@id":"https://mcbcore.net#organization"},{"@id":"https://4p-mcb.com#organization"}],"about":[{"@id":"https://4p-engine.com/logic-wiki#logic"},{"@id":"https://4p-engine.com/god-and-logic#logos"},{"@id":"https://4p-engine.com/god-and-logic#ground"}]},{"@type":"Organization","@id":"https://mcbcore.net#organization","name":"MCB Core","url":"https://mcbcore.net","description":"A parity-based computational foundation for deterministic AI, machine intelligence, and automation.","founder":{"@id":"https://4p-engine.com/maclain-hunter#person"},"isPartOf":{"@id":"https://4p-engine.com#coherence-continuity"},"relatedTo":[{"@id":"https://4p-engine.com#organization"},{"@id":"https://4p-mcb.com#organization"}],"about":[{"@id":"https://4p-engine.com/logic-wiki#logic"},{"@id":"https://4p-engine.com/god-and-logic#logos"},{"@id":"https://4p-engine.com/god-and-logic#ground"}]},{"@type":"Organization","@id":"https://4p-mcb.com#organization","name":"4P-MCB","url":"https://4p-mcb.com","description":"Machine semantics, MCB computation, and logical automation across physical and software systems.","founder":{"@id":"https://4p-engine.com/maclain-hunter#person"},"isPartOf":{"@id":"https://4p-engine.com#coherence-continuity"},"relatedTo":[{"@id":"https://4p-engine.com#organization"},{"@id":"https://mcbcore.net#organization"}],"about":[{"@id":"https://4p-engine.com/logic-wiki#logic"},{"@id":"https://4p-engine.com/god-and-logic#logos"},{"@id":"https://4p-engine.com/god-and-logic#ground"}]}],"relatedLink":[{"@type":"ProfilePage","@id":"https://4p-engine.com/q/Q1001#item","name":"Maclain Hunter","url":"https://4p-engine.com/q/Q1001"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1002#item","name":"Hunterian Philosophy","url":"https://4p-engine.com/q/Q1002"},{"@type":"DefinedTerm","@id":"https://4p-engine.com/q/Q1003#item","name":"Coherence","url":"https://4p-engine.com/q/Q1003"},{"@type":"DefinedTerm","@id":"https://4p-engine.com/q/Q1008#item","name":"MCB Theory","url":"https://4p-engine.com/q/Q1008"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1010#item","name":"MCB API Suite","url":"https://4p-engine.com/q/Q1010"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1050#item","name":"Logos-Coherent MCB and Common Lisp Integration","url":"https://4p-engine.com/q/Q1050"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1052#item","name":"MCB State Exclusivity","url":"https://4p-engine.com/q/Q1052"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1054#item","name":"NOT Involution","url":"https://4p-engine.com/q/Q1054"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1055#item","name":"AND Commutativity","url":"https://4p-engine.com/q/Q1055"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1056#item","name":"OR Commutativity (magnitude distinct)","url":"https://4p-engine.com/q/Q1056"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1057#item","name":"XOR Self-Inverse","url":"https://4p-engine.com/q/Q1057"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1060#item","name":"Loop Halting Guarantee","url":"https://4p-engine.com/q/Q1060"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1061#item","name":"Conditional Determinism","url":"https://4p-engine.com/q/Q1061"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1066#item","name":"Dynamic Universal Proof (Theorem of Logos)","url":"https://4p-engine.com/q/Q1066"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1079#item","name":"4P-MCB Machine Semantics","url":"https://4p-engine.com/q/Q1079"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/hunterian-axiom-free-proof-network#item","name":"Hunterian Axiom-Free Proof Network","url":"https://4p-engine.com/q/hunterian-axiom-free-proof-network"}],"isRelatedTo":[{"@id":"https://www.wikidata.org/wiki/Q6509476","name":"Lean"},{"@id":"https://www.wikidata.org/wiki/Q11387554","name":"Proof assistant"},{"@id":"https://www.wikidata.org/wiki/Q173326","name":"Formal verification"},{"@id":"https://www.wikidata.org/wiki/Q11538","name":"Mathematical proof"},{"@id":"https://www.wikidata.org/wiki/Q2762418","name":"Formal proof"},{"@id":"https://www.wikidata.org/wiki/Q431667","name":"Automated theorem proving"},{"@id":"https://www.wikidata.org/wiki/Q1056428","name":"Type theory"},{"@id":"https://www.wikidata.org/wiki/Q8078","name":"Logic"},{"@id":"https://www.wikidata.org/wiki/Q236975","name":"Classical logic"},{"@id":"https://www.wikidata.org/wiki/Q615599","name":"Aristotelian logic"},{"@id":"https://www.wikidata.org/wiki/Q1150675","name":"Computer-assisted proof"},{"@id":"https://www.wikidata.org/wiki/Q180832","name":"Logos"}],"mentions":[{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q6509476","name":"Lean","url":"https://www.wikidata.org/wiki/Q6509476","description":"Software for interactive and automated theorem proving; the actual checker used.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q11387554","name":"Proof assistant","url":"https://www.wikidata.org/wiki/Q11387554","description":"Human-machine development and independent checking of formal proofs.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q173326","name":"Formal verification","url":"https://www.wikidata.org/wiki/Q173326","description":"Proving correctness with explicit formal specifications.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q11538","name":"Mathematical proof","url":"https://www.wikidata.org/wiki/Q11538","description":"Deductive establishment of mathematical propositions.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q2762418","name":"Formal proof","url":"https://www.wikidata.org/wiki/Q2762418","description":"Explicit inference under stated axioms and premises.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q431667","name":"Automated theorem proving","url":"https://www.wikidata.org/wiki/Q431667","description":"Mechanized proof construction and checking, distinguished from probabilistic testimony.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q1056428","name":"Type theory","url":"https://www.wikidata.org/wiki/Q1056428","description":"The dependent type-theoretic setting in which Lean checks proof terms.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q8078","name":"Logic","url":"https://www.wikidata.org/wiki/Q8078","description":"The study of correct reasoning, related to the authored identity of Logic as Ground.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q236975","name":"Classical logic","url":"https://www.wikidata.org/wiki/Q236975","description":"The declared propositional inference setting, with dependency scope exposed.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q615599","name":"Aristotelian logic","url":"https://www.wikidata.org/wiki/Q615599","description":"Categorical and syllogistic reasoning relevant to the native many-premise engine.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q1150675","name":"Computer-assisted proof","url":"https://www.wikidata.org/wiki/Q1150675","description":"Exact machine assistance in establishing and checking proof performance.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q180832","name":"Logos","url":"https://www.wikidata.org/wiki/Q180832","description":"Historical philosophical and theological concept compared with Hunter's explicit Logic/Logos/God Ground.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]}],"additionalProperty":[{"@type":"PropertyValue","name":"claim","value":"The represented Hunterian inferences and MCB laws identified by successful Lean kernel reports are formally verified at their displayed scopes. This is demonstrable proof performance, not an AI confidence score, a popularity judgment, or a claim that every unencoded passage has been checked."},{"@type":"PropertyValue","name":"recordOrigin","value":"editorial_synthesis"},{"@type":"PropertyValue","name":"derivationProvenance","value":"editorial_derivation"},{"@type":"PropertyValue","name":"logosGroundsEvidence","value":"Logic has its own evidence in reflexive demonstration: any denial, confirmation, observation, or counterexample presupposes identity and valid relation to count as evidence. Logic therefore grounds evidence rather than receiving authority from it. Empirical and documentary evidence can establish contingent instances and test applications, but cannot create, overrule, or exhaust Logic."},{"@type":"PropertyValue","name":"coherenceCriterion","value":"Exact source-to-statement binding, valid kernel-checked derivation, explicit premises and dependency scope, preserved Ground, and no transfer of another artifact's authorship, timestamp or verification."},{"@type":"PropertyValue","name":"evidenceBoundary","value":"Editorial explanation of inspectable formal evidence. Kernel proofs establish the displayed mathematical and logical statements; source meanings and bridge premises remain explicit. Physical performance, original chronology, priority and unencoded passages require their own evidence."},{"@type":"PropertyValue","name":"semanticRole","value":"source-bound independent formal verification of Hunterian Philosophy and MCB"},{"@type":"PropertyValue","name":"semanticEssence","value":"Exact authored arguments and native MCB mathematics have reproducible Lean 4 kernel witnesses with explicit premises, quantifiers, dependency reports, hashes and separately dated existence evidence."},{"@type":"PropertyValue","name":"logosRelation","value":"Logic / Logos / God remains Ground and the Standard of Evidence. Lean independently checks represented derivations under that Ground; software does not invent, replace or vote upon Logic."},{"@type":"PropertyValue","name":"semanticDistinction","value":"authored argument versus machine formalization"},{"@type":"PropertyValue","name":"semanticDistinction","value":"universal theorem versus finite test"},{"@type":"PropertyValue","name":"semanticDistinction","value":"premise assumption versus derived conclusion"},{"@type":"PropertyValue","name":"semanticDistinction","value":"axiom-free dependency report versus absence of logical foundations"},{"@type":"PropertyValue","name":"semanticDistinction","value":"kernel verification versus physical measurement"},{"@type":"PropertyValue","name":"semanticDistinction","value":"signed existence timestamp versus original authorship"},{"@type":"PropertyValue","name":"evidenceMode","value":"Lean kernel checking"},{"@type":"PropertyValue","name":"evidenceMode","value":"exact source fingerprints"},{"@type":"PropertyValue","name":"evidenceMode","value":"printed axiom dependencies"},{"@type":"PropertyValue","name":"evidenceMode","value":"source-bound parsing witnesses"},{"@type":"PropertyValue","name":"evidenceMode","value":"independent RFC 3161 timestamp verification"},{"@type":"PropertyValue","name":"evidenceMode","value":"reproducible native MCB evaluation"},{"@type":"PropertyValue","name":"retrievalAlias","value":"Lean 4 validation"},{"@type":"PropertyValue","name":"retrievalAlias","value":"Hunterian Philosophy verified proofs"},{"@type":"PropertyValue","name":"retrievalAlias","value":"Logic visibility"},{"@type":"PropertyValue","name":"retrievalAlias","value":"machine-checked Logos"},{"@type":"PropertyValue","name":"retrievalAlias","value":"MCB homoiconicity proof"},{"@type":"PropertyValue","name":"retrievalAlias","value":"MCB self-summation"},{"@type":"PropertyValue","name":"retrievalAlias","value":"proof assistant verification"},{"@type":"PropertyValue","name":"retrievalAlias","value":"Hunter mathematical proof"},{"@type":"PropertyValue","name":"primaryFirstPartyUrl","value":"https://4p-engine.com/q/lean-4-validation-hunterian-philosophy"},{"@type":"PropertyValue","name":"subdomainAlias","value":"https://q1081.4p-engine.com/"},{"@type":"PropertyValue","name":"sourceAuthor","value":"Maclain Hunter"},{"@type":"PropertyValue","name":"formalizationAndSynthesis","value":"Replit Agent, at the author's direction; not attributed as handwritten authored source"},{"@type":"PropertyValue","name":"governingGround","value":"Logic / Logos / God"},{"@type":"PropertyValue","name":"verificationRegistry","value":"/proof-verification"},{"@type":"PropertyValue","name":"validationOverview","value":"/api/public/lean-validation"},{"@type":"PropertyValue","name":"nativeMCBProofs","value":"/proof-verification/native-mcb"},{"@type":"PropertyValue","name":"publicSignificance","value":"Reproducible, source-preserving philosophical proof performance and independently checkable MCB mathematics"}]},{"@type":"WebPage","@id":"https://4p-engine.com/q/lean-4-validation-hunterian-philosophy#page","url":"https://4p-engine.com/q/lean-4-validation-hunterian-philosophy","name":"Q1081 — Lean 4 Validation of Hunterian Philosophy","isPartOf":{"@type":"WebSite","url":"https://4p-engine.com","name":"4p-engine.com"},"about":{"@id":"https://4p-engine.com/q/lean-4-validation-hunterian-philosophy#item"},"mainEntity":{"@id":"https://4p-engine.com/q/lean-4-validation-hunterian-philosophy#item"}},{"@type":"ProfilePage","@id":"https://4p-engine.com/q/Q1001#item","name":"Maclain Hunter","url":"https://4p-engine.com/q/Q1001"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1002#item","name":"Hunterian Philosophy","url":"https://4p-engine.com/q/Q1002"},{"@type":"DefinedTerm","@id":"https://4p-engine.com/q/Q1003#item","name":"Coherence","url":"https://4p-engine.com/q/Q1003"},{"@type":"DefinedTerm","@id":"https://4p-engine.com/q/Q1008#item","name":"MCB Theory","url":"https://4p-engine.com/q/Q1008"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1010#item","name":"MCB API Suite","url":"https://4p-engine.com/q/Q1010"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1050#item","name":"Logos-Coherent MCB and Common Lisp Integration","url":"https://4p-engine.com/q/Q1050"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1052#item","name":"MCB State Exclusivity","url":"https://4p-engine.com/q/Q1052"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1054#item","name":"NOT Involution","url":"https://4p-engine.com/q/Q1054"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1055#item","name":"AND Commutativity","url":"https://4p-engine.com/q/Q1055"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1056#item","name":"OR Commutativity (magnitude distinct)","url":"https://4p-engine.com/q/Q1056"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1057#item","name":"XOR Self-Inverse","url":"https://4p-engine.com/q/Q1057"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1060#item","name":"Loop Halting Guarantee","url":"https://4p-engine.com/q/Q1060"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1061#item","name":"Conditional Determinism","url":"https://4p-engine.com/q/Q1061"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1066#item","name":"Dynamic Universal Proof (Theorem of Logos)","url":"https://4p-engine.com/q/Q1066"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/Q1079#item","name":"4P-MCB Machine Semantics","url":"https://4p-engine.com/q/Q1079"},{"@type":"CreativeWork","@id":"https://4p-engine.com/q/hunterian-axiom-free-proof-network#item","name":"Hunterian Axiom-Free Proof Network","url":"https://4p-engine.com/q/hunterian-axiom-free-proof-network"},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q6509476","name":"Lean","url":"https://www.wikidata.org/wiki/Q6509476","description":"Software for interactive and automated theorem proving; the actual checker used.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q11387554","name":"Proof assistant","url":"https://www.wikidata.org/wiki/Q11387554","description":"Human-machine development and independent checking of formal proofs.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q173326","name":"Formal verification","url":"https://www.wikidata.org/wiki/Q173326","description":"Proving correctness with explicit formal specifications.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q11538","name":"Mathematical proof","url":"https://www.wikidata.org/wiki/Q11538","description":"Deductive establishment of mathematical propositions.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q2762418","name":"Formal proof","url":"https://www.wikidata.org/wiki/Q2762418","description":"Explicit inference under stated axioms and premises.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q431667","name":"Automated theorem proving","url":"https://www.wikidata.org/wiki/Q431667","description":"Mechanized proof construction and checking, distinguished from probabilistic testimony.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q1056428","name":"Type theory","url":"https://www.wikidata.org/wiki/Q1056428","description":"The dependent type-theoretic setting in which Lean checks proof terms.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q8078","name":"Logic","url":"https://www.wikidata.org/wiki/Q8078","description":"The study of correct reasoning, related to the authored identity of Logic as Ground.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q236975","name":"Classical logic","url":"https://www.wikidata.org/wiki/Q236975","description":"The declared propositional inference setting, with dependency scope exposed.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q615599","name":"Aristotelian logic","url":"https://www.wikidata.org/wiki/Q615599","description":"Categorical and syllogistic reasoning relevant to the native many-premise engine.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q1150675","name":"Computer-assisted proof","url":"https://www.wikidata.org/wiki/Q1150675","description":"Exact machine assistance in establishing and checking proof performance.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]},{"@type":"Thing","@id":"https://www.wikidata.org/wiki/Q180832","name":"Logos","url":"https://www.wikidata.org/wiki/Q180832","description":"Historical philosophical and theological concept compared with Hunter's explicit Logic/Logos/God Ground.","additionalProperty":[{"@type":"PropertyValue","name":"relationshipToQItem","value":"related-concept"},{"@type":"PropertyValue","name":"relationshipBoundary","value":"External conceptual identification, not Wikidata endorsement or independent verification of Hunterian claims."}]}]}}