The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Modern computer algebra
An Overview of Rewrite Rule Laboratory (RRL)
RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
MKM from Book to Computer: A Case Study
MKM '03 Proceedings of the Second International Conference on Mathematical Knowledge Management
Proving the Chinese Remainder Theorem by the Cover Set Induction
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
A Refinement of de Bruijn's Formal Language of Mathematics
Journal of Logic, Language and Information
Translating mathematical vernacular into knowledge repositories
MKM'05 Proceedings of the 4th international conference on Mathematical Knowledge Management
Theory presentation combinators
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
| Hi-index | 0.00 |
Building a repository of proof-checked mathematical knowledge is without any doubt a lot of work, and besides the actual formalization process there is also the task of maintaining the repository. Thus it seems obvious to keep a repository as small as possible, in particular each piece of mathematical knowledge should be formalized only once. In this paper, however, we claim that it might be reasonable or even necessary to duplicate knowledge in a mathematical repository. We analyze different situations and reasons for doing so, provide a number of examples supporting our thesis and discuss some implications for building mathematical repositories.