I don't have a clear idea of distinction between the two, to me the latter seems to be restatement of the former with added "procedure".(adsbygoogle = window.adsbygoogle || []).push({});

completeness: every statement in the system can be either proved or disproved in the system;

decidability: iff there exists an algorithm such that for every well-formed formula in that system there exists a maximum finite number N of steps such that the algorithm is capable of deciding in less than or equal to N algorithmic steps whether the formula is (semantically) valid or not valid;

So a system can be complete and undecidable, right? If system is incomplete, does that necessarily mean that it is also undecidable?

Could someone explain on a simple example?

Thanks in advance.

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

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!

# Completeness vs decidability

Loading...

Similar Threads - Completeness decidability | Date |
---|---|

Lattice/Complete lattice | Jun 10, 2014 |

Confidence of complete spatial randomness | May 8, 2014 |

Complete Random Design vs RCBD | Sep 7, 2013 |

Completeness notions in logic | Feb 23, 2013 |

First order logic: Soundness, Completeness, Decidability | Dec 13, 2005 |

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