Peano Arithmetic and Recursive Functions
摘要
Gödel’s incompleteness theorems apply to any axiomatic system that is powerful enough, a notion that will become precise in this chapter. Peano Arithmetic (PA) is a natural choice of an axiomatic system to discuss the theorems and will serve as our model axiomatic system for Chaps. 3 , 6 , 7 , 8 , and 10 .