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

The hypotheses get dropped every time the statement is repeated

The system has to be consistent, its axioms have to be effectively listable, and it has to be strong enough to handle a certain amount of arithmetic. Popular restatements keep the conclusion and discard all three. The discarded parts are what stop the theorem from applying to everything.
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.