Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
psibi
on March 25, 2015
|
parent
|
context
|
favorite
| on:
Proving false in Coq using an implementation bug
How does proving something false as true gives the logic system the ability to prove anything ? Can you explain it with an example
jstanley
on March 25, 2015
[–]
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.
heinrich5991
on March 25, 2015
|
parent
[–]
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.
Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: