Slides from talks by George F. McNulty
The computational complexity of deciding whether a finite algebra generates a minimal variety.
Conference on Universal Algebra and Lattice Theory in Honor of Bela Csakany
Szeged, Hungary, June 2012.
The computational complexity of deciding whether a finite algebra generates a minimal variety.
Special Session of the American Mathematical Society
Honolulu, HI, March 2012.
Finitely based varieties and quasivarieties---Or Ralph tell us all that you know!
Second International Conference on Order, Algebra, and Logic
Krakow, Poland, June 2011.
How undecidable is the elementary theory of the lattice of equational theories?
JardaFest, Prague, The Czech Republic, June 2010
A dozen easy problems.
American Mathematical Society Special Session, St. Paul, Minnesota, April 2010
Automatic algebras, finitely based or not.
Conference on Algorithmic Complexity and Universal Algebra, Szeged, Hungary, July 2007
Algorithmic problems for equations and algebras.
International Conference on Order, Algebra, and Logics, Nashville, Tennesee, June 2007
The equational compatibility problem for the real line.
American Mathematical Society Special Session, New Orleans, Louisiana, January 2007
The equational complexity of Visin's algebra
American Mathematical Society Special Session, Lincoln, Nebraska, August 2005
Some varieties are finitely based.
Walter Taylor Fest, Boulder, Colorado, August 2004
Avoidable words.
Victoria Algebra Symposium, Melbourne, Australia, October 2003
Finite axiomatizability for the class of subdirectly irreducible groups generated by a finite group
Jan Mycielski Fest, Boulder, Colorado, August 2002
Equational bounds: determining finite algebras in finitely generated varieties.
Bela Csakany Fest, Szeged, Hungary, July 2002
Which finite algebras are finitely based?
Ralph McKenzie Fest, Nashville, Tennessee, May 2002