In lattice theory, 'join' and 'meet' are binary operations that represent the least upper bound and greatest lower bound of two elements, respectively. These operations are fundamental in defining the structure of a lattice, which is a partially ordered set where every pair of elements has both a join and a meet.