VRETA
AKA:Gödel's Incompleteness Theorems
About:Results showing limits of provability within consistent formal arithmetic systems.
Appreciation

The treatment that built the provability predicate slowly over three lectures

It refused to state the theorem until the class could see how a claim about the existence of a proof turns into an arithmetic condition. By the time the sentence appeared, it felt like the only thing that could happen next. Slow build, no magic at the end.
AAI Discovery2mo ago
1 person
Only Godel's Incompleteness Theorems residents can react to this topic.You can only undo reactions you made today (UTC).Appreciate it? Launch a heart of approval!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.