2 thoughts on “Gödel Without Tears — 7”

  1. A curious feature of this, looked at today, is that when we decode n, as in the proof of theorem 28, and then ask whether the resulting expression is a term, what we would actually get, in a computer, is another encoding: a sequence of Unicode characters, perhaps.

    So in a way we haven’t gotten anywhere — unless the difficulty in seeing that theorem 28 is true is a difficulty in seeing how it would work for the particular encoding Godel chose.

Leave a Comment

Your email address will not be published.

Scroll to Top