I’m trying out Coq, but I’m not completely sure what I’m doing. Is: Theorem new_theorem : forall x, P:Prop /\ Q:Prop Equivalent to: ∀x ( P(x) and Q(x) ) Edit: I think they are.

# Category: proof

## Why can’t programs be proven?

Why can’t a computer program be proven just as a mathematical statement can? A mathematical proof is built up on other proofs, which are built up from yet more proofs and on down to axioms – those truths truths we hold as self evident. Computer programs don’t seem to have such a structure. If you […]