{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:25:00Z","timestamp":1725600300743},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229923"},{"type":"electronic","value":"9783642229930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_28","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T08:44:46Z","timestamp":1312879486000},"page":"290-302","source":"Crossref","is-referenced-by-count":1,"title":["Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs"],"prefix":"10.1007","author":[{"given":"Balder","family":"ten Cate","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandro","family":"Facchini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Benedikt, M., Segoufin, L.: Regular Tree Languages Definable in FO and in FO mod . ACM Trans. on Computational Logic\u00a011(1) (2009)","key":"28_CR1","DOI":"10.1145\/1614431.1614435"},{"unstructured":"van Benthem, J.: Modal Correspondence Theory. PhD thesis, Mathematisch Instituut & Instituut voor Grondslagenonderzoek, University of Amsterdam (1976)","key":"28_CR2"},{"key":"28_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P. Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge Univ. Press, Cambridge (2001)"},{"doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M.: Two-Way Unary Temporal Logic over Trees. In: LICS 2007, pp. 121\u2013130 (2007)","key":"28_CR4","DOI":"10.1109\/LICS.2007.51"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-04081-8_10","volume-title":"CONCUR 2009 - Concurrency Theory","author":"M. Boja\u0144czyk","year":"2009","unstructured":"Boja\u0144czyk, M., Idziaszek, T.: Algebra for Infinite Forests with an Application to the Temporal Logic EF. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 131\u2013145. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Boja\u0144czyk, M., Segoufin, L., Straubing, H.: Piecewise Testable Tree Languages. In: LICS 2008, pp. 442\u2013451 (2008)","key":"28_CR6","DOI":"10.1109\/LICS.2008.46"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-70583-3_20","volume-title":"Automata, Languages and Programming","author":"M. Boja\u0144czyk","year":"2008","unstructured":"Boja\u0144czyk, M., Segoufin, L.: Tree languages defined in first-order logic with one quantifier alternation. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 233\u2013245. Springer, Heidelberg (2008)"},{"issue":"2-3","key":"28_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.tcs.2006.01.018","volume":"358","author":"M. Boja\u0144czyk","year":"2006","unstructured":"Boja\u0144czyk, M., Walukiewicz, I.: Characterizing EF and EX Tree Logics. Theoretical Computer Science\u00a0358(2-3), 255\u2013272 (2006)","journal-title":"Theoretical Computer Science"},{"key":"28_CR9","first-page":"107","volume-title":"Automata and Logic: History and Perspectives","author":"M. Boja\u0144czyk","year":"2007","unstructured":"Boja\u0144czyk, M., Walukiewicz, I.: Forest Algebras. In: Automata and Logic: History and Perspectives, pp. 107\u2013132. Amsterdam University Press, Amsterdam (2007)"},{"key":"28_CR10","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/B978-044482830-9\/50022-9","volume-title":"Handbook of Process Algebra","author":"J. Bradfield","year":"2001","unstructured":"Bradfield, J., Stirling, C.: Modal Logic and Mu-Calculi. In: Bergstra, J., et al. (eds.) Handbook of Process Algebra, pp. 293\u2013332. Elsevier, North-Holland (2001)"},{"issue":"1","key":"28_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.apal.2009.04.002","volume":"161","author":"A. Dawar","year":"2009","unstructured":"Dawar, A., Otto, M.: Modal Characterisation Theorems over Special Classes of Frames. Ann. Pure Appl. Logic\u00a0161(1), 1\u201342 (2009)","journal-title":"Ann. Pure Appl. Logic"},{"key":"28_CR12","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 \u201996: Concurrency Theory","author":"D. Janin","year":"1996","unstructured":"Janin, D., Walukiewicz, I.: On the Expressive Completeness of the Propositional \u03bc-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)"},{"doi-asserted-by":"crossref","unstructured":"Murlak, F.: Weak Index vs Borel Rank. In: STACS 2008, pp. 573\u2013584 (2008)","key":"28_CR13","DOI":"10.1016\/B978-008047172-3.50020-9"},{"key":"28_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 \u03bc-calculus. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 531\u2013540. Springer, Heidelberg (1999)"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-540-87531-4_29","volume-title":"Computer Science Logic","author":"T. Place","year":"2008","unstructured":"Place, T.: Characterization of logics over ranked tree languages. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 401\u2013415. Springer, Heidelberg (2008)"},{"issue":"1-2","key":"28_CR16","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. Theoretical Computer Science\u00a0275(1-2), 311\u2013346 (2002)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T18:54:41Z","timestamp":1560452081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}