H. Andréka, I. Németi, and J. Van-benthem, Modal Languages and Bounded Fragments of Predicate Logic, Journal of Philosophical Logic, vol.60, issue.5, pp.217-274, 1998.
DOI : 10.1090/coll/041

V. Bárány, B. Cate, and L. Segoufin, Guarded Negation, J. ACM, vol.62, issue.3, p.22, 2015.

E. Börger, E. Grädel, and Y. Gurevich, The Classical Decision Problem, Perspectives in Mathematical Logic, 1997.
DOI : 10.1007/978-3-642-59207-2

S. A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing , STOC '71, pp.151-158, 1971.
DOI : 10.1145/800157.805047

H. Ebbinghaus, J. Flum, and W. Thomas, Mathematical Logic, 1994.
DOI : 10.1007/978-1-4757-2355-7

E. Grädel, P. G. Kolaitis, and M. Y. Vardi, Abstract, Bulletin of Symbolic Logic, vol.40, issue.01, pp.53-69, 1997.
DOI : 10.1007/BF01449155

N. D. Jones, Y. E. Lien, and W. T. Laaser, New problems complete for nondeterministic log space, Mathematical Systems Theory, vol.4, issue.1, pp.1-17, 1976.
DOI : 10.1016/S0022-0000(70)80006-X

S. Kasif, On the Parallel Complexity of Some Constraint Satisfaction Problems, Artificial Intelligence (AAAI'86), pp.349-353, 1986.

E. Kieronski and A. Kuusisto, Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality, Mathematical Foundations of Computer Science (MFCS'14), pp.365-376, 2014.
DOI : 10.1007/978-3-662-44522-8_31

M. Mortimer, On languages with two variables, Mathematical Logic Quarterly, vol.27, issue.1, pp.135-140, 1975.
DOI : 10.1002/malq.19750210118

D. A. Plaisted, Complete problems in the first-order predicate calculus, Journal of Computer and System Sciences, vol.29, issue.1, pp.8-35, 1984.
DOI : 10.1016/0022-0000(84)90010-2

I. Pratt-hartmann, W. Szwast, and L. Tendera, Quine's Fluted Fragment is Non-Elementary, Computer Science Logic (CSL'16), pp.1-39, 2016.

W. V. Quine, On the Limits of Decision, 14th International Congress of Philosophy, pp.57-62, 1969.

W. V. Quine, The Variable The Ways of Paradox and other essays. Revised and enlarged edition, 1976.

T. Sturm, M. Voigt, and C. Weidenbach, Deciding First-Order Satisfiability when Universal and Existential Variables are Separated, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, pp.86-95, 2016.
DOI : 10.1007/978-3-642-04222-5_23
URL : https://hal.archives-ouvertes.fr/hal-01389744

M. Voigt, A fine-grained hierarchy of hard problems in the separated fragment, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), p.2017
DOI : 10.1109/LICS.2017.8005094
URL : https://hal.archives-ouvertes.fr/hal-01592172