Dichotomies and Duality in First-order Model Checking Problems


We study the complexity of the model checking problem, for fixed model A, over certain fragments L of first-order logic. These are sometimes known as the expression complexities of L. We obtain various complexity classification theorems for these logics L as each ranges over models A, in the spirit of the dichotomy conjecture for the Constraint Satisfaction… (More)


Cite this paper

@article{Martin2006DichotomiesAD, title={Dichotomies and Duality in First-order Model Checking Problems}, author={Barnaby Martin}, journal={CoRR}, year={2006}, volume={abs/cs/0609022} }