{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:49Z","timestamp":1759637929926},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240587"},{"type":"electronic","value":"9783540305385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30538-5_19","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:40:30Z","timestamp":1268401230000},"page":"224-236","source":"Crossref","is-referenced-by-count":1,"title":["On the Bisimulation Invariant Fragment of Monadic \u03a31 in the Finite"],"prefix":"10.1007","author":[{"given":"Anuj","family":"Dawar","sequence":"first","affiliation":[]},{"given":"David","family":"Janin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.2307\/2274958","volume":"55","author":"M. Ajtai","year":"1990","unstructured":"Ajtai, M., Fagin, R.: Reachability is harder for directed rather than undirected finite graphs. Journal of Symbolic Logic\u00a055, 113\u2013150 (1990)","journal-title":"Journal of Symbolic Logic"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(97)00217-X","volume":"195","author":"J. Bradfield","year":"1998","unstructured":"Bradfield, J.: The modal mu-calculus alternation hierarchy is strict. Theoretical Computer Science\u00a0195, 133\u2013153 (1998)","journal-title":"Theoretical Computer Science"},{"key":"19_CR3","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)","edition":"2"},{"key":"19_CR4","first-page":"185","volume":"21","author":"D. Janin","year":"2002","unstructured":"Janin, D., Lenzi, G.: On the logical definability of topologically closed recognizable languages of infinite trees. Computing and Informatics\u00a021, 185\u2013203 (2002)","journal-title":"Computing and Informatics"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 modal mu-calculus with respect to monadic second order logic. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119, pp. 263\u2013277. Springer, Heidelberg (1996)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1007\/3-540-60246-1_159","volume-title":"Mathematical Foundations of Computer Science 1995","author":"J.A. Makowski","year":"1995","unstructured":"Makowski, J.A., Ravve, E.: Incremental model checking for decomposable strutures. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 540\u2013551. Springer, Heidelberg (1995)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Otto, M.: Modal and guarded characterisation theorems over finite transition systems. In: Proc.\u00a0of the 17th IEEE Symp.\u00a0on Logic in Computer Science (LICS), pp. 371\u2013380 (2002)","DOI":"10.1109\/LICS.2002.1029844"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1023\/A:1008275906015","volume":"6","author":"E. Rosen","year":"1997","unstructured":"Rosen, E.: Modal logic over finite structures. Journal of Logic, Language and Information\u00a06, 427\u2013439 (1997)","journal-title":"Journal of Logic, Language and Information"},{"key":"19_CR9","first-page":"109","volume":"3","author":"T. Schwentick","year":"1999","unstructured":"Schwentick, T., Barthelmann, K.: Local normal forms for first-order logic with applications to games and automata. Discrete Mathematics and Theoretical Computer Science\u00a03, 109\u2013124 (1999)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/BFb0030586","volume-title":"TAPSOFT 1997: Theory and Practice of Software Development","author":"W. Thomas","year":"1997","unstructured":"Thomas, W.: Automata theory on trees and partial orders. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol.\u00a01214, pp. 20\u201338. Springer, Heidelberg (1997)"},{"key":"19_CR11","unstructured":"van Benthem, J.: Modal Logic and Classical Logic. Bibliopolis (1983)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Symp. on Theoretical Aspects of Computer Science","author":"I. Walukiewicz","year":"1996","unstructured":"Walukiewicz, I.: Monadic second order logic on tree-like structures. In: STACS 1996. LNCS, vol.\u00a01046. Springer, Heidelberg (1996); Full version in Information and Computation 164, 234\u2013263 (2001)"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30538-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:58:46Z","timestamp":1605761926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30538-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240587","9783540305385"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30538-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}