• 16 Posts
  • 111 Comments
Joined 7 months ago
cake
Cake day: December 8th, 2024

help-circle








  • I am sure there was a typo, it’s Gödel’s incompleteness theorem which proves that consistent systems are incomplete.

    Consistency means likely what you expect: it’s that you cannot reach contradiction from very axioms.

    The result is insane in my opinion, it means any sensible math system with basic arithmetic has a proposition that you cannot prove. AND you cannot also prove that the system is contradiction-free.

    It is completionist’s worst nightmare.