The Computational Complexity of Hereditary First-Order Model Checking

Hereditary First-Order logic (HerFO), while powerful enough to express many constraint satisfaction problems (CSPs), including some that are coNP-complete, is not NP-rich unless E=NE. The complexity of model checking for HerFO can be precisely classified based on the quantifier prefix of the first-order formula used.