With this definition of completeness, Gödels Incompleteness result seems not surprising, so why it was back then? – math.stackexchange.com

According to wikipedia a theory (i.e. a set of sentences) is complete iff for every formula either it, or its negation, is provable. On the other side, a logic is complete, iff semantically valid, ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Artikel Terkait

0 Comment to "With this definition of completeness, Gödels Incompleteness result seems not surprising, so why it was back then? – math.stackexchange.com"