Abstract
Classifying finite algebraic structures has been a major motivation behind much research in pure mathematics. Automated techniques have aided in this process, but this has largely been at a quantitative level. In contrast, we present a qualitative approach which produces verified theorems, which classify algebras of a particular type and size into isomorphism classes. We describe both a semi-automated and a fully automated bootstrapping approach to building and verifying classification theorems. In the latter case, we have implemented a procedure which takes the axioms of the algebra and produces a decision tree embedding a fully verified classification theorem. This has been achieved by the integration (and improvement) of a number of automated reasoning techniques: we use the Mace model generator, the HR and C4.5 machine learning systems, the Spass theorem prover, and the Gap computer algebra system to reduce the complexity of the problems given to Spass. We demonstrate the power of this approach by classifying loops, groups, monoids and quasigroups of various sizes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Colton, S.: Automated Theory Formation in Pure Mathematics. Springer, Heidelberg (2002)
Colton, S.: The HR program for theorem generation. In: Voronkov [15]
The GAP Group. GAP – Groups, Algorithms, and Programming, Version 4.3 (2002), http://www.gap-system.org
Humphreys, J.: A Course in Group Theory. Oxford University Press, Oxford (1996)
Kunen, K.: Single Axioms for Groups. J. of Autom. Reasoning 9(3), 291–308 (1992)
Kronecker, L.: Auseinandersetzung einiger Eigenschaften der Klassenanzahl idealer komplexer Zahlen. Monatsbericht der Berliner Akademie, pp. 881–889 (1870)
McCasland, R., Moore, M., Smith, P.: An introduction to Zariski spaces over Zariski topologies. Rocky Mountain Journal of Mathematics 28, 1357–1369 (1998)
McCune, W.: Single axioms for groups and Abelian groups with various operations. J. of Autom. Reasoning 10(1), 1–13 (1993)
McCune, W.: Mace4 Reference Manual and Guide. Argonne National Laboratory, ANL/MCS-TM-264 (2003)
McKay, B., Meinert, A., Myrvold, W.: Counting small latin squares. In: European Women in Mathematics Int. Workshop on Groups and Graphs, pp. 67–72 (2002)
Meier, A., Sorge, V., Colton, S.: Employing theory formation to guide proof planning. In: Calmet, J., Benhamou, B., Caprotti, O., Hénocque, L., Sorge, V. (eds.) AISC 2002 and Calculemus 2002. LNCS (LNAI), vol. 2385, pp. 275–289. Springer, Heidelberg (2002)
Quinlan, R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1993)
Schwenk, J.: A classification of abelian quasigroups. Rendiconti di Matematica, Serie VII 15, 161–172 (1995)
Slaney, J., Fujita, M., Stickel, M.: Automated reasoning and exhaustive search: Quasigroup existence problems. Comp. & Math. with Applications 29, 115–132 (1995)
Voronkov, A. (ed.): CADE 2002. LNCS (LNAI), vol. 2392. Springer, Heidelberg (2002)
Weidenbach, C., Brahm, U., Hillenbrand, T., Keen, E., Theobald, C., Topic, D.: SPASS version 2.0. In: Voronkov [15], pp. 275–279
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Colton, S., Meier, A., Sorge, V., McCasland, R. (2004). Automatic Generation of Classification Theorems for Finite Algebras. In: Basin, D., Rusinowitch, M. (eds) Automated Reasoning. IJCAR 2004. Lecture Notes in Computer Science(), vol 3097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25984-8_30
Download citation
DOI: https://doi.org/10.1007/978-3-540-25984-8_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22345-0
Online ISBN: 978-3-540-25984-8
eBook Packages: Springer Book Archive