Counting Finite Semilattices [aka Finite Trees]
by
Stanley Burris
University of Waterloo

The pursuit of logical limit laws, especially 0-1 laws, has led to a desire for more examples of classes of structures whose asymptotic enumeration is known, to keep up with the theoretical developments. Last fall I thought this would be an easy matter, that one simply had to go to the library and thumb through the stacks of books on combinatorics. I was in for a big surprise. Counting the number of finite models is not easy, and in reality very little is known. This talk covers recent investigations concerning monadic second order classes of semilattices (or, if you prefer, trees).

Date received: July 7, 2004

Copyright © 2004 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caoc-16.