{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T08:20:30Z","timestamp":1775809230899,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540613770","type":"print"},{"value":"9783540685074","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61377-3_37","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:35:28Z","timestamp":1330292128000},"page":"161-177","source":"Crossref","is-referenced-by-count":9,"title":["First order logic, fixed point logic and linear order"],"prefix":"10.1007","author":[{"given":"Anuj","family":"Dawar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Lindell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott","family":"Weinstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","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"},{"issue":"2","key":"10_CR2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1006\/jcss.1995.1025","volume":"50","author":"S. Abiteboul","year":"1995","unstructured":"S. Abiteboul and V. Vianu. Computing with first-order logic. Journal of Computer and System Sciences, 50(2):309\u2013335, 1995.","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"D.M. Barrington","year":"1990","unstructured":"D.M. Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. Journal of Computer and System Sciences, 41:274\u2013306, 1990.","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR4","unstructured":"A. Dawar. Feasible Computation through Model Theory. PhD thesis, University of Pennsylvania, 1993."},{"issue":"2","key":"10_CR5","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1006\/inco.1995.1166","volume":"123","author":"A. Dawar","year":"1995","unstructured":"A. Dawar and L. Hella. The expressive power of finitely many generalized quantifiers. Information and Computation, 123(2):172\u2013184, 1995.","journal-title":"Information and Computation"},{"issue":"2","key":"10_CR6","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1006\/inco.1995.1084","volume":"119","author":"A. Dawar","year":"1995","unstructured":"A. Dawar, S. Lindell, and S. Weinstein. Infinitary logic and inductive definability over finite structures. Information and Computation, 119(2):160\u2013175, 1995.","journal-title":"Information and Computation"},{"key":"10_CR7","unstructured":"Y. Gurevich, N. Immerman, and S. Shelah. McColm's conjecture. In Proc. 9th IEEE Symp. on Logic in Computer Science, 1994."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Y. Gurevich. Toward logic tailored for computational complexity. In M. Richter et al., editors, Computation and Proof Theory, pages 175\u2013216. Springer Lecture Notes in Mathematics, 1984.","DOI":"10.1007\/BFb0099486"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0890-5401(89)90055-2","volume":"83","author":"N. Immerman","year":"1989","unstructured":"N. Immerman and D. Kozen. Definability with bounded number of bound variables. Information and Computation, 83:121\u2013139, 1989.","journal-title":"Information and Computation"},{"key":"10_CR10","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0022-0000(82)90011-3","volume":"25","author":"N. Immerman","year":"1982","unstructured":"N. Immerman. Upper and lower bounds for first-order expressibility. Journal of Computer and System Sciences, 25:76\u201398, 1982.","journal-title":"Journal of Computer and System Sciences"},{"key":"10_CR11","doi-asserted-by":"crossref","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.","journal-title":"Information and Control"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Ph. G. Kolaitis and M. Y. Vardi. Fixpoint logic vs. infinitary logic in finite-model theory. In Proc. 7th IEEE Symp. on Logic in Computer Science, pages 46\u201357, 1992.","DOI":"10.1109\/LICS.1992.185518"},{"issue":"2","key":"10_CR13","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0890-5401(92)90021-7","volume":"98","author":"P. G. Kolaitis","year":"1992","unstructured":"Ph. G. Kolaitis and M. Y. Vardi. Infinitary logics and 0\u20131 laws. Information and Computation, 98(2):258\u2013294, 1992.","journal-title":"Information and Computation"},{"key":"10_CR14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0168-0072(90)90053-5","volume":"50","author":"G. L. McColm","year":"1990","unstructured":"G. L. McColm. When is arithmetic possible? Annals of Pure and Applied Logic, 50:29\u201351, 1990.","journal-title":"Annals of Pure and Applied Logic"},{"key":"10_CR15","unstructured":"Y. N. Moschovakis. Elementary Induction on Abstract Structures. North Holland, 1974."},{"issue":"3","key":"10_CR16","doi-asserted-by":"crossref","first-page":"641","DOI":"10.2307\/2273594","volume":"47","author":"B. Poizat","year":"1982","unstructured":"B. Poizat. Deux ou trois choses que je sais de L n. Journal of Symbolic Logic, 47(3):641\u2013658, 1982.","journal-title":"Journal of Symbolic Logic"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"A. Stolbouskin and M. Taitslin. Is first order contained in an initial segment of PTIME? In Computer Science Logic 94, volume 933 of LNCS. Springer-Verlag, 1995.","DOI":"10.1007\/BFb0022260"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"M. Y. 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"},{"issue":"2","key":"10_CR19","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/0207018","volume":"7","author":"C. Wrathall","year":"1979","unstructured":"C. Wrathall. Rudimentary predicates and relative computation. SIAM Journal on Computing, 7(2):194\u2013209, 1979.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61377-3_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:05:49Z","timestamp":1605647149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61377-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613770","9783540685074"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-61377-3_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}