A dichotomy in classifying quantifiers for finite models
英文摘要：
We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called interpretability. We show that for every Q_R, ever Q_R is interpretable by quantifying over subsets of u and one to one functions on u both of bounded order, or the logic L(Q_R) (first order logic plus the quantifier Q_R) is undecidable.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
