This short chapter, ‘Outlining a Gödelian Proof’ gives a first indication of the way that we are going to prove  (the semantic version of) the first incompleteness theorem by constructing a Gödel sentence which is true if and only if unprovable. The detailed construction has to wait until a later chapter; but we do meet the key idea of the arithmetization of syntax. The post Gödel Without Tears, slowly, 3 appeared first on Logic Matters.