Incompleteness in a Nutshell

25.11.2022 09:00 - 09:20

Aristotelis Panagiotopoulos (Carnegie Mellon University)


Abstract: Gödel's incompleteness theorems constitute some of the most important mathematical results of the 20th century. While in order to formally state and fully prove these theorems from scratch it usually takes a semester of work, the main mechanism which underlies the proof of these results is not actually very hard. In this talk we will discuss a simple formal language in which "self-reference" is possible and we will use it to state and prove a "toy" version of Gödel's first incompleteness theorem.



Fakultät für Mathematik, Dekan R. I. Bot

SR. 16, 3.OG, OMP 1