Diagonalization

Cantor famously used two versions of Diagonalization for his fundamental results in set theory. First, he used it to prove the uncountability of the set of real numbers. Second, he used a more general version to prove that the power set of a set A has a higher cardinality than A. In this talk we will discuss how Diagonalization is the core of many of delimitation theorems, such as Gödel's (First) Incompleteness Theorem or Turing's Undecidability Result. We will also review how this method is relates to the classical paradoxes and to the expressive power of (functional) programming languages