{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:35:30Z","timestamp":1725471330877},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540454588"},{"type":"electronic","value":"9783540454595"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11874683_25","type":"book-chapter","created":{"date-parts":[[2006,9,27]],"date-time":"2006-09-27T13:47:26Z","timestamp":1159364846000},"page":"380-394","source":"Crossref","is-referenced-by-count":1,"title":["Complete Problems for Higher Order Logics"],"prefix":"10.1007","author":[{"given":"Lauri","family":"Hella","sequence":"first","affiliation":[]},{"given":"Jos\u00e9 Mar\u00eda","family":"Turull-Torres","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","volume-title":"Foundations of Databases","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)"},{"key":"25_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-79235-9","volume-title":"Structural Complexity I","author":"J. Balc\u00e1zar","year":"1995","unstructured":"Balc\u00e1zar, J., D\u00edaz, J., Gabarr\u00f3, J., Structural Complexity, I.: Structural Complexity I, 2nd edn. Springer, Heidelberg (1995)","edition":"2"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak Second-Order Arithmetic and Finite Automata. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a06, 66\u201392 (1960)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/3-540-13331-3_51","volume-title":"Logic and Machines: Decision Problems and Complexity","author":"E. Dahlhaus","year":"1984","unstructured":"Dahlhaus, E.: Reduction to NP-Complete Problems by Interpretations. In: B\u00f6rger, E., Hasenjaeger, G., R\u00f6dding, D. (eds.) Logic and Machines: Decision Problems and Complexity. LNCS, vol.\u00a0171, pp. 357\u2013365. Springer, Heidelberg (1984)"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1093\/logcom\/5.2.213","volume":"5","author":"A. Dawar","year":"1995","unstructured":"Dawar, A.: Generalized Quantifiers and Logical Reducibilities. Journal of Logic and Computation\u00a05, 213\u2013226 (1995)","journal-title":"Journal of Logic and Computation"},{"key":"25_CR6","volume-title":"Finite Model Theory","author":"H. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)","edition":"2"},{"unstructured":"Fagin, R.: Generalized First Order Spectra and Polynomial Time Recognizable Sets. In: Karp, R. (ed.) Complexity of Computation. SIAM AMS Proceedings, vol.\u00a07, pp. 43\u201373 (1974)","key":"25_CR7"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"517","DOI":"10.2307\/2275847","volume":"60","author":"M. Grohe","year":"1995","unstructured":"Grohe, M.: Complete Problems for Fixed-Point Logics. Journal of Symbolic Logic\u00a060, 517\u2013527 (1995)","journal-title":"Journal of Symbolic Logic"},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0022-0000(91)90036-5","volume":"43","author":"R. Hull","year":"1991","unstructured":"Hull, R., Su, J.: On the Expressive Power of Database Queries with Intermediate Types. Journal of Computer and System Sciences\u00a043(1), 219\u2013267 (1991)","journal-title":"Journal of Computer and System Sciences"},{"doi-asserted-by":"crossref","unstructured":"Hella, L., Turull Torres, J.M.: Expressibility of Higher Order Logics. Electronic Notes in Theoretical Computer Science\u00a084 (2003)","key":"25_CR10","DOI":"10.1016\/S1571-0661(04)80850-8"},{"unstructured":"Hella, L., Turull Torres, J.M.: Complete Problems for Higher Order Logics, Technical Report 12\/2005, p. 27, Information Systems Department, Massey University (2005)","key":"25_CR11"},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.tcs.2006.01.009","volume":"355","author":"L. Hella","year":"2006","unstructured":"Hella, L., Turull Torres, J.M.: Computing Queries with Higher Order Logics. Theoretical Computer Science\u00a0355(2), 197\u2013214 (2006)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Immerman, N.: Languages which Capture Complexity Classes. In: 15th ACM STOC Symposium, pp. 347\u2013354 (1983); revised version: Languages that Capture Complexity Classes. SIAM Journal of Computing 16(4), 760\u2013778 (1987)","key":"25_CR13","DOI":"10.1137\/0216051"},{"key":"25_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1999)"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0022-0000(89)90019-6","volume":"39","author":"D. Leivant","year":"1989","unstructured":"Leivant, D.: Descriptive Characterizations of Computational Complexity. Journal of Computer and System Sciences\u00a039, 51\u201383 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)"},{"issue":"3","key":"25_CR17","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1093\/logcom\/1.3.305","volume":"1","author":"I. Stewart","year":"1991","unstructured":"Stewart, I.: Comparing the Expressibility of Languages Formed Using NP-Complete Operators. Journal of Logic and Computation\u00a01(3), 305\u2013330 (1991)","journal-title":"Journal of Logic and Computation"},{"issue":"1","key":"25_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.: The Polynomial Time Hierarchy. Theoretical Computer Science\u00a03(1), 1\u201322 (1976)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11874683_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:24:43Z","timestamp":1619508283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11874683_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540454588","9783540454595"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11874683_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}