Supporting results for pointwise provable equality.
Arithmetic operations obtained by minimization #
Truncated subtraction, integer square root, the two components of Cantor unpairing, divisibility, remainder, and the Gödel beta function, each defined by minimizing an arithmetic condition.
Each construction is accompanied by the theorem that it realizes the intended
function over the natural numbers. Those Computes theorems are the input of
the standard-model bridge, which turns a computation over ℕ into evaluation at
standard numerals in an arbitrary model.
Truncated subtraction d₀ - d₁: the least x with x + d₁ = d₀, or
0 when d₀ < d₁.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The integer square root of d: the least x with x * x ≤ d < (x+1) * (x+1).
Equations
- One or more equations did not get rendered due to their size.
Instances For
The first component of Cantor unpairing.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The second component of Cantor unpairing.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The characteristic value of d₀ ∣ d₁, decided by minimizing a quotient
bounded by d₁.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The remainder of d₀ on division by d₁.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The Gödel beta function: the di-th entry of the sequence coded by dn.
Equations
- One or more equations did not get rendered due to their size.