6. Representability of Recursive Functions


    In this chapter we prove Theorem A from chapter 5: all recursive functions and relations are representable. In order to do this, we need some lemmas about statements derivable from P. We will prove these statements model-theoretically, showing that they hold in any model M of P; hence by the completeness theorem they are derivable from P. 


    • Presentations referencing similar topics