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.
EDIT: For example: 1+1=3. That's false. We've learnt that false=true, therefore 1+1=3 is true.