Cameron Freer vdash- A Formal Math Commons

my name is cameron freer also

Why microsft? That's so uncool

It has become quite clear by now that writing a
computer verifiable proof of some non-trivial statement
is actually quite hard. I assume that in finite combinatorics
or similar fields verifiable proof are actually doable, but
what if the notion that the theorem talks about are more complex? How difficult is it practically to write a computer
verifiable proof of something interesting like Ramsey's
theorem or some classics in analysis like the Heine-Borel
theorem?

In the beginning everyone thought Wikipedia is not possible. Wiki might prove a good way to do this kind of stuff (building mathematics that can be checked by the computer).