ϵ">]>
Literature.
[1] Downloadable lecture notes available through the web page of the course.
[2] J. Komara and P. J. Voda. Lecture Notes in Theory of Computability. 2001.
[3] J. Komara and P. J. Voda. Metamathematics of Computer Programming. 2001.
Exercise. Show that primitive recursive functions are closed under iteration of unary functions.
Remark. Prove the claim in the following theory.
[CL] Remark. You can test your solution by interpreting the theory. Choose non-local interpretation.
Exercise. (1 point) Show that primitive recursive functions are closed under parameterless primitive recursive definitions.
Remark. Prove the claim for the special case in the following theory.