{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:06:13Z","timestamp":1747548373579,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540164425"},{"type":"electronic","value":"9783540397823"}],"license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":[[1986]]},"DOI":"10.1007\/3-540-16442-1_12","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:40:15Z","timestamp":1330177215000},"page":"160-172","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["The choice of programming primitives for SETL-like programming languages"],"prefix":"10.1007","author":[{"given":"E.","family":"Dahlhaus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. A.","family":"Makowsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible sets and structures","author":"J. K. Barwise","year":"1975","unstructured":"J.K. Barwise, Admissible sets and structures, Springer, Berlin 1975."},{"issue":"2","key":"12_CR2","first-page":"156","volume":"21","author":"A. K. Chandra","year":"1980","unstructured":"A.K. Chandra and D. Harel, Computable queries for relational data bases, JCSS vol. 21.2 (1980) pp. 156\u2013178.","journal-title":"JCSS"},{"key":"12_CR3","first-page":"99","volume":"25","author":"A. K. Chandra","year":"1982","unstructured":"A.K. Chandra and D. Harel, Structure and complexity of relational queries, JCSS vol. 25, (1982) pp. 99\u2013128.","journal-title":"JCSS"},{"key":"12_CR4","volume-title":"Computable Directory Queries, Technical report of the Institut fuer Informatik, ETH-Zuerich, No. 65 (September 1985)","author":"E. Dahlhaus","year":"1986","unstructured":"E. Dahlhaus and J.A. Makowsky, Computable Directory Queries, Technical report of the Institut fuer Informatik, ETH-Zuerich, No. 65 (September 1985), extended abstract to appear in the Proceedings of CAAP '86, LNCS, Springer, Berlin 1986."},{"key":"12_CR5","unstructured":"R. Fagin, Generalized first order spectra and polynomial-time recognizable sets, in: Complexity of Computation, R.Karp ed., SIAM-AMS Proceedings no. 7 (1974) p.27\u201341."},{"key":"12_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11824-5","volume-title":"General Recursion Theory","author":"J. E. Fenstad","year":"1980","unstructured":"J.E. Fenstad, General Recursion Theory, Springer, Heidelberg 1980."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"R. Gandy, Church's Thesis and principles for mechanisms, in: The Kleene Symposium, J.Barwise et al. eds., Amsterdam 1980, pp.123\u2013148.","DOI":"10.1016\/S0049-237X(08)71257-6"},{"key":"12_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-09507-2","volume-title":"Fundamentals of programming languages","author":"E. Horowitz","year":"1983","unstructured":"E. Horowitz, Fundamentals of programming languages, Computer Science Press, Rockville 1983."},{"key":"12_CR9","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(84)80023-6","volume":"60","author":"D. Harel","year":"1984","unstructured":"D. Harel and D. Peleg, On static logics, dynamic logics and complexity classes, Information and Control vol. 60, (1984), p. 86\u2013102.","journal-title":"Information and Control"},{"key":"12_CR10","unstructured":"N. Immerman, Relational queries computable in polynomial time, 14th ACM Symposium on Theory of Computing, (1982) p. 147\u2013152."},{"key":"12_CR11","unstructured":"N. Immerman, Languages which capture complexity classes, 15th ACM Symposium on Theory of Computing, (1983) p. 347\u2013354."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"A, Levy, A hierarchy of formulas in set theory, Memoirs of the American Mathematical Society 57, Providence 1965.","DOI":"10.1090\/memo\/0057"},{"key":"12_CR13","volume-title":"Elementary induction on abstract structures","author":"Y. N. Moschovakis","year":"1974","unstructured":"Y.N. Moschovakis, Elementary induction on abstract structures, North Holland, Amsterdam 1974."},{"key":"12_CR14","volume-title":"Descriptive set theory","author":"Y. N. Moschovakis","year":"1980","unstructured":"Y.N. Moschovakis, Descriptive set theory, North Holland, Amsterdam 1980."},{"key":"12_CR15","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BFb0099491","volume-title":"Computation and Proof Theory","author":"Y. N. Moschovakis","year":"1984","unstructured":"Y.N. Moschovakis, Abstract recursion as a foundation for the theory of algorithms, in: Computation and Proof Theory, M.M. Richter et al. eds. LNM vol. 1104, Springer, Berlin-Heidelberg 1984, p. 289\u2013362."},{"key":"12_CR16","first-page":"303","volume-title":"Generalized recursion theory II","author":"D. Normann","year":"1978","unstructured":"D. Normann, Set recursion, in: Generalized recursion theory II, J.E. Fenstad et al. eds., North Holland, Amsterdam 1978, p. 303\u2013320."},{"key":"12_CR17","unstructured":"E. Schonberg, J.T. Schwartz and M. Sharir, Automatic data structure selection in SETL, 6. Annual ACM Symposium on Principles of Programming Languages (1979) pp.197\u2013210."},{"key":"12_CR18","volume-title":"On programming: An interim report on the SETL project","author":"J. T. Schwartz","year":"1975","unstructured":"J.T. Schwartz, On programming: An interim report on the SETL project, 2nd ed., Courant Institute of Mathematical Sciences, New York 1975.","edition":"2nd ed."},{"key":"12_CR19","first-page":"445","volume-title":"Logic Colloquium '73","author":"J. C. Shepherdson","year":"1973","unstructured":"J.C. Shepherdson, Computations over abstract structures, in: Logic Colloquium '73, H.E. Rose at al. eds., North Holland, Amsterdam 1973, p.445\u2013513."}],"container-title":["Lecture Notes in Computer Science","ESOP 86"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16442-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:08:36Z","timestamp":1578510516000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16442-1_12"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164425","9783540397823"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-16442-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]},"assertion":[{"value":"29 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}