@InProceedings{broadbent:LIPIcs.STACS.2012.589,
  author =	{Broadbent, Christopher H.},
  title =	{{The Limits of Decidability for First Order Logic on CPDA Graphs}},
  booktitle =	{29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
  pages =	{589--600},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-35-4},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{14},
  editor =	{D\"{u}rr, Christoph and Wilke, Thomas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.589},
  URN =		{urn:nbn:de:0030-drops-34334},
  doi =		{10.4230/LIPIcs.STACS.2012.589},
  annote =	{Keywords: Collapsible Pushdown Automata, First Order Logic, Logical Reflection}
}