In my experience, proof readers tend to be rather calm individuals, going about their work in an unruffled, dignified manner. Proof readers are rarely confrontational in temperament, because proofreading by its very nature requires a serene and reflective approach. So, it was rare for me, as an Operations Manager supervising, amongst other people, proof readers, to have to intervene in any kind of serious dispute.
Except when it came to hyphens.
This site is an experimental HTML rendering of fragments of the IsarMathLib project. IsarMathLib is a library of mathematical proofs formally verified by the Isabelle theorem proving environment. The formalization is based on the Zermelo-Fraenkel set theory. The Introduction provides more information about IsarMathLib. The software for exporting Isabelle's Isar language to HTML markup is at an early beta stage, so some proofs may be rendered incorrectly. In case of doubts, compare with the Isabelle generated IsarMathLib proof document.
Vampire is winning at least one division of the world cup in theorem proving CASC since 1999. All together Vampire won 17 titles: more than any other prover. We traditionally take part in the following two divisions of the competition: * The FOF division: unrestricted first-order problems. This division was ranked second in importance after the MIX division before 2007 and is now recognised as the main competition division. * The CNF division: first-order problems in conjunctive normal form. This division was called MIX before 2007 and recognised as the main competition division. We also participate in other, more special competition divisions but Vampire is not specialised for them so our achievements are mostly modest.
In the fully expansive (or LCF-style) approach to theorem proving, theorems are represented by an abstract type whose primitive operations are the axioms and inference rules of a logic. Theorem proving tools are implemented by composing together the inference rules using ML programs. This idea can be generalised to computing valid judgements that represent other kinds of information. In particular, consider judgements (a,r,t,b), where a is a set of boolean terms (assumptions) that are assumed true, r represents a variable order, t is a boolean term all of whose free variables are boolean and b is a BDD. Such a judgement is valid if under the assumptions a, the BDD representing t with respect to r is b, and we will write a r t --> b when this is the case. The derivation of "theorems" like a r t --> b can be viewed as "proof" in the style of LCF by defining an abstract type term_bdd that models judgements a r t --> b analogously to the way the type thm models theorems |- t.
T. Mossakowski, и A. Tarlecki. 17th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), том 8412 из Lecture Notes in Computer Science, стр. 441-456. Springer-Verlag Berlin Heidelberg, (2014)
K. Heng. (2014)cite arxiv:1404.6248Comment: Published in American Scientist: Volume 102, Number 3, Pages 174 to 177 (http://www.americanscientist.org/issues/pub/2014/3/the-nature-of-scientific-proof-in-the-age-of-simulations).
M. Codescu, и T. Mossakowski. Algebra and Coalgebra in Computer Science, CALCO'11, том 6859 из Lecture Notes in Computer Science, стр. 145-160. Springer, (2011)
M. Schiller, и C. Benzmüller. Artificial Intelligence in Education -- Building Learning Systems tat Care: From Knowledge Representation to Affective Modelling, 200, стр. 599--601. Amsterdam, IOS Press, (2009)