{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:35:32Z","timestamp":1725489332758},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442400"},{"type":"electronic","value":"9783540457930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45793-3_23","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T12:03:26Z","timestamp":1187265806000},"page":"337-351","source":"Crossref","is-referenced-by-count":4,"title":["Partial Fixed-Point Logic on Infinite Structures"],"prefix":"10.1007","author":[{"given":"Stephan","family":"Kreutzer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,2]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/0022-0000(91)90032-Z","volume":"43","author":"S. Abiteboul","year":"1991","unstructured":"S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. Journal of Computer and System Sciences, 43:62\u2013124, 1991.","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"S. Abiteboul and V. Vianu. Generic computation and its complexity. In Proc. of the 23rd ACM Symp. on the Theory of Computing, 1991.","DOI":"10.1145\/103418.103444"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1145\/256292.256295","volume":"44","author":"S. Abiteboul","year":"1997","unstructured":"S. Abiteboul, M. Vardi, and V. Vianu. Fixpoint logics, relational machines, and computational complexity. Journal of the ACM, 44(1):30\u201356, 1997. An extended abstract appeared in the Proc. 7th IEEE Symp. on Structure in Complexity Theory, 1992.","journal-title":"Journal of the ACM"},{"key":"23_CR4","unstructured":"A. Dawar. Feasible Computation Through Model Theory. PhD thesis, University of Pennsylvania, 1993."},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"65","DOI":"10.2178\/bsl\/1182353853","volume":"8","author":"A. Dawar","year":"2002","unstructured":"A. Dawar and Y. Gurevich. Fixed-point logics. Bulletin of Symbolic Logic, 8(1):65\u201388, 2002.","journal-title":"Bulletin of Symbolic Logic"},{"key":"23_CR6","unstructured":"A. Dawar and S. Kreutzer. Partial and Alternating Fixed Points in Modal Logic. Unpublished."},{"key":"23_CR7","unstructured":"H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 2nd edition, 1999."},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0168-0072(86)90055-2","volume":"32","author":"Y. Gurevich","year":"1986","unstructured":"Y. Gurevich and S. Shelah. Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic, 32:265\u2013280, 1986.","journal-title":"Annals of Pure and Applied Logic"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","volume":"68","author":"N. Immerman","year":"1986","unstructured":"N. Immerman. Relational queries computable in polynomial time. Information and Control, 68:86\u2013104, 1986. Extended abstract in Proc. 14th ACML Symp. on Theory of Computing, pages 147\u2013152, 1982.","journal-title":"Information and Control"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"S. Kreutzer. Expressive equivalence of least and inflationary fixed-point logic. Proc. of the 17th Symp. on Logic in Computer Science (LICS), 2002.","DOI":"10.1109\/LICS.2002.1029848"},{"key":"23_CR11","unstructured":"Y.N. Moschovakis. Elementary Induction on Abstract Structures. North Holland, 1974. ISBN 0 7204 2280 9."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"M. Vardi. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on the Theory of Computing, pages 137\u2013146, 1982.","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45793-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T04:34:15Z","timestamp":1556771655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45793-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442400","9783540457930"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-45793-3_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}