Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-09
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.

Witness constants and Henkin theories

Definition

Let L be a set signature having at least one constant and H a set of L-sentences. Call H Henkin in the witness-axiom sense if for every existential sentence xϕ of L, some constant c of L satisfies

((xϕ)ϕ[c/x])H.

Here FV(ϕ){x}, and ϕ[c/x] replaces the free occurrences only. A constant has no free variables, so it is free for x and the result is a sentence. Instances with parameters are obtained first by replacing their other free variables by closed terms; no open formula is inserted into the sentence theory. Implication has the fixed primitive expansion ¬(ψ¬θ) of Terms and formulas as finite set codes.

This condition does not itself require consistency, deductive closure or decisions of all sentences. These are additional hypotheses of the later Henkin truth results. The source's term “Henkin set” packages those additional conditions with witnesses for true existential sentences; this item deliberately isolates the witness-axiom condition promised here.

For an arbitrary starting signature, adjoin a seed constant c and then disjoint tagged layers of witness constants, naming each new constant by its stage and the existential sentence for which it is introduced. Every later layer is disjoint from earlier ones and from the original symbols. The seed guarantees at least one closed term even for an empty signature. This specifies the language expansion and possible witness axioms, without asserting their consistency or the existence of a completion.

Conventions and prerequisites: Set signatures and finite syntax strings, Free variables and free-for substitution, Theories, models and semantic consequence.

Depends on

Used by

Dependency tree · two levels

8 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