A propositional logic is expressively complete if there is a finite set of connectives that define all truth tables. The authors prove that expressive completeness is preserved in a lexicographic product of expressively complete time models. Some nonlinear models over which there is expressive completeness are built.