{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:19:57Z","timestamp":1726409997471},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_29","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T19:33:58Z","timestamp":1277494438000},"page":"359-371","source":"Crossref","is-referenced-by-count":0,"title":["Pebble Games on Trees"],"prefix":"10.1007","author":[{"given":"\u0141ukasz","family":"Krzeszczakowski","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"292","DOI":"10.2307\/2272133","volume":"42","author":"J. Barwise","year":"1977","unstructured":"Barwise, J.: On Moschovakis closure ordinals. Journal of Symbolic Logic\u00a042, 292\u2013296 (1977)","journal-title":"Journal of Symbolic Logic"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Grohe, M.: Equivalence in finite-variable logics is complete for polynomial time. In: Proceeding FOCS (1996)","DOI":"10.1109\/SFCS.1996.548485"},{"key":"29_CR3","series-title":"Perspectives in Mathematical Logic","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Berlin (1995)"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/10703163_11","volume-title":"Computer Science Logic","author":"E. Pezzoli","year":"1999","unstructured":"Pezzoli, E.: Computational Complexity of Ehrenfeucht-Fra\u00efsse Games on Finite Structures. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol.\u00a01584, pp. 159\u2013170. Springer, Heidelberg (1999)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Pezzoli, E.: On the computational complexity of type-two functionals and logical games on finite structures. Ph.D thesis. Stanford University (June 1998)","DOI":"10.1007\/BFb0028026"},{"key":"29_CR6","unstructured":"Krzeszczakowski, L.: On the complexity of the problem of finding a winning strategy in model-theoretic games (in Polish) M.Sc thesis. Warsaw University (September 2001)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T09:01:52Z","timestamp":1559206912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}