Representability theorem for computable functions

https://arbital.com/p/representability_theorem_for_computable_functions

by Jaime Sevilla Molina Sep 21 2016


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