Abstract
We argue that for building mathematical knowledge repositories a broad development of theories is of major importance. Organizing mathematical knowledge in theories is an obvious approach to cope with the immense number of topics, definitions, theorems, and proofs in a general repository that is not restricted to a special field. However, concrete mathematical objects are often reinterpreted as special instances of a general theory, in this way reusing and refining existing developments. We believe that in order to become widely accepted mathematical knowledge management systems have to adopt this flexibility and to provide collections of well-developed theories.
As an example we describe the Mizar development of the theory of Gröbner bases, a theory which is built upon the theory of polynomials, ring (ideal) theory, and the theory of rewriting systems. Here, polynomials are considered both as ring elements and elements of rewriting systems. Both theories (and polynomials) already have been formalized in Mizar and are therefore refined and reused. Our work also includes a number of theorems that, to our knowledge, have been proved mechanically for the first time.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bancerek, G.: Reduction Relations; Formalized Mathematics (1995), available in JFM from [Miz05]
Bancerek, G.: On the Structure of Mizar Types. In: Geuvers, H., Kamareddine, F. (eds.) Proc. of MLC 2003. ENTCS, vol. 85(7) (2003)
Becker, T., Weispfenning, V.: Gröbner Bases — A Computational Approach to Commutative Algebra. Springer, Heidelberg (1993)
Backer, J., Rudnicki, P., Schwarzweller, C.: Ring Ideals; Formalized Mathematics (2000), available in JFM from [Miz05]
Buchberger, B.: A Criterion for Detecting Unnecessary Reductions in the Construction of Gröbner Bases. In: Ng, K.W. (ed.) EUROSAM 1979 and ISSAC 1979. LNCS, vol. 72, pp. 3–21. Springer, Heidelberg (1979)
Buchberger, B.: Introduction to Gröbner bases. In: Buchberger, B., Winkler, F. (eds.) Gröbner Bases and Applications, pp. 3–31. Cambridge University Press, Cambridge (1998)
Buchberger, B.: Mathematical Knowledge Management in Theorema. In: Buchberger, B., Caprotti, O. (eds.) Proceedings of the First International Workshop on Mathematical Knowledge Management, Linz, Austria (2001)
Cruz-Filipe, L., Geuvers, H., Wiedijk, F.: C-CoRN, the Constructive Coq Repository at Nijmegen, http://www.cs.kun.nl/~freek/notes/
Cox, D., Little, J., O’Shea, D.: Ideals, Varieties and Algorithms, 2nd edn. Springer, New York (1996)
Davies, M.: Obvious Logical Inferences. In: Proceedings of the 7th International Joint Conference on Artificial Intelligence, pp. 530–531 (1981)
Dershowitz, N., Jounnaud, J.P.: Rewrite Systems. In: van Leeuven, J. (ed.) Formal Models and Semantics — Handbook of Theoretical Computer Science, vol. B. Elsevier, Amsterdam (1990)
Farmer, W., Guttman, J., Thayer, F.: Little Theories. In: Kapur, D. (ed.) CADE 1992. LNCS, vol. 607, pp. 567–581. Springer, Heidelberg (1992)
Farmer, W., Guttman, J., Thayer, F.: IMPS – An Interactive Mathematical Proof System. Journal of Automated Reasoning 11, 213–248 (1993)
Grabowski, A., Schwarzweller, C.: Rough Concept Analysis — Theory Development in the Mizar System. In: Asperti, A., Bancerek, G., Trybulec, A. (eds.) MKM 2004. LNCS, vol. 3119, pp. 130–144. Springer, Heidelberg (2004)
Harrison, J.: Complex Quantifier Elimination in HOL. In: Supplementary Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logic, pp. 159–174 (2001)
Jaśkowski, S.: On the Rules of Suppositon in Formal Logic. Studia Logica 1 (1934)
Lee, G.: Piotr Rudnicki, Dickson’s Lemma; Formalized Mathematics (2002), available in JFM from [Miz05]
The Mizar Home Page, http://mizar.org
Medina-Bulo, J., Paloma-Lozano, F., Alonzo-Jiménez, J., Ruiz-Reina, J.-L.: Verified Computer Algebra in Acl2. In: Buchberger, B., Campbell, J. (eds.) AISC 2004. LNCS (LNAI), vol. 3249, pp. 171–184. Springer, Heidelberg (2004)
Rudnicki, P., Schwarzweller, C., Trybulec, A.: Commutative Algebra in the Mizar System. Journal of Symbolic Computation 32(1/2), 143–169 (2001)
Rudnicki, P., Trybulec, A.: Multivariate polynomials with arbitrary number of variables; Formalized Mathematics (1999), available in JFM from [Miz05]
Rudnicki, P., Trybulec, A.: Mathematical Knowledge Management in Mizar. In: Buchberger, B., Caprotti, O. (eds.) Proc. of MKM 2001, Linz, Austria (2001)
Tarski, A.: On Well-Ordered Subsets of Any Set. Fundamenta Mathematicae 32, 176–183 (1939)
Théry, L.: A Machine-Checked Implementation of Buchberger’s Algorithm. Journal of Automated Reasoning 26, 107–137 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schwarzweller, C. (2006). Gröbner Bases — Theory Refinement in the Mizar System. In: Kohlhase, M. (eds) Mathematical Knowledge Management. MKM 2005. Lecture Notes in Computer Science(), vol 3863. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11618027_20
Download citation
DOI: https://doi.org/10.1007/11618027_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31430-1
Online ISBN: 978-3-540-31431-8
eBook Packages: Computer ScienceComputer Science (R0)