@InProceedings{bojanczyk_et_al:LIPIcs.STACS.2016.21,
author = {Bojanczyk, Mikolaj and Parys, Pawel and Torunczyk, Szymon},
title = {{The MSO+U Theory of (N,\langle) Is Undecidable}},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)},
pages = {21:1--21:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-001-9},
ISSN = {1868-8969},
year = {2016},
volume = {47},
editor = {Ollinger, Nicolas and Vollmer, Heribert},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.21},
URN = {urn:nbn:de:0030-drops-57223},
doi = {10.4230/LIPIcs.STACS.2016.21},
annote = {Keywords: automata, logic, unbounding quantifier, bounds, undecidability}
}