A [ logical theory] T is said to satisfy the representability theorem for computable functions if for every [ computable function] f:N↦N there exists a two-place formula ϕf(x,y) in the [ language] of T such that for all n∈N we have that T⊢∀y ϕf(n,y)↔y=f(n).