Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-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.

The empty signature still needs a nonempty term domain

Example

In the empty nonlogical signature there are no closed terms. After adjoining constants c0,c1, with seed c0, there is a consistent complete deductively closed Henkin theory whose term quotient has exactly one element.

Facts & Assumptions

Given: No original constants, function symbols or relation symbols; equality is logical.

[F1]

A complete consistent Henkin theory with a seed has its well-defined closed-term quotient. (The closed-term quotient structure)

[F2]

Soundness implies that a theory with a model is consistent and every proved sentence is true there. (Soundness for arbitrary set signatures)

Verification

1.1

With no constants or functions, the term constructors give only variables, so none is closed. In the expanded signature each closed term is exactly one of the constants cn, because there are still no function symbols. Let A have carrier {0} and interpret every cn by 0. Put H=Th(A), the set of all expanded sentences true in this structure. Negation's truth clause makes exactly one of σ,¬σ belong to H. F2 makes H consistent; it also makes H deductively closed, since any sentence proved from H is true in A.

F2
2.1

For any existential sentence xϕ, if it is true in A, its only possible witness is 0=c0A, so ϕ[c0/x] is true. If it is false, the implication xϕϕ[c0/x] is true by the Boolean implication clause. Thus every such witness axiom belongs to H, and H is Henkin with seed c0. For all m,n the equation cm=cn is true since 0=0, so all and only the closed terms are in the one class [c0]={cn:n<ω}. The quotient of F1 is exactly {[c0]}. Its reduct is a singleton model of the original empty theory. This computation concerns this particular H, not every Henkin completion of the empty theory.

F1step 1.1

Depends on

Used by

Nothing in the library uses this result yet.

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