you are viewing a single comment's thread
view the rest of the comments
[–] 1 point 3 years ago (1 child)

Gödel tapping the sign

No consistent system of axioms whose theorems can be listed by an effective procedure (i.e., an algorithm) is capable of proving all truths about the arithmetic of natural numbers

  • source
  • parent
  • hideshow 2 child comments
  • [–] 1 point 3 years ago* (last edited 3 years ago)

    :wojak-nooo: Kronecker and Wittgenstein crying: Noooo! you can't use a diagonalization argument to prove by contradiction.

    Cantor, Gödel and Turing: haha, well look at that, the diagonal can't exist. QED

    Whoops: Hilbert actually liked Cantor's proof.

  • source
  • parent