Abstract
We show that for an arbitrary logic being locally tabular is a strictly weaker property than being locally finite. We describe our hunt for a logic that allows us to separate the two properties, revealing weaker and weaker conditions under which they must coincide, and showing how they are intertwined. We single out several classes of logics where the two notions coincide, including logics that are determined by a finite set of finite matrices, selfextensional logics, algebraizable and equivalential logics. Furthermore, we identify a closure property on models of a logic that, in the presence of local tabularity, is equivalent to local finiteness.