We introduced the course, stated the incompleteness theorems, defined (Robinson Arithmetic), (Peano or first-order Arithmetic), and (the subsystem of second-order Arithmetic given by the arithmetic comprehension axiom).
Advertisements
We introduced the course, stated the incompleteness theorems, defined (Robinson Arithmetic), (Peano or first-order Arithmetic), and (the subsystem of second-order Arithmetic given by the arithmetic comprehension axiom).
This entry was posted on Tuesday, January 15th, 2008 at 6:22 pm and is filed under 116b: Computability and incompleteness. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.