{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:19:03Z","timestamp":1725596343389},"reference-count":23,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:00:00Z","timestamp":1559347200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1109\/lics.2019.8785892","type":"proceedings-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T01:15:55Z","timestamp":1565054155000},"page":"1-13","source":"Crossref","is-referenced-by-count":0,"title":["MSO+\u2207 is undecidable"],"prefix":"10.1109","author":[{"given":"Mikolaj","family":"Bojanczyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edon","family":"Kelmendi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michal","family":"Skrzypczak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.21"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2629336"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14162-1_44"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211866"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80001-8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(82)91022-1"},{"key":"ref16","article-title":"On boolean closed full trios and rational kripke frames","author":"lohrey","year":"2014","journal-title":"31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27683-0_19"},{"journal-title":"Introduction to probabilistic automata (Computer science and applied mathematics)","year":"1971","author":"paz","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2307\/1995086"},{"key":"ref4","first-page":"121:1","article-title":"Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes","author":"berthon","year":"2017","journal-title":"44th International Colloquium on Automata Languages and Programming (ICALP 2017) volume 80 of Leibniz International Proceedings in Informatics (LIPlcs)"},{"key":"ref3","article-title":"Monadic second-order logic with path-measure quantifier is undecidable","author":"berthon","year":"2019","journal-title":"CoRR"},{"journal-title":"Undecidability of MSO+ultimately periodic (preprint)","year":"0","author":"boja?czyk","key":"ref6"},{"key":"ref5","first-page":"96:1","article-title":"Thin MSO with a Probabilistic Path Quantifier","author":"boja?czyk","year":"2016","journal-title":"43rd International Colloquium on Automata Languages and Programming (ICALP 2016) volume 55 of Leibniz International Proceedings in Informatics (LIPlcs)"},{"key":"ref8","article-title":"Mso+nabla is undecidable","author":"boja'nczyk","year":"2019","journal-title":"CoRR"},{"key":"ref7","first-page":"106:1","article-title":"Emptiness of Zero Automata Is Decidable","author":"boja?czyk","year":"2017","journal-title":"44th International Colloquium on Automata Languages and Programming (ICALP 2017) volume 80 of Leibniz International Proceedings in Informatics (LIPlcs)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050046"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2108242.2108243"},{"key":"ref9","first-page":"21:1","article-title":"The MSO+U Theory of (N,<) Is Undecidable","author":"boja?czyk","year":"2016","journal-title":"33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016) volume 47 of Leibniz International Proceedings in Informatics (LIPlcs)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/11874683_37"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.12"},{"key":"ref21","first-page":"389","article-title":"Languages, automata, and logic","author":"thomas","year":"1996","journal-title":"Handbook of Formal Languages"},{"key":"ref23","first-page":"322","article-title":"An automata-theoretic approach to automatic program verification","author":"vardi","year":"1986","journal-title":"Proceedings of the First Symposium on Logic in Computer Science"}],"event":{"name":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2019,6,24]]},"location":"Vancouver, BC, Canada","end":{"date-parts":[[2019,6,27]]}},"container-title":["2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8765678\/8785654\/08785892.pdf?arnumber=8785892","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:20:37Z","timestamp":1658262037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8785892\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/lics.2019.8785892","relation":{},"subject":[],"published":{"date-parts":[[2019,6]]}}}