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

An account that separated what the theorems say from what people say they say

It gave the precise statements with hypotheses, then a section listing common restatements and explaining exactly which clause each one drops. As someone writing for a general audience, that second section was worth more to me than the proof. More expositions should include it.
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.