I can readily accept that the Godel sentence The theorem is that "This theorem is not provable" can be expressed in the language of Peanno Arithmetic.(adsbygoogle = window.adsbygoogle || []).push({});

2. Godel on the other side of a correspondence with the above, first translates the Godel sentence using the Godel numbering system

3. Having done this he translated the entire Peanno statement to the Godel numbering system.

This whole statement I think can be called a double diagonalization, in the sense that this is used in this content.

People use the diagonalization of numbers as an analogy to Godel's statement.

1. I cannot understand how translation of the Peanno statement to Godel's numbering system is diagonalization.

2. How does this procedure proves that the Godel sentence is neither provable and not proveable?

Thanks

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# A Godel and Diagonalization?

Have something to add?

Draft saved
Draft deleted

Loading...

Similar Threads - Godel Diagonalization | Date |
---|---|

I A twist in the Godel sentence | Apr 19, 2017 |

I Regarding Cantor's diagonal proof. | Feb 28, 2017 |

Which Godel statements are seen to be true by humans? | Mar 10, 2015 |

A confusion about Godel theorem and real numbers | Oct 9, 2014 |

Does Godel's theorem imply mathematics is more than logic? | Jan 15, 2014 |

**Physics Forums - The Fusion of Science and Community**