{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:40:25Z","timestamp":1725496825916},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665366"},{"type":"electronic","value":"9783540481683"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48168-0_27","type":"book-chapter","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T11:30:26Z","timestamp":1196508626000},"page":"374-388","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Program Schemes, Arrays, Lindstr\u00f6m Quantifiers and Zero-One Laws"],"prefix":"10.1007","author":[{"given":"Iain A.","family":"Stewart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,5,13]]},"reference":[{"key":"27_CR1","unstructured":"Abiteboul, S., Vianu, V.: Generic computation and its complexity, Proc. 23rd Ann. ACM Symp. on Theory of Computing, ACM Press (1991) 209\u2013219."},{"key":"27_CR2","unstructured":"Arratia-Quesada, A.A., Chauhan, S.R., Stewart, I.A.: Hierarchies in classes of program schemes, J. Logic Computat. (to appear)."},{"key":"27_CR3","unstructured":"Brown, S., Gries, D., Szymanski, T.: Universality of data retrieval languages, Proc. 6th Ann. ACM Symp. on Principles of Programming Languages, ACM Press (1979) 110\u2013117."},{"key":"27_CR4","unstructured":"Chandra, A.: Programming primitives for database languages, Proc. 8th Ann. ACM Symp. on Principles of Programming Languages, ACM Press (1981) 50\u201362."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0022-0000(82)90012-5","volume":"25","author":"A. Chandra","year":"1982","unstructured":"Chandra, A., Harel, D.: Structure and complexity of relational queries, J. Comput. System Sci. 25 (1982) 99\u2013128.","journal-title":"J. Comput. System Sci."},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0020-0190(98)00196-3","volume":"69","author":"S.R. Chauhan","year":"1999","unstructured":"Chauhan, S.R., Stewart, I.A.: On the power of built-in relations in certain classes of program schemes, Inform. Process. Lett. 69 (1999) 77\u201382.","journal-title":"Inform. Process. Lett."},{"key":"27_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1137\/0201006","volume":"1","author":"R. Constable","year":"1972","unstructured":"Constable, R., Gries, D.: On classes of program schemata, SIAM J. Comput. 1 (1972) 66\u2013118.","journal-title":"SIAM J. Comput."},{"key":"27_CR8","unstructured":"Courcelle, B.: Recursive applicative program schemes, Handbook of Theoretical Computer Science Vol. B (ed. van Leeuwen, J.), Elsevier (1990) 459\u2013492."},{"key":"27_CR9","unstructured":"Dawar, A., Gr\u00e4del, E.: Generalized quantifiers and 0-1 laws, Proc. 10th IEEE Ann. Symp. on Logic in Computer Science, IEEE Press (1995) 54\u201364."},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite Model Theory, Springer-Verlag (1995).","DOI":"10.1007\/3-540-28788-4"},{"key":"27_CR11","unstructured":"Friedman, H.: Algorithmic procedures, generalized Turing algorithms and elementary recursion theory, Logic Colloquium 1969 (ed. Gandy, R.O., Yates, C.M.E.), North-Holland (1971) 361\u2013390."},{"key":"27_CR12","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/S0019-9958(84)80023-6","volume":"60","author":"D. Harel","year":"1984","unstructured":"Harel, D., Peleg, D.: On static logics, dynamic logics, and complexity classes, Inform. Control 60 (1984) 86\u2013102.","journal-title":"Inform. Control"},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N. Immerman","year":"1987","unstructured":"Immerman, N.: Languages that capture complexity classes, SIAM J. Comput. 16 (1987) 760\u2013778.","journal-title":"SIAM J. Comput."},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1145\/322003.322016","volume":"24","author":"N.D. Jones","year":"1977","unstructured":"Jones, N.D., Muchnik, S.S.: Even simple programs are hard to analyze, J. Assoc. Comput. Mach. 24 (1977) 338\u2013350.","journal-title":"J. Assoc. Comput. Mach."},{"key":"27_CR15","unstructured":"Kozen, D., Tiuryn, J.: Logics of programs, Handbook of Theoretical Computer Science Vol. B (ed. van Leeuwen, J.), Elsevier (1990) 789\u2013840."},{"key":"27_CR16","series-title":"Lect Notes Comput Sci","first-page":"58","volume-title":"Adding for-loops to first-order logic","author":"F. Neven","year":"1998","unstructured":"Neven, F., Otto, M., Tyszkiewicz, J., Van den Bussche, J.: Adding for-loops to first-order logic, Lecture Notes in Computer Science Vol. 1540, Springer-Verlag (1999) 58\u201369."},{"key":"27_CR17","unstructured":"Paterson, M., Hewitt, N.: Comparative schematology, Proc. Project MAC Conf. on Concurrent Systems and Parallel Computation, ACM Press (1970) 119\u2013128."},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01200263","volume":"30","author":"I.A. Stewart","year":"1993","unstructured":"Stewart, I.A.: Logical and schematic characterization of complexity classes, Acta Informat. 30 (1993) 61\u201387.","journal-title":"Acta Informat."},{"key":"27_CR19","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0168-0072(94)90036-1","volume":"66","author":"I.A. Stewart","year":"1994","unstructured":"Stewart, I.A.: Context-sensitive transitive closure operators, Ann. Pure App. Logic 66 (1994) 277\u2013301.","journal-title":"Ann. Pure App. Logic"},{"key":"27_CR20","unstructured":"Stewart, I.A.: Logics with zero-one laws that are not fragments of bounded-variable infinitary logic, Math. Logic Quart. 41 (1997) 158\u2013178."},{"key":"27_CR21","unstructured":"Stewart, I.A.: Using program schemes to logically capture polynomial-time on certain classes of structures, University of Leicester Technical Report 1998\/13 (1998)."},{"key":"27_CR22","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(88)90052-7","volume":"60","author":"J. Tiuryn","year":"1988","unstructured":"Tiuryn, J., Urzyczyn, P.: Some relationships between logics of programs and complexity theory, Theoret. Comput. Sci. 60 (1988) 83\u2013108.","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48168-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T04:09:21Z","timestamp":1586146161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48168-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665366","9783540481683"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-48168-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"13 May 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}