How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Metatheoretic consistency lower bound for NMSC
Statement
Externally, in the metatheory , implies . Here each consistency assertion is evaluated on the standard natural-number proof codes using the arithmetic formula fixed in The standard certified provability predicate. No claim is made that an unspecified arithmetic base proves the displayed implication.
Facts & Assumptions
Given: The metatheory ; the fixed arithmetization of the calculus of The standard certified provability predicate.
proves that there is an inner model with a measurable cardinal (NMSC gives an inner model with a measurable cardinal). In the first-order class convention this has the following finite-fragment meaning: for each externally fixed finite set of target axioms, one uses a single class-defining formula (with its fixed parameters) for the asserted inner model, and the source theory proves nonemptiness of that class and every for . This is separate relativization for each fixed formula, not quantification over a class truth predicate (Relativization to sets and definable classes).
Every actual derivation is finite. If an actual -refutation uses the finite set of nonlogical axioms, apply [F1] only to that . Relativization to its one nonempty class predicate is an interpretation of the finite theory in the source theory, so the finite derivation translates to a source refutation (Interpretation transports derivations and inconsistency, Finite-fragment model transfer proves relative consistency).
This per-refutation, externally selected finite translation proves only the external consistency implication. It does not provide one fixed interpretation of all of , an effective selector of class predicates from proof codes, or a base-verifiable total refutation-code map. Any assertion that an arithmetic base proves the implication would require exactly such additional uniform data (Formal consistency transfer from a verified reduction).
Proof
Let and . Suppose, contrapositively, that an actual finite -refutation exists, and let be the finite set of nonlogical -axioms occurring in .
Apply the finite-fragment reading of the inner-model theorem [F1] to this particular . It supplies one definable nonempty class and -proofs of for every . With membership and equality unchanged, these finitely many obligations make relativization to an interpretation of the finite theory in .
Translate the fixed refutation through that finite interpretation. By [F2], its translated logical steps and the finitely many proofs from step 2.1 assemble into an actual -refutation. Thus every actual -refutation entails an actual -refutation, so absence of a -refutation entails absence of a -refutation. Under the standard-natural-number convention in the Statement, this is .
Remarks
- What is and is not used. The proof supplies the external syntactic consistency implication by selecting a definable-class relativization after a particular finite refutation is fixed. It neither claims one fixed global interpretation nor that a named arithmetic base proves the implication, and it does not build or assume a transitive set model of the source theory.
- AC. is part of both theories; the relativization of AC to the inner model is part of [F1], and no additional choice principle is used in the transfer (The Axiom of Choice).
Depends on
- NMSC gives an inner model with a measurable cardinal
- Relativization to sets and definable classes
- Interpretation transports derivations and inconsistency
- Formal consistency transfer from a verified reduction
- Finite-fragment model transfer proves relative consistency
- The standard certified provability predicate
- The Axiom of Choice
Used by
Dependency tree · two levels
23 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- William G. Fleissner, If all normal Moore spaces are metrizable, then there is an inner model with a measurable cardinal (standard reference, not scraped)
- Freiburg, Course Notes for Set Theory and Independence Proofs (2024), Lemma 3.5.12 p54 (standard reference, not scraped)