@InProceedings{	  KufleitnerWeil12csl,
  author	= "Manfred Kufleitner and Pascal Weil",
  title		= "The $\mathrm{FO}^{2}$ alternation hierarchy is decidable",
  booktitle	= "Computer Science Logic (CSL) 2012 - 26th International
		  Workshop/21st Annual Conference of the EACSL, Conference
		  Proceedings",
  pages		= "426--439",
  series	= "Leibniz International Proceedings in Informatics (LIPIcs)",
  isbn		= "978-3-939897-42-2",
  issn		= "1868-8969",
  year		= "2012",
  volume	= "16",
  editor	= "Patrick C{\'e}gielski and Arnaud Durand",
  publisher	= "Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik",
  address	= "Dagstuhl, Germany",
  url		= "http://drops.dagstuhl.de/opus/volltexte/2012/3688",
  doi		= "10.4230/LIPIcs.CSL.2012.426"
}