News for hackers. Stuff that matters.
Re:Great Reading in Computer Science by ionfish on Friday December 10, 2010 @09:12PM (#1993938)
Set theory is generally accepted as a better foundation for mathematics than Principia's type theory, but if you wrote all those ZFC proofs with full formality they'd be pretty long too. This answer on Math Overflow is pretty indicative.

http://mathoverflow.net/questions/14356/bourbakis-epsilon-ca...

Usually mathematical arguments are relatively informal; every time you use set comprehension notation, for example, you're skipping a few steps in your proof (and note, of course, that the impredicative definitions one can use with it are open to e.g. Russell's paradox, which is why we have axiomatic set theory in the first place).

Re:Great Reading in Computer Science by jules on Saturday December 11, 2010 @06:07AM (#1994625)
If you want to do everything perfectly formally you're better off studying a computer based theorem prover like Coq. Not only if everything proven perfectly formally, the proof is also checked by a computer. This also allows conciser proofs because the theorem prover can often generate parts of your proof.