Mathlib Map

Theorems · Theorem · logic and foundations

Nat.Partrec.Code.exists_code

∀ {f : ℕ →. ℕ}, Nat.Partrec f ↔ ∃ c, c.eval = f

A function is partial recursive if and only if there is a code implementing it. Therefore, eval is a universal partial recursive function.

Defined in
Mathlib.Computability.PartrecCode
Cited by
5 results in Mathlib
Foundations
Depth 93 from the axioms · uses propext, Classical.choice, Quot.sound

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites18

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by5

Results whose statement or proof uses this declaration.