From what I understand of one of Godel's incompleteness theorems, it involves coding wffs into numbers. Each wff corresponds to a Godel number and each Godel number gives rise to a wff. And then by using a kind of logical isomorphism between the set of wffs and N, incompleteness of any "adequate" theory is implied by the fact that computability implies definability.(adsbygoogle = window.adsbygoogle || []).push({});

Is that basically right?

Assuming it is... Here's my question. We use arithmetic to encode formulas. What if we used a nonstandard model of arithmetic or some other poset to encode wffs? What kind of results do we get, for instance, something about infinitary logic if our model of arithmetic has unlimited numbers that could correspond to an infinite string of OR or AND?

Thanks.

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

Dismiss Notice

Join Physics Forums Today!

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

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

# Extensions of Godel's Theorem

Loading...

Similar Threads for Extensions Godel's Theorem | Date |
---|---|

I Extension of Turing computable | Nov 14, 2017 |

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

Mathematics to be simply an extension of logic | Jun 2, 2013 |

Extension of Binary Connectives to n-valued Logic? | Jul 10, 2012 |

Axiom of extension | May 4, 2012 |

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