{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T14:26:46Z","timestamp":1762352806354,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662595329"},{"type":"electronic","value":"9783662595336"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-662-59533-6_30","type":"book-chapter","created":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T19:02:35Z","timestamp":1561230155000},"page":"498-515","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Closure Ordinals of the Two-Way Modal $$\\mu $$-Calculus"],"prefix":"10.1007","author":[{"given":"Gian Carlo","family":"Milanese","sequence":"first","affiliation":[]},{"given":"Yde","family":"Venema","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,9]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","unstructured":"Afshari, B., Leigh, G.E.: On closure ordinals for the modal $$\\mu $$-calculus. In: Computer Science Logic 2013 (CSL 2013). Leibniz International Proceedings in Informatics (LIPIcs), vol. 23, pp. 30\u201344. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2013). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.CSL.2013.30\n\n. \nhttp:\/\/drops.dagstuhl.de\/opus\/volltexte\/2013\/4188","DOI":"10.4230\/LIPIcs.CSL.2013.30"},{"key":"30_CR2","doi-asserted-by":"publisher","unstructured":"Afshari, B., Leigh, G.: Cut-free completeness for modal $$\\mu $$-calculus. In: Proceedings of the 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2017), pp. 1\u201312 (2017). \nhttps:\/\/doi.org\/10.1109\/LICS.2017.8005088","DOI":"10.1109\/LICS.2017.8005088"},{"key":"30_CR3","doi-asserted-by":"publisher","unstructured":"Calude, C., Jain, S., Khoussainov, B., Li, W., Stephan, F.: Deciding parity games in quasipolynomial time. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, pp. 252\u2013263 (2017). \nhttps:\/\/doi.org\/10.1145\/3055399.3055409","DOI":"10.1145\/3055399.3055409"},{"key":"30_CR4","unstructured":"Czarnecki, M.: How fast can the fixpoints in modal $$\\mu $$-calculus be reached? In: Fixed Points in Computer Science 2010 (FICS 2010), pp. 35\u201339, August 2010. \nhttps:\/\/hal.archives-ouvertes.fr\/hal-00512377\/document#page=36"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"310","DOI":"10.2307\/2586539","volume":"65","author":"G D\u2019Agostino","year":"2000","unstructured":"D\u2019Agostino, G., Hollenberg, M.: Logical questions concerning the $$\\mu $$-calculus. J. Symb. Log. 65, 310\u2013332 (2000)","journal-title":"J. Symb. Log."},{"key":"30_CR6","doi-asserted-by":"publisher","unstructured":"Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs (extended abstract). In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pp. 328\u2013337. IEEE Computer Society Press (1988). \nhttps:\/\/doi.org\/10.1109\/SFCS.1988.21949","DOI":"10.1109\/SFCS.1988.21949"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-87531-4_12","volume-title":"Computer Science Logic","author":"G Fontaine","year":"2008","unstructured":"Fontaine, G.: Continuous fragment of the $$\\mu $$-calculus. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol. 5213, pp. 139\u2013153. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-87531-4_12"},{"key":"30_CR8","unstructured":"Fontaine, G., Venema, Y.: Some model theory for the modal $$\\mu $$-calculus: syntactic characterisations of semantic properties. Log. Methods Comput. Sci. 14(1) (2018)"},{"key":"30_CR9","doi-asserted-by":"publisher","unstructured":"Gouveia, M.J., Santocanale, L.: $$\\aleph _1$$ and the modal $$\\mu $$-calculus. In: 26th EACSL Annual Conference on Computer Science Logic (CSL 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 82, pp. 38:1\u201338:16. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017). \nhttps:\/\/doi.org\/10.4230\/LIPIcs.CSL.2017.38\n\n. \nhttp:\/\/drops.dagstuhl.de\/opus\/volltexte\/2017\/7692\n\n. An updated version can be found at \nhttps:\/\/arxiv.org\/abs\/1704.03772v2","DOI":"10.4230\/LIPIcs.CSL.2017.38"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/3-540-61604-7_60","volume-title":"CONCUR 1996: Concurrency Theory","author":"D Janin","year":"1996","unstructured":"Janin, D., Walukiewicz, I.: On the expressive completeness of the propositional $$\\mu $$-calculus with respect to monadic second order logic. In: Montanari, U., Sassone, V. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 263\u2013277. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-61604-7_60"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional $$\\mu $$-calculus. Theor. Comput. Sci. 27, 333\u2013354 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/BF00370554","volume":"47","author":"D Kozen","year":"1988","unstructured":"Kozen, D.: A finite model theorem for the propositional $$\\mu $$-calculus. Stud. Log. 47, 233\u2013241 (1988)","journal-title":"Stud. Log."},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Milanese, G.: An exploration of closure ordinals in the modal $$\\mu $$-calculus. Master\u2019s thesis, Institute for Logic, Language and Computation, University of Amsterdam (2018)","DOI":"10.1007\/978-3-662-59533-6_30"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/3-540-49116-3_50","volume-title":"STACS 99","author":"M Otto","year":"1999","unstructured":"Otto, M.: Eliminating recursion in the $$\\upmu $$-calculus. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 531\u2013540. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-49116-3_50"},{"key":"30_CR15","unstructured":"Walukiewicz, I.: Completeness of Kozen\u2019s axiomatisation of the propositional $$\\mu $$-calculus. Inf. Comput. 157(1), 142\u2013182 (2000). \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540199928365"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59533-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T15:06:00Z","timestamp":1575644760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59533-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662595329","9783662595336"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59533-6_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WoLLIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Language, Information, and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Utrecht","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wollic2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wollic2019.sites.uu.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}