Abstract
An automated reasoning program may be used in many different ways to assist with research in mathematics and related fields. The program used here for research in semigroup theory is ITP (Interactive Theorem Prover), designed at Argonne National Laboratory and at Northern Illinois University. It is a general purpose program, flexible in that it may call upon one inference rule or another, with choice dependent upon a given task in a given environment. Each step is available for scrutiny by the user; runs may be stopped at any time, and changes may be made as the user dictates.
ITP has been used to generate several types of semigroups, and to provide detailed analyses of Green's relations on these examples. It has been used to establish connections between R, L and D, and between these relations and regularity. All the proofs generated are readily accessible, and in some cases exhibit novel features. These results are preliminary to the planned project of equipping ITP with sufficient knowledge of semigroup theory to enable it to prove theorems in more depth. A third use has been to use the defining axioms for a local semilattice to generate some facts about free such objects. The results, while elementary, are encouraging.
Keywords
- Inference Rule
- Inverse Semigroup
- Regular Semigroup
- Semigroup Theory
- Semi Group
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your 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
Blyth, T. S. and R. B. McFadden, Naturally ordered regular semigroups with a greatest idempotent, Proc. Roy. Soc. Edinburgh, 91A,107–122,1981.
Bundy, A. The Computer Modelling of Mathematical Reasoning, Academic Press, 1983.
Howie, J. M., An Introduction to Semigroup Theory, Academic Press, 1976.
Lallement, G., Some algorithmic problems in semigroup presentations, This volume, 1986.
Lusk, E., McFadden, R., Using autoomated reasoning tools: A study of the Semigroup F2B2, Semigroup Forum (36), 1987, 75–88.
Meakin, J., The free local semilattice on a set, to appear.
Nambooripad, K. S. S., Structure of regular semigroups, Mem. Amer. Math. Soc. 224(1979).
Schein, B. M., Pseudo-semilattices and pseudo-lattices, Izv. Vyss, Ucebn, Zaved. Mat. 2(117)(1972), 81–94 (in Russian).
Wos, L., R. Overbeek, E. Lusk, J. Boyle, Automated Reasoning, Prentice Hall, 1984.
Winker, S. K., L. Wos, E. L. Lusk, Semigroups, Antiautomorphisms, and Involutions: A Computer Solution to an Open Problem, I, Mathematics of Computation, 37(156), 533–545.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag
About this paper
Cite this paper
McFadden, R.B. (1988). Automated theorem proving applied to the theory of semigroups. In: Jürgensen, H., Lallement, G., Weinert, H.J. (eds) Semigroups Theory and Applications. Lecture Notes in Mathematics, vol 1320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0083436
Download citation
DOI: https://doi.org/10.1007/BFb0083436
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19347-0
Online ISBN: 978-3-540-39225-5
eBook Packages: Springer Book Archive
