{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:55:59Z","timestamp":1760079359728,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,9]],"date-time":"2008-06-09T00:00:00Z","timestamp":1212969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,6,9]]},"DOI":"10.1145\/1376916.1376925","type":"proceedings-article","created":{"date-parts":[[2008,6,10]],"date-time":"2008-06-10T14:13:22Z","timestamp":1213107202000},"page":"53-66","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Effective characterizations of tree logics"],"prefix":"10.1145","author":[{"given":"Mikolaj","family":"Bojan\u0144zyk","sequence":"first","affiliation":[{"name":"Warsaw University, Warsaw, Poland"}]}],"member":"320","published-online":{"date-parts":[[2008,6,9]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.51"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_27"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2392389.2392407"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2007.51"},{"key":"e_1_3_2_2_5_1","unstructured":"Mikolaj Boja\u0144czyk and Luc Segoufin. Tree languages definable with one quantifier alternation. Submitted.  Mikolaj Boja\u0144czyk and Luc Segoufin. Tree languages definable with one quantifier alternation. Submitted."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2008.46"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.01.018"},{"key":"e_1_3_2_2_8_1","first-page":"107","volume-title":"Automata and Logic: History and Perspectives","author":"Boja\u0144czyk Mikolaj","year":"2007","unstructured":"Mikolaj Boja\u0144czyk and Igor Walukiewicz . Forest algebras . In Automata and Logic: History and Perspectives , pages 107 -- 132 . Amsterdam University Press , 2007 . Mikolaj Boja\u0144czyk and Igor Walukiewicz. Forest algebras. In Automata and Logic: History and Perspectives, pages 107 -- 132. Amsterdam University Press, 2007."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19600060105"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00083-6"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1961-0139530-9"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1366774.1366780"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0049-237X(08)71879-2"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/645683.664569"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/29601.29623"},{"key":"e_1_3_2_2_17_1","volume-title":"Logics for unranked trees: An overview. Logical Methods in Computer Science, 2(3)","author":"Libkin Leonid","year":"2006","unstructured":"Leonid Libkin . Logics for unranked trees: An overview. Logical Methods in Computer Science, 2(3) , 2006 . Leonid Libkin. Logics for unranked trees: An overview. Logical Methods in Computer Science, 2(3), 2006."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1114244.1114247"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1097043"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02127803"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/377786.377825"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/646619.697546"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/647896.740626"},{"issue":"3","key":"e_1_3_2_2_24_1","first-page":"279","article-title":"A formal reduction of the general problem of expressibility of formulas in the G\u00f6del-L\u00f6b provability logic","volume":"12","author":"Rata Mefodie","year":"2002","unstructured":"Mefodie Rata . A formal reduction of the general problem of expressibility of formulas in the G\u00f6del-L\u00f6b provability logic . Discrete Mathematics and Applications , 12 ( 3 ): 279 -- 290 , 2002 . Mefodie Rata. A formal reduction of the general problem of expressibility of formulas in the G\u00f6del-L\u00f6b provability logic. Discrete Mathematics and Applications, 12(3):279--290, 2002.","journal-title":"Discrete Mathematics and Applications"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(65)90108-7"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/646589.697341"},{"key":"e_1_3_2_2_27_1","first-page":"475","volume-title":"Automata and Languages","author":"Tesson P.","year":"2002","unstructured":"P. Tesson and D. Th\u00b4erien . Diamonds are forever: the variety DA. In Semigroups, Algorithms , Automata and Languages , pages 475 -- 500 , 2002 . P. Tesson and D. Th\u00b4erien. Diamonds are forever: the variety DA. In Semigroups, Algorithms, Automata and Languages, pages 475--500, 2002."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90016-2"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/2868.2871"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/267871.267878"},{"key":"e_1_3_2_2_31_1","first-page":"326","article-title":"Finite automata and the logic of monadic second order predicates(russian)","volume":"140","author":"Trakthenbrot B. A.","year":"1961","unstructured":"B. A. Trakthenbrot . Finite automata and the logic of monadic second order predicates(russian) . Doklady Academii Nauk SSSR , 140 : 326 -- 329 , 1961 . B. A. Trakthenbrot. Finite automata and the logic of monadic second order predicates(russian). Doklady Academii Nauk SSSR, 140:326--329, 1961.","journal-title":"Doklady Academii Nauk SSSR"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00131-X"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1764891.1764895"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.11.012"}],"event":{"name":"SIGMOD\/PODS '08: SIGMOD\/PODS '08 - International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","ACM Association for Computing Machinery"],"location":"Vancouver Canada","acronym":"SIGMOD\/PODS '08"},"container-title":["Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376916.1376925","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1376916.1376925","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:55Z","timestamp":1750255075000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1376916.1376925"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,9]]},"references-count":33,"alternative-id":["10.1145\/1376916.1376925","10.1145\/1376916"],"URL":"https:\/\/doi.org\/10.1145\/1376916.1376925","relation":{},"subject":[],"published":{"date-parts":[[2008,6,9]]},"assertion":[{"value":"2008-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}