{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:33:41Z","timestamp":1742992421781,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030794156"},{"type":"electronic","value":"9783030794163"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-79416-3_24","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"395-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Shelah-Stupp\u2019s and Muchnik\u2019s Iterations Revisited"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7247-1408","authenticated-orcid":false,"given":"Pawe\u0142","family":"Parys","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12(2), 308\u2013340 (1991). https:\/\/doi.org\/10.1016\/0196-6774(91)90006-K","journal-title":"J. Algorithms"},{"key":"24_CR2","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Proceedings of the 1960 International Congress on Logic, Methodology and Philosophy of Science, pp. 1\u201311. Stanford University Press (1962)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-24597-1_10","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"A Carayol","year":"2003","unstructured":"Carayol, A., W\u00f6hrle, S.: The caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 112\u2013123. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24597-1_10"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-45687-2_13","volume-title":"Mathematical Foundations of Computer Science 2002","author":"D Caucal","year":"2002","unstructured":"Caucal, D.: On infinite terms having a decidable monadic theory. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 165\u2013176. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45687-2_13"},{"issue":"1","key":"24_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0304-3975(01)00089-5","volume":"290","author":"D Caucal","year":"2003","unstructured":"Caucal, D.: On infinite transition graphs having a decidable monadic theory. Theor. Comput. Sci. 290(1), 79\u2013115 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(01)00089-5","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"24_CR6","doi-asserted-by":"publisher","first-page":"327","DOI":"10.3233\/FI-2018-1667","volume":"159","author":"D Caucal","year":"2018","unstructured":"Caucal, D., Knapik, T.: Shelah-Stupp\u2019s iteration and Muchnik\u2019s iteration. Fundam. Informaticae 159(4), 327\u2013359 (2018). https:\/\/doi.org\/10.3233\/FI-2018-1667","journal-title":"Fundam. Informaticae"},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02088013","volume":"21","author":"B Courcelle","year":"1989","unstructured":"Courcelle, B.: The monadic second-order logic of graphs, II: infinite graphs of bounded width. Math. Syst. Theory 21(4), 187\u2013221 (1989). https:\/\/doi.org\/10.1007\/BF02088013","journal-title":"Math. Syst. Theory"},{"issue":"2","key":"24_CR8","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0304-3975(91)90387-H","volume":"80","author":"B Courcelle","year":"1991","unstructured":"Courcelle, B.: The monadic second-order logic of graphs V: on closing the gap between definability and recognizability. Theor. Comput. Sci. 80(2), 153\u2013202 (1991). https:\/\/doi.org\/10.1016\/0304-3975(91)90387-H","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(92)90148-9","volume":"101","author":"B Courcelle","year":"1992","unstructured":"Courcelle, B.: The monadic second-order logic of graphs VII: graphs as relational structures. Theor. Comput. Sci. 101(1), 3\u201333 (1992). https:\/\/doi.org\/10.1016\/0304-3975(92)90148-9","journal-title":"Theor. Comput. Sci."},{"key":"24_CR10","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic - A Language-Theoretic Approach, Encyclopedia of Mathematics and its Applications, vol. 138. Cambridge University Press (2012). http:\/\/www.cambridge.org\/knowledge\/isbn\/item5758776\/"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0168-0072(97)00048-1","volume":"92","author":"B Courcelle","year":"1998","unstructured":"Courcelle, B., Walukiewicz, I.: Monadic second-order logic, graph coverings and unfoldings of transition systems. Ann. Pure Appl. Log. 92(1), 35\u201362 (1998). https:\/\/doi.org\/10.1016\/S0168-0072(97)00048-1","journal-title":"Ann. Pure Appl. Log."},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.2307\/1993511","volume":"98","author":"CC Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Am. Math. Soc. 98(1), 21\u201351 (1961). https:\/\/doi.org\/10.2307\/1993511","journal-title":"Trans. Am. Math. Soc."},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"169","DOI":"10.2307\/2269808","volume":"31","author":"CC Elgot","year":"1966","unstructured":"Elgot, C.C., Rabin, M.O.: Decidability and undecidability of extensions of second (first) order theory of (generalized) successor. J. Symb. Log. 31(2), 169\u2013181 (1966). https:\/\/doi.org\/10.2307\/2269808","journal-title":"J. Symb. Log."},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BFb0017397","volume-title":"Graph Grammars and Their Application to Computer Science","author":"J Engelfriet","year":"1991","unstructured":"Engelfriet, J.: A characterization of context-free NCE graph languages by monadic second-order logic on trees. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532, pp. 311\u2013327. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/BFb0017397"},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-45931-6_15","volume-title":"Foundations of Software Science and Computation Structures","author":"T Knapik","year":"2002","unstructured":"Knapik, T., Niwi\u0144ski, D., Urzyczyn, P.: Higher-order pushdown trees are easy. In: Nielsen, M., Engberg, U. (eds.) FoSSaCS 2002. LNCS, vol. 2303, pp. 205\u2013222. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45931-6_15"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0304-3975(85)90087-8","volume":"37","author":"DE Muller","year":"1985","unstructured":"Muller, D.E., Schupp, P.E.: The theory of ends, pushdown automata, and second-order logic. Theor. Comput. Sci. 37, 51\u201375 (1985). https:\/\/doi.org\/10.1016\/0304-3975(85)90087-8","journal-title":"Theor. Comput. Sci."},{"key":"24_CR17","doi-asserted-by":"publisher","unstructured":"Ong, C.L.: On model-checking trees generated by higher-order recursion schemes. In: Proceedings of 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 12\u201315 August 2006, Seattle, WA, USA, pp. 81\u201390. IEEE Computer Society (2006). https:\/\/doi.org\/10.1109\/LICS.2006.38","DOI":"10.1109\/LICS.2006.38"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0002-9947-1969-0246760-1","volume":"141","author":"MO Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Am. Math. Soc. 141, 1\u201335 (1969). https:\/\/doi.org\/10.1090\/S0002-9947-1969-0246760-1","journal-title":"Trans. Am. Math. Soc."},{"key":"24_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/BFb0030296","volume-title":"Mathematical Foundations of Computer Science 1984","author":"AL Semenov","year":"1984","unstructured":"Semenov, A.L.: Decidability of monadic theories. In: Chytil, M.P., Koubek, V. (eds.) MFCS 1984. LNCS, vol. 176, pp. 162\u2013175. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/BFb0030296"},{"issue":"3","key":"24_CR20","doi-asserted-by":"publisher","first-page":"379","DOI":"10.2307\/1971037","volume":"102","author":"S Shelah","year":"1975","unstructured":"Shelah, S.: The monadic theory of order. Ann. Math. 102(3), 379\u2013419 (1975). https:\/\/doi.org\/10.2307\/1971037","journal-title":"Ann. Math."},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Siefkes, D.: Decidable extensions of monadic second order successor arithmetic. In: Automatentheorie und Formale Sprachen, Tagung, Math. Forschungsinst, Oberwolfach, 1969, pp. 441\u2013472. Bibliograph. Inst., Mannheim (1970)","DOI":"10.1007\/978-3-662-36678-3"},{"key":"24_CR22","volume-title":"The lattice-model is recursive in the original model","author":"J Stupp","year":"1975","unstructured":"Stupp, J.: The lattice-model is recursive in the original model. The Hebrew University, Jerusalem, Institute of Mathematics (1975)"},{"key":"24_CR23","unstructured":"Thomas, W.: Das Entscheidungsproblem f\u00fcr einige Erweiterungen der Nachfolger-Arithmetik. Ph.D. thesis, Universit\u00e4t Freiburg (1975)"},{"key":"24_CR24","first-page":"326","volume":"140","author":"B Trakhtenbrot","year":"1961","unstructured":"Trakhtenbrot, B.: Finite automata and the logic of monadic predicates. Doklady Akademii Nauk SSSR 140, 326\u2013329 (1961)","journal-title":"Doklady Akademii Nauk SSSR"},{"issue":"1\u20132","key":"24_CR25","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/S0304-3975(01)00185-2","volume":"275","author":"I Walukiewicz","year":"2002","unstructured":"Walukiewicz, I.: Monadic second-order logic on tree-like structures. Theor. Comput. Sci. 275(1\u20132), 311\u2013346 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(01)00185-2","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79416-3_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:24:46Z","timestamp":1623972286000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sochi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","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":"68","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":"28","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":"0","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":"41% - 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":"3.1","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":"9.2","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)"}}]}}