SkipCaptcha
710
edits
Changes
Jump to navigation
Jump to search
Line 86:
Line 86: + + + + + +
User talk:MarkGall (view source)
Revision as of 03:24, September 24, 2009
, 03:24, September 24, 2009no edit summary
[[User:PatrickD|PatrickD]] 23:07, 23 September 2009 (EDT)
[[User:PatrickD|PatrickD]] 23:07, 23 September 2009 (EDT)
:Hi Patrick,
:Logic's not my forte (you may have noticed I haven't really touched those articles), but I believe everything you say is correct. I am certain that the only thing on the list of "undecidable problems" which is actually undecidable is the halting problem. "Undecidable" is certainly not the same thing as "not provable within ZF", and choice is independent of ZF, not undecidable. Your statement of incompleteness is also good, and I think understandable.
:If you haven't seen it, there's a nice little book called "Godel's Proof" by Nagel that sketches the proof (in 100+ pages) in a fairly nontechnical way. I couldn't give a formal statement of the theorem, but your summary is more or less the same as the one there. I'm looking forward to seeing the article!