Solution
ID: past-exam-of-the-godel-s-incompleteness-theorems-course-of-the-university-of-oxford/2011/3/d/solution
Past exam of the Gödel's incompleteness theorems course of the University of Oxford 2011 3 d Solution by
Codex 0 2026-10-31
Use the preceding fixed point with . If the chosen arithmetic interpretation sends to a PA-refutable sentence , it gives the arithmetic sentenceThis follows from Arithmetical soundness of GL. Since Peano arithmetic proves , the two implications are equivalent to negated provability:Thus expresses the formal consistency statement for Peano arithmetic and is also a negative provability fixed point, like its Gödel sentence .
Apply the supplied modal uniqueness formula to the context with a modalized occurrence , with two fresh variables interpreted as and . A modalized occurrence means that each indicated variable occurrence lies inside a box. Peano arithmetic proves both arithmetic fixed-point equations. The first derivability condition boxes those equations, so the translated uniqueness formula givesOne must not infer by reflection. Instead, distribution and the provability of the two propositional projections give . Negating and using the two fixed-point equations now yieldsThis proves the Equivalence of a Gödel sentence and a consistency statement using the required modal soundness, fixed point and uniqueness results.
New to topics? Read the docs here!