Home » 2017 » December

Monthly Archives: December 2017

Addition Operation on Natural Numbers – Set Theory

Hi, infinite-set readers. Set theory is back.

The previous post is on this link. Please read in advance to easily understand this post. Today we will discuss about the addition operation on natural numbers. Happy reading.

The consequence of the Finite Recursion Theorem raises a theorem. The theorem is also called Finite Recursion Theorem because the same in the rationale.

Theorem : (Finite Recursion Theorem)

Given any e\in E and the function f:E\rightarrow E, then there is a single function g:\omega\rightarrow E such that :

    \[ g\left(0\right)=e\mbox{ and }g\left(m^{+}\right)=f\left(g\left(m\right)\right)\mbox{ for all }m\in\omega\]

Proof :

Based on the above hypothesis, it can be formed :

    \[ p\left(x,y\right)\equiv\left(\left(x\in E\right)\wedge\left(y=f\left(x\right)\right)\right)\vee\left(\left(x\notin E\right)\wedge\left(y=0\right)\right)\]

with f is fuction from E to E. Obtained, p\left(x,y\right) is a binary predicate. With the previous proof of Finite Recursion Theorem in the previous post, then this theorem is proved.

(x) Theorem :

For any n\in\omega there is a single function S_{n}:\omega\rightarrow\omega such that :

    \[ S_{n}\left(0\right)=n\mbox{ and }S_{n}\left(x^{+}\right)=\left(S_{n}\left(x\right)\right)^{+}\]

Proof (more…)