Traditional automata accept or reject their input, and are therefore Boolean. Lattice automata generalize the traditional setting and map words to values taken from a lattice. In particular, in a fully-ordered lattice, the elements are 0, 1, . . . , n − 1, ordered by the standard ≤ order. Lattice automata, and in particular lattice automata defined with respect to fully-ordered lattices, have i...

This document contains a rough summary of the main theorems discussed during the mini-course on Baker-Beynon Duality for unital latticeordered Abelian groups and MV-algebras held at Bowling Green State University from 8.VI.2009 through 12.VI.2009, with references to the original sources. Bibliographic Note. The standard reference on MV-algebras is [10]. It develops all of the basic theory in ca...