Theorems · Theorem · logic and foundations

Computable.nat_rec

∀ {α : Type u_1} {σ : Type u_4} [inst : Primcodable α] [inst_1 : Primcodable σ] {f : α → ℕ} {g : α → σ}
  {h : α → ℕ × σ → σ},
  Computable f → Computable g → Computable₂ h → Computable fun a => Nat.rec (g a) (fun y IH => h a (y, IH)) (f a)

Defined in

Mathlib.Computability.Partrec

Cited by

2 results in Mathlib

Foundations

Depth 78 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

PrimcodablePrimcodable