I often read (for example, in Wikipedia on "Rosser's Trick") that in order for a proof of Gödel's First Incompleteness Theorem, one assumes an efficient consistent theory of numbers which includes a "sufficient fragment of elementary arithmetic". What minimum would qualify? Is Robinson's Q a minimum? (Among others, obviously.)(adsbygoogle = window.adsbygoogle || []).push({});

**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!

# I What is a sufficient piece of arithmetic for Gödel's first incompleteness theorem

Have something to add?

Draft saved
Draft deleted

Loading...

Similar Threads - sufficient piece arithmetic | Date |
---|---|

I Place pieces on a chessboard randomly until 2 are adjacent | Mar 18, 2016 |

Sufficiency and Necessity in Language and Math | Jun 15, 2015 |

Sufficient conditions for a Brownian motion | Sep 16, 2014 |

Factorisation Theorem for Sufficiency | Feb 21, 2014 |

Sufficiency of statistics | May 2, 2009 |

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