Representable Relation
A relation is representable in the theory iff there is a formula in such that
Representable Function
A function is representable in the theory iff there is a formula in the language such that (i) implies , (ii) implies .
Specifically when we consider as , we have the following definitions.
Definition (Representable Relation). Suppose and are the Peano Axioms.
Then the relation is represented in , or equivalently represents , by the -formula if for all ,
\begin{align} R(a_1,\dots,a_n) &\Longrightarrow PA \vdash \varphi(a_1,\dots,a_n), \\ \neg R(a_1,\dots,a_n) &\Longrightarrow PA \vdash \neg\varphi(a_1,\dots,a_n). \end{align}
Definition (Representable Function). A function is represented in , or equivalently represents , by the -formula if for all :
\begin{align} f(a_1,\dots,a_n) = b &\Longrightarrow PA \vdash \varphi(a_1,\dots,a_n,b), \\ f(a_1,\dots,a_n) \neq b &\Longrightarrow PA \vdash \neg\varphi(a_1,\dots,a_n,b). \end{align}
Remark
The reason that we have in representability definition and in definability definition is we don’t necessarily get consistency of and T, but it’s always true that for every exactly one of and will be the case.
Strongly Representable
A function is strongly representable in the theory iff there is a formula in the language such that (i) implies , (ii) implies
which states that encodes a function in every model of , not necessarily standard.