{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:11:39Z","timestamp":1761610299932,"version":"build-2065373602"},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3619,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s1571-0661(04)80850-8","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"129-140","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Expressibility of Higher Order Logics"],"prefix":"10.1016","volume":"84","author":[{"given":"Lauri","family":"Hella","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 M.","family":"Turull-Torres","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1994","series-title":"\u201cFoundations of Databases\u201d","author":"Abitebeoul","key":"10.1016\/S1571-0661(04)80850-8_NEWBIB1"},{"year":"1995","series-title":"\u201cStructural Complexity I\u201d","author":"Balc\u00e1zar","key":"10.1016\/S1571-0661(04)80850-8_NEWBIB2"},{"issue":"2","key":"10.1016\/S1571-0661(04)80850-8_NEWBIB3","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(80)90032-X","article-title":"Computable Queries for Relational Data Bases","volume":"21","author":"Chandra","year":"1980","journal-title":"Journal of Computer and System Sciences"},{"year":"1999","series-title":"\u201cFinite Model Theory\u201d","author":"Ebbinghaus","key":"10.1016\/S1571-0661(04)80850-8_NEWBIB4"},{"key":"10.1016\/S1571-0661(04)80850-8_NEWBIB5","unstructured":"Fagin R., Probabilities in Finite Models, in Notices of the American Mathematical Society, p\u00e1g. A714, Abstract nro. 72T-E90, 1972."},{"key":"10.1016\/S1571-0661(04)80850-8_NEWBIB6","unstructured":"Fagin R., Generalized First Order Spectra and Polynomial Time Recognizable Sets, in \u201cComplexity of Computation\u201d, ed. R. Karp. SIAM AMS Proceedings 7 (1974)"},{"issue":"1","key":"10.1016\/S1571-0661(04)80850-8_NEWBIB7","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1006\/inco.1997.2675","article-title":"Meta Finite Model Theory","volume":"140","author":"Gr\u00e4del","year":"1998","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80850-8_NEWBIB8","doi-asserted-by":"crossref","unstructured":"Hull R., and J. Su, Untyped Sets, Invention and Computable Queries, PODS 1989","DOI":"10.1145\/73721.73755"},{"issue":"1","key":"10.1016\/S1571-0661(04)80850-8_NEWBIB9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0022-0000(91)90036-5","article-title":"On the Expressive Power of Database Queries with Intermediate Types","volume":"43","author":"Hull","year":"1991","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S1571-0661(04)80850-8_NEWBIB10","unstructured":"L. Hella, and J. M. Turull-Torres. Expressing Database Queries with Higher Order Logics, Technical Report of the Dept. of I. Systems, Massey University 4\/2003."},{"year":"1999","series-title":"\u201cDescriptive Complexity\u201d","author":"Immerman","key":"10.1016\/S1571-0661(04)80850-8_NEWBIB11"},{"key":"10.1016\/S1571-0661(04)80850-8_NEWBIB12","doi-asserted-by":"crossref","unstructured":"Kuper, G. M. and M. Vardi. On the complexity of queries in the logical data model, in Proceedings of International Conference on Database Theory, ICDT 1988, Springer, LNCS 326, 267\u2013280, 1988","DOI":"10.1007\/3-540-50171-1_17"},{"issue":"1","key":"10.1016\/S1571-0661(04)80850-8_NEWBIB13","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0022-0000(89)90019-6","article-title":"Descriptive Characterizations of Computational Complexity","volume":"39","author":"Leivant","year":"1989","journal-title":"Journal of Computer and System Sciences"},{"year":"1984","series-title":"\u201cSubrecursion, Functions and Hierarchies\u201d","author":"Rose","key":"10.1016\/S1571-0661(04)80850-8_NEWBIB14"},{"key":"10.1016\/S1571-0661(04)80850-8_NEWBIB15","article-title":"The Polynomial Time Hierarchy","volume":"3","author":"Stockmeyer","year":"1977","journal-title":"Theoretical Computer Science"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104808508?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104808508?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:43Z","timestamp":1761610003000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104808508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":15,"alternative-id":["S1571066104808508"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80850-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2003,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Expressibility of Higher Order Logics","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80850-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}