乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:23:56Z","timestamp":1725902636623},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662553855"},{"type":"electronic","value":"9783662553862"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-55386-2_9","type":"book-chapter","created":{"date-parts":[[2017,6,28]],"date-time":"2017-06-28T11:24:53Z","timestamp":1498649093000},"page":"125-139","source":"Crossref","is-referenced-by-count":2,"title":["On Fragments of Higher Order Logics that on Finite Structures Collapse to Second Order"],"prefix":"10.1007","author":[{"given":"Flavio","family":"Ferrarotti","sequence":"first","affiliation":[]},{"given":"Sen\u00e9n","family":"Gonz\u00e1lez","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Mar\u00eda","family":"Turull-Torres","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,29]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/3-540-45071-8_40","volume-title":"Computing and Combinatorics","author":"FN Abu-Khzam","year":"2003","unstructured":"Abu-Khzam, F.N., Langston, M.A.: Graph coloring and the immersion order. In: Warnow, T., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 394\u2013403. Springer, Heidelberg (2003). doi:\n10.1007\/3-540-45071-8_40"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Beaudry, M., McKenzie, P.: Cicuits, matrices, and nonassociative computation. In: Proceedings of the Seventh Annual Structure in Complexity Theory Conference, Boston, Massachusetts, USA, 22\u201325 June 1992, pp. 94\u2013106 (1992)","DOI":"10.1109\/SCT.1992.215384"},{"key":"9_CR3","series-title":"Graduate Texts in Mathematics","volume-title":"Modern Graph Theory","author":"B Bollob\u00e1s","year":"2002","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Graduate Texts in Mathematics, vol. 184. Springer, Heidelberg (2002). Corrected edition"},{"key":"9_CR4","series-title":"Monographs in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"RG Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, Heidelberg (1999)"},{"key":"9_CR5","series-title":"Perspectives in Mathematical Logic","volume-title":"Finite Model Theory","author":"HD Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic, 2nd edn. Springer, Heidelberg (1999)","edition":"2"},{"key":"9_CR6","unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Karp, R. (ed.) Complexity of Computations. SIAM-AMS Proceedings, vol. 7, pp. 27\u201341. American Mathematical Society (1974)"},{"key":"9_CR7","unstructured":"Ferrarotti, F.: Expressibility of higher-order logics on relational databases: proper hierarchies. Ph.D. thesis, Department of Information Systems, Massey University, Wellington, New Zealand (2008). \nhttp:\/\/hdl.handle.net\/10179\/799"},{"issue":"2","key":"9_CR8","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1093\/jigpal\/jzt025","volume":"22","author":"F Ferrarotti","year":"2014","unstructured":"Ferrarotti, F., Ren, W., Turull-Torres, J.M.: Expressing properties in second- and third-order logic: hypercube graphs and SATQBF. Logic J. IGPL 22(2), 355\u2013386 (2014)","journal-title":"Logic J. IGPL"},{"key":"9_CR9","unstructured":"Ferrarotti, F., Tec, L., Torres, J.M.T.: On higher order query languages which on relational databases collapse to second order logic. CoRR abs\/1612.03155 (2016). \nhttp:\/\/arxiv.org\/abs\/1612.03155"},{"issue":"1\u20132","key":"9_CR10","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10472-007-9071-4","volume":"50","author":"F Ferrarotti","year":"2007","unstructured":"Ferrarotti, F., Turull-Torres, J.M.: Arity and alternation: a proper hierarchy in higher order logics. Ann. Math. Artif. Intell. 50(1\u20132), 111\u2013141 (2007)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9_CR11","series-title":"Texts in Theoretical Computer Science. An EATCS Series","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer-Verlag New York, Inc., Secaucus (2006)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Grohe, M., Kawarabayashi, K., Marx, D., Wollan, P.: Finding topological subgraphs is fixed-parameter tractable. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 479\u2013488. ACM, New York (2011)","DOI":"10.1145\/1993636.1993700"},{"issue":"2","key":"9_CR13","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 355(2), 197\u2013214 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"10","key":"9_CR14","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/1932682.1869463","volume":"45","author":"S Itzhaky","year":"2010","unstructured":"Itzhaky, S., Gulwani, S., Immerman, N., Sagiv, M.: A simple inductive synthesis methodology and its applications. SIGPLAN Not. 45(10), 36\u201346 (2010)","journal-title":"SIGPLAN Not."},{"key":"9_CR15","series-title":"Texts in Theoretical Computer Science, EATCS","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. Texts in Theoretical Computer Science, EATCS. Springer, Heidelberg (2004)"},{"issue":"1\u20133","key":"9_CR16","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0168-0072(95)00013-5","volume":"78","author":"JA Makowsky","year":"1996","unstructured":"Makowsky, J.A., Pnueli, Y.B.: Arity and alternation in second-order logic. Ann. Pure Appl. Logic 78(1\u20133), 189\u2013202 (1996)","journal-title":"Ann. Pure Appl. Logic"},{"key":"9_CR17","unstructured":"Schewe, K.D., Turull-Torres, J.M.: Fixed-point quantifiers in higher order logics. In: Proceedings of the 2006 Conference on Information Modelling and Knowledge Bases XVII, pp. 237\u2013244. IOS Press, Amsterdam (2006)"},{"issue":"1","key":"9_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"LJ Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. Theoret. Comput. Sci. 3(1), 1\u201322 (1976)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information, and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-55386-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,3]],"date-time":"2017-07-03T10:28:29Z","timestamp":1499077709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-55386-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662553855","9783662553862"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-55386-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}