News for hackers. Stuff that matters.
Re:Proving false in Coq using an implementation bug by psibi on Wednesday March 25, 2015 @08:25AM (#9262434)
How does proving something false as true gives the logic system the ability to prove anything ? Can you explain it with an example
Re:Proving false in Coq using an implementation bug by jstanley on Wednesday March 25, 2015 @08:42AM (#9262521)
Any statement is either true or false. If we can prove that false is true, then any statement is true.

EDIT: For example: 1+1=3. That's false. We've learnt that false=true, therefore 1+1=3 is true.

Re:Proving false in Coq using an implementation bug by heinrich5991 on Wednesday March 25, 2015 @09:17AM (#9262688)
I don't think it's that easy. Not every statement is either true or false in Coq, you'd need to accept the law of excluded middle for that.