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

Where should a self-taught reader start on the actual proof rather than the popular version

I have read several popular accounts and I now want the real construction, including the numbering and the fixed-point step. Is the usual route a standard first logic text worked through from the beginning, or is there a shorter path once you already have basic predicate logic? I am trying to work out how much prerequisite I actually need.
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 question marks to show your curiosity!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.