Avigad on Incompleteness

If you’re interested in learning about recursion theory and the Godel incompleteness theorem, these lecture notes by Jeremy Avigad are terrific. In this approach, incompleteness follows from properties of algorithms, which I think is the clearest approach.

Leave a Reply

Your email address will not be published. Required fields are marked *

You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>