Slides from talks by George F. McNulty

  1. How undecidable is the elementary theory of the lattice of equational theories?

    JardaFest, Prague, The Czech Republic, June 2010

  2. A dozen easy problems.

    American Mathematical Society Special Session, St. Paul, Minnesota, April 2010

  3. Automatic algebras, finitely based or not.

    Conference on Algorithmic Complexity and Universal Algebra, Szeged, Hungary, July 2007

  4. Algorithmic problems for equations and algebras.

    International Conference on Order, Algebra, and Logics, Nashville, Tennesee, June 2007

  5. The equational compatibility problem for the real line.

    American Mathematical Society Special Session, New Orleans, Louisiana, January 2007

  6. The equational complexity of Visin's algebra

    American Mathematical Society Special Session, Lincoln, Nebraska, August 2005

  7. Some varieties are finitely based.

    Walter Taylor Fest, Boulder, Colorado, August 2004

  8. Avoidable words.

    Victoria Algebra Symposium, Melbourne, Australia, October 2003

  9. Finite axiomatizability for the class of subdirectly irreducible groups generated by a finite group

    Jan Mycielski Fest, Boulder, Colorado, August 2002

  10. Equational bounds: determining finite algebras in finitely generated varieties.

    Bela Csakany Fest, Szeged, Hungary, July 2002

  11. Which finite algebras are finitely based?

    Ralph McKenzie Fest, Nashville, Tennessee, May 2002