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

The fixed-point construction is dropped in as a technical lemma with no motivation

It arrives as a fact: for any property you can write down, there is a sentence asserting that property of itself. That is remarkable and it is presented like a lubricant for the proof. I would rather have spent a lecture on the lemma and taken the theorem on trust than the other way around.
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.