@inproceedings{c3dee7ee4fe44ea6a38baad49c6f03e7,
title = "On the strictness of the first-order quantifier structure hierarchy over finite structures",
abstract = "One of the major interests of finite model theory is to separate the expressive power of different logics or fragments of logics. In this paper, we define a variant of Ehrenfeucht-Fra{\"i}ss{\'e} games that characterizes quantifier classes over finite structures and prove that the fragments of first-order logic based on quantifier structures form a strict hierarchy in terms of their expressiveness over finite structures.",
keywords = "Ehrenfeucht-Fra{\"i}ss{\'e}, Finite model theory, Games, Quantifier structure",
author = "Yuguo He",
year = "2010",
doi = "10.1109/LICS.2010.43",
language = "English",
isbn = "9780769541143",
series = "Proceedings - Symposium on Logic in Computer Science",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "170--178",
booktitle = "Proceedings - 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010",
address = "United States",
note = "25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010 ; Conference date: 11-07-2010 Through 14-07-2010",
}