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

Every sketch stops exactly where my questions start

The outline goes: number the formulas, build a sentence that says it is not provable, done. My questions are all about how a sentence can refer to itself without circularity and how provability becomes an arithmetic condition. Those are the two things the sketch replaces with a gesture.
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.