On duplication in mathematical repositories

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.

[1]  Freek Wiedijk On the usefulness of formal methods , 2006 .

[2]  Christoph Schwarzweller Modular Integer Arithmetic , 2008, Formaliz. Math..

[3]  James H. Davenport,et al.  MKM from Book to Computer: A Case Study , 2003, MKM.

[4]  Hantao Zhang,et al.  Proving the Chinese Remainder Theorem by the Cover Set Induction , 1992, CADE.

[5]  Kornilowicz Artur HOW TO DEFINE TERMS IN MIZAR EFFECTIVELY , 2009 .

[6]  Volker Sorge,et al.  Intuitive and Formal Representations: The Case of Matrices , 2004, MKM.

[7]  Adam Naumowicz,et al.  Improving Mizar Texts with Properties and Requirements , 2004, MKM.

[8]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[9]  Fairouz Kamareddine,et al.  A Refinement of de Bruijn's Formal Language of Mathematics , 2004, J. Log. Lang. Inf..

[10]  Christoph Schwarzweller,et al.  The Chinese Remainder Theorem, its Proofs and its Generalizations in Mathematical Repositories , 2009 .

[11]  Josef Urban,et al.  Momm - Fast Interreduction and Retrieval in Large Libraries of Formalized Mathematics , 2006, Int. J. Artif. Intell. Tools.

[12]  de Ng Dick Bruijn,et al.  The Mathematical Vernacular, A Language for Mathematics with Typed Sets , 1994 .

[13]  Michael Kohlhase Proceedings of the 4th international conference on Mathematical Knowledge Management , 2005 .

[14]  Henk C. A. van Tilborg Chinese Remainder Theorem , 2005, Encyclopedia of Cryptography and Security.

[15]  A. Kondracki,et al.  The Chinese Remainder Theorem , 2019, Certain Number-Theoretic Episodes in Algebra.

[16]  Deepak Kapur,et al.  An Overview of Rewrite Rule Laboratory (RRL) , 1989, RTA.

[17]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[18]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[19]  Joe Hurd,et al.  Verification of the Miller-Rabin probabilistic primality test , 2003, J. Log. Algebraic Methods Program..

[20]  Adam Grabowski,et al.  Translating Mathematical Vernacular into Knowledge Repositories , 2005, MKM.

[21]  R. Gregory Taylor,et al.  Modern computer algebra , 2002, SIGA.