Theorems · Theorem · logic and foundations

Computable.comp

∀ {α : Type u_1} {β : Type u_2} {σ : Type u_4} [inst : Primcodable α] [inst_1 : Primcodable β] [inst_2 : Primcodable σ]
  {f : β → σ} {g : α → β}, Computable f → Computable g → Computable fun a => f (g a)

Defined in

Mathlib.Computability.Partrec

Cited by

31 results in Mathlib

Foundations

Depth 15 from the axioms · uses propext, Quot.sound

Assumes

PrimcodablePrimcodablePrimcodable