News for hackers. Stuff that matters.
Re:Proving false in Coq using an implementation bug by ObviousScience on Wednesday March 25, 2015 @12:26AM (#9261287)
Only for sufficiently powerful systems, I believe.

Things like first order logic are too simple to introduce the kinds of statements Godel used to prove the incompleteness theorem about arithmetic.

There are no comments on this comment yet.