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

Consistent and complete are used in the everyday sense in the same paragraph as the formal one

Formally, consistent means no contradiction is derivable and complete means every sentence in the language is settled one way or the other by the system. Both words also have loose everyday meanings that appear two lines away. In a subject where the whole point is precision this is a bad place to be sloppy.
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.