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

Teach the numbering scheme with a small worked encoding before stating any theorem

Assign codes to a handful of symbols, encode a two-symbol formula by hand, and decode one back. Twenty minutes of arithmetic makes the phrase 'the system can talk about its own syntax' concrete. Everything afterwards is easier because the students have touched the mechanism.
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).Send light bulbs to show you like this suggestion!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.