User:Boris Tsirelson/Sandbox1
For a mathematical theory, correctness means formalizability. "In practice, the mathematician ... is content to bring the exposition to a point where his experience and mathematical flair tell him that translation into formal language would be no more than an exercise of patience (though doubtless a very tedious one)."[1] Reliability of these experience and flair appear to be high but not perfect. Formalization is especially desirable in complicated cases, but feasible only in very simple cases, unless computers help. Similarly, without a computer a programmer is able to debug only very simple programs.
Top 100 theorems in Isabelle +
Formalizing 100 Theorems +
Isabelle +
Download and installation +
Projects +
The Isabelle2009-2 Library +
IsarMathLib: A library of formalized mathematics for Isabelle/ZF
The graphical user interface started.
The source file is read.
Definitions are processed; the formulation of the first lemma is being processed.
The formulation of the first lemma is processed; the goal is pending.
Notes
- ↑ Bourbaki 1968, page 8.
References
Bourbaki, Nicolas (1968), Elements of mathematics: Theory of sets, Hermann (original), Addison-Wesley (translation).