COMPUTERS AND UNIVERSAL ALGEBRA

by Stanley Burris

This talk will look at feasible computational projects
in universal algebra, with an overview of the `technology'
used to study the three-element groupoids, and prospects for
future work. We also plan some discussion of more theoretical
directions, such as those involved in automated theorem proving.