Theorem 2.2.10.
Assuming that:
f
:
ℕ
k
→
ℕ
a partial function
Then
f
is recursive
if and only if
there is a
Σ
1
-formula
𝜃
(
x
¯
,
y
)
such that
y
=
f
(
x
¯
)
⟺
ℕ
⊨
𝜃
(
x
¯
,
y
)
.