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

The first and the second theorem are used interchangeably in everything I read outside mathematics

One produces a sentence that the system can neither prove nor refute; the other says such a system cannot prove a statement expressing its own consistency. They are different results with different content. Seeing them merged makes it impossible to tell which claim someone is actually making.
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.