In this article, we generalize Courcelle's recognizable graph languages and results on monadic second-order logic to more general structures.First, we give a category-theoretical characterization of recognizability. A recognizable subset of arrows in a category is defined via a functor into the category of relations on finite sets. This can be seen as a straightforward generalization of finite automata. We show that our notion corresponds to recognizable graph languages if we apply the theory to the category of cospans of graphs.In the second part of the paper, we introduce a simple logic that allows to quantify over the subobjects of a categorical object. Again, we show that, for the category of graphs, this logic is equally expressive as monadic second-order graph logic (msogl). Furthermore, we show that in the more general setting of hereditary pushout categories, a class of categories closely related to adhesive categories, we can recover Courcelle's result that everymsogl-expressible property is recognizable. This is done by giving an inductive translation of formulas of our logic into automaton functors.
A regular characterization of graph languages definable in monadic second-order logic