Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity

This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity.