We showed that recursive functions and recursive sets are -representable in
. We also defined Gödel numberings and exhibited an example of one. This allowed us to define when a theory is recursive. Finally, we proved Gödel’s diagonal lemma.
We showed that recursive functions and recursive sets are -representable in
. We also defined Gödel numberings and exhibited an example of one. This allowed us to define when a theory is recursive. Finally, we proved Gödel’s diagonal lemma.
This entry was posted on Tuesday, January 29th, 2008 at 2:52 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.