tag:blogger.com,1999:blog-6792710671733445593.post5523809115655222939..comments2018-09-06T05:22:21.095-07:00Comments on Summer of GĂ¶del: Sound formal systems with sufficiently expressive languages are incompleteDavid Furcyhttp://www.blogger.com/profile/12284114397975852146noreply@blogger.comBlogger3125tag:blogger.com,1999:blog-6792710671733445593.post-20329836287594516972018-09-06T05:17:35.021-07:002018-09-06T05:17:35.021-07:00Nice post .Keep updating Artificial Intelligence O...Nice post .Keep updating <a href="https://onlineitguru.com/artificial-intelligence-online-training.html" rel="nofollow"><b>Artificial Intelligence Online Training </b></a><br />Radha Saihttps://www.blogger.com/profile/14429600841601246656noreply@blogger.comtag:blogger.com,1999:blog-6792710671733445593.post-92146900677519567942018-08-30T04:49:33.316-07:002018-08-30T04:49:33.316-07:00This comment has been removed by the author.Radha Saihttps://www.blogger.com/profile/14429600841601246656noreply@blogger.comtag:blogger.com,1999:blog-6792710671733445593.post-60334350365321952672013-06-25T10:52:49.967-07:002013-06-25T10:52:49.967-07:00Since the proof of theorem 1 does not rely on the ...Since the proof of theorem 1 does not rely on the definition of K, it seems to me that a general statement of the main idea underlying this proof by contradiction is the following:<br /><br />If the set of true sentences were effectively enumerable, then the complement of every effectively enumerable set would have to be effectively enumerable (which we know is not true).David Furcyhttps://www.blogger.com/profile/12284114397975852146noreply@blogger.com