Do You Really Understand Incompleteness?

Add to your list(s) Download to your calendar using vCal

• Lingyuan Ye (University of Cambridge)
• Monday 11 November 2024, 13:00-14:00
• FS07, Computer Laboratory.

If you have a question about this talk, please contact Ariadne Si Suo .

Gödel’s two incompleteness theorems are usually grouped together as a single result, but conceptually they are very different. In particular, I will talk about several “counterexamples” of Gödel’s second incompleteness theorem, which says that a computable theory containing enough arithmetic cannot prove its own consistency. The existence of such examples highlights the question of what the correct conceptual understanding of the statement of second incompleteness theorem should be. I will offer a solution based on categorical logic, where we can identify universal property of arithmetic. The incompleteness phenomena will then be consequences thereof.

This talk is part of the SANDWICH Seminar (Computer Laboratory) series.

This talk is included in these lists:

• FS07, Computer Laboratory
• tcw57’s list

Note that ex-directory lists are not shown.