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

Nobody told me that complete consistent theories exist

I came away thinking incompleteness was a universal fact about all formal systems. In fact there are consistent, complete and decidable theories, including some genuinely useful fragments; the theorems apply once a system reaches a certain arithmetic strength. That threshold is the interesting part and it was invisible.
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).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.