Proofs, proofs, proofs, and proofs
Artificial Intelligence
2010-05-28 v1 Logic in Computer Science
History and Overview
Abstract
In logic there is a clear concept of what constitutes a proof and what not. A proof is essentially defined as a finite sequence of formulae which are either axioms or derived by proof rules from formulae earlier in the sequence. Sociologically, however, it is more difficult to say what should constitute a proof and what not. In this paper we will look at different forms of proofs and try to clarify the concept of proof in the wider meaning of the term. This has implications on how proofs should be represented formally.
Keywords
Cite
@article{arxiv.1005.5124,
title = {Proofs, proofs, proofs, and proofs},
author = {Manfred Kerber},
journal= {arXiv preprint arXiv:1005.5124},
year = {2010}
}
Comments
10 pages, To appear in The 9th International Conference on Mathematical Knowledge Management: MKM 2010