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.
Compactness produces a genuinely nonstandard element
Example
In the constructed countable model of , the new constant exceeds every numeral. Each finite list of these inequalities is realized in the standard structure, but their entire list has no standard realization.
Facts & Assumptions
Given: The language , its standard numerals and the model supplied below.
There is an at most countable model of the complete natural-number theory with an element greater than every numeral, obtained from finitely satisfiable inequalities. (A countable nonstandard model has an element above all numerals)
Verification
For the fragment use the standard expansion with . Its inequalities evaluate to , all true. For example the first three are , , with . With no inequalities use . Any accompanying finitely many sentences of remain true because the old structure has not changed.
A putative standard interpretation fails the inequality , since its evaluation is , which is false. Yet F1 supplies a new countable model and an element satisfying every inequality. Its numeral still denotes the -fold successor of zero; equals none of these values, because equality would turn the corresponding true inequality into , forbidden by the theory's irreflexivity sentence.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
4 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
- Weiss–D’Mello, Theorem 3 p15; explicit finite-fragment calculation in the local (0,S,<) language. (standard reference, not scraped)