{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:05:37Z","timestamp":1725566737414},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282310"},{"type":"electronic","value":"9783540318972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538363_25","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:35:33Z","timestamp":1127828133000},"page":"355-368","source":"Crossref","is-referenced-by-count":3,"title":["The Complexity of Independence-Friendly Fixpoint Logic"],"prefix":"10.1007","author":[{"given":"Julian","family":"Bradfield","sequence":"first","affiliation":[]},{"given":"Stephan","family":"Kreutzer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Vianu, V.: Fixpoint extensions of first-order logic and Datalog-like languages. In: Proc. 4th IEEE Symp. on Logic in Computer Science (LICS), pp. 71\u201379 (1989)","DOI":"10.1109\/LICS.1989.39160"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1051\/ita:1999122","volume":"33","author":"J.C. Bradfield","year":"1999","unstructured":"Bradfield, J.C.: Fixpoints in arithmetic, transition systems and trees. Theoretical Informatics and Applications\u00a033, 341\u2013356 (1999)","journal-title":"Theoretical Informatics and Applications"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-44622-2_16","volume-title":"Computer Science Logic","author":"J.C. Bradfield","year":"2000","unstructured":"Bradfield, J.C.: Independence: logics and concurrency. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, pp. 247\u2013261. Springer, Heidelberg (2000)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-45220-1_8","volume-title":"Computer Science Logic","author":"J.C. Bradfield","year":"2003","unstructured":"Bradfield, J.C.: Parity of imperfection. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 72\u201385. Springer, Heidelberg (2003)"},{"key":"25_CR5","first-page":"102","volume":"9","author":"J.C. Bradfield","year":"2002","unstructured":"Bradfield, J.C., Fr\u00f6schle, S.B.: Independence-friendly modal logic and true concurrency. Nordic J. Computing\u00a09, 102\u2013117 (2002)","journal-title":"Nordic J. Computing"},{"key":"25_CR6","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":"25_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/malq.19700160802","volume":"16","author":"H.B. Enderton","year":"1970","unstructured":"Enderton, H.B.: Finite partially ordered quantifiers. Z. f\u00fcr Math. Logik u. Grundl. Math.\u00a016, 393\u2013397 (1970)","journal-title":"Z. f\u00fcr Math. Logik u. Grundl. Math."},{"key":"25_CR8","volume-title":"Finite Model Theory and Its Applications","author":"E. Gr\u00e4del","year":"2005","unstructured":"Gr\u00e4del, E.: Finite Model Theory and Descriptive Complexity. In: Finite Model Theory and Its Applications, Springer, Heidelberg (2005), See http:\/\/wwwmgi.informatik.rwth-aachen.de\/Publications\/pub\/graedel\/Gr-FMTbook.ps"},{"issue":"2","key":"25_CR9","first-page":"169","volume":"1","author":"J. Hintikka","year":"1996","unstructured":"Hintikka, J., Sandu, G.: A revolution in logic? Nordic J. Philos. Logic\u00a01(2), 169\u2013183 (1996)","journal-title":"Nordic J. Philos. Logic"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Hodges, W.: Compositional semantics for a language of imperfect information. Int. J. IGPL\u00a05(4), 539\u2013563","DOI":"10.1093\/jigpal\/5.4.539"},{"key":"25_CR11","unstructured":"Pietarinen, A.: Games logic plays. Informational independence in gametheoretic semantics. D.Phil. thesis, Univ Sussex (2000)"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"535","DOI":"10.2307\/2271440","volume":"35","author":"W.J. Walkoe Jr.","year":"1970","unstructured":"Walkoe Jr., W.J.: Finite partially-ordered quantification. J. Symbolic Logic\u00a035, 535\u2013555 (1970)","journal-title":"J. Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11538363_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:39Z","timestamp":1605644019000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538363_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282310","9783540318972"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11538363_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}