{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T18:34:28Z","timestamp":1742927668402,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354666"},{"type":"electronic","value":"9783540354680"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11780342_52","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T02:19:46Z","timestamp":1151461186000},"page":"516-525","source":"Crossref","is-referenced-by-count":1,"title":["Partially Ordered Connectives and \u22111 1 on Finite Models"],"prefix":"10.1007","author":[{"given":"Merlijn","family":"Sevenster","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tero","family":"Tulenheimo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","volume":"24","author":"M. Ajtai","year":"1983","unstructured":"Ajtai, M.: \n                  \n                    \n                  \n                  $\\Sigma_{1}^{1}$\n                -formulae on finite structures. Annals of Pure and Applied Logic\u00a024, 1\u201348 (1983)","journal-title":"Annals of Pure and Applied Logic"},{"key":"52_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.2307\/2274958","volume":"55","author":"M. Ajtai","year":"1990","unstructured":"Ajtai, M., Fagin, R.: Reachability is harder for directed than for undirected graphs. Journal of Symbolic Logic\u00a055, 113\u2013150 (1990)","journal-title":"Journal of Symbolic Logic"},{"issue":"3","key":"52_CR3","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1006\/jcss.1999.1691","volume":"60","author":"M. Ajtai","year":"2000","unstructured":"Ajtai, M., Fagin, R., Stockmeyer, L.: The closure of monadic NP. Journal of Computer and System Sciences\u00a060(3), 660\u2013716 (2000)","journal-title":"Journal of Computer and System Sciences"},{"key":"52_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(86)90040-0","volume":"32","author":"A. Blass","year":"1986","unstructured":"Blass, A., Gurevich, Y.: Henkin quantifiers and complete problems. Annals of Pure and Applied Logic\u00a032, 1\u201316 (1986)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"2","key":"52_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1093\/logcom\/8.2.189","volume":"8","author":"A. Durand","year":"1998","unstructured":"Durand, A., Lautemann, C., Schwentick, T.: Subclasses of Binary-NP. Journal of Logic and Computation\u00a08(2), 189\u2013207 (1998)","journal-title":"Journal of Logic and Computation"},{"key":"52_CR6","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Berlin (1999)"},{"key":"52_CR7","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","volume":"49","author":"A. Ehrenfeucht","year":"1961","unstructured":"Ehrenfeucht, A.: An application of games to the completeness problem for formalized theories. Fundamenta Mathematicae\u00a049, 129\u2013141 (1961)","journal-title":"Fundamenta Mathematicae"},{"key":"52_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/malq.19700160802","volume":"16","author":"H.B. Enderton","year":"1970","unstructured":"Enderton, H.B.: Finite partially ordered quantifiers. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a016, 393\u2013397 (1970)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"52_CR9","unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Karp, R.M. (ed.) SIAM-AMS Proceedings, Complexity of Computation, vol.\u00a07, pp. 43\u201373 (1974)"},{"key":"52_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1002\/malq.19750210112","volume":"21","author":"R. Fagin","year":"1975","unstructured":"Fagin, R.: Monadic generalized spectra. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a021, 89\u201396 (1975)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"52_CR11","unstructured":"Fra\u00efss\u00e9, R.: Sur quelques classifications des syst\u00e8mes de relations. Publications Scientifiques, S\u00e9rie A, vol. 1, pp. 35\u2013182, Universit\u00e9 d\u2019Alger (1954)"},{"key":"52_CR12","series-title":"Annals of Mathematics Studies","first-page":"245","volume-title":"Contributions to the Theory of Games II","author":"D. Gale","year":"1953","unstructured":"Gale, D., Stewart, F.: Infinite games with perfect information. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games II. Annals of Mathematics Studies, vol.\u00a028, pp. 245\u2013266. Princeton University Press, Princeton (1953)"},{"issue":"2","key":"52_CR13","doi-asserted-by":"publisher","first-page":"545","DOI":"10.2307\/2275546","volume":"62","author":"G. Gottlob","year":"1997","unstructured":"Gottlob, G.: Relativized logspace and generalized quantifiers over finite ordered structures. The Journal of Symbolic Logic\u00a062(2), 545\u2013574 (1997)","journal-title":"The Journal of Symbolic Logic"},{"key":"52_CR14","series-title":"Synthese library: studies in epistemology, logic, methodology, and philosophy of science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-94-017-0524-0_4","volume-title":"Quantifiers: Logics, Models and Computation","author":"L. Hella","year":"1995","unstructured":"Hella, L., Sandu, G.: Partially ordered connectives and finite graphs. In: Krynicki, M., Mostowski, M., Szczerba, L.W. (eds.) Quantifiers: Logics, Models and Computation. Synthese library: studies in epistemology, logic, methodology, and philosophy of science, vol.\u00a0II, pp. 79\u201388. Kluwer Academic Publishers, Dordrecht (1995)"},{"key":"52_CR15","volume-title":"Graduate texts in computer science","author":"N. Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. In: Graduate texts in computer science. Springer, New York (1999)"},{"key":"52_CR16","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1002\/malq.19930390134","volume":"39","author":"M. Krynicki","year":"1993","unstructured":"Krynicki, M.: Hierarchies of finite partially ordered connectives and quantifiers. Mathematical Logic Quarterly\u00a039, 287\u2013294 (1993)","journal-title":"Mathematical Logic Quarterly"},{"key":"52_CR17","series-title":"Synthese library: studies in epistemology, logic, methodology, and philosophy of science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-94-017-0522-6_7","volume-title":"Quantifiers: Logics, Models and Computation","author":"M. Krynicki","year":"1995","unstructured":"Krynicki, M., Mostowski, M.: Henkin quantifiers. In: Krynicki, M., Mostowski, M., Szczerba, L.W. (eds.) Quantifiers: Logics, Models and Computation. Synthese library: studies in epistemology, logic, methodology, and philosophy of science, vol.\u00a0I, pp. 193\u2013262. Kluwer Academic Publishers, The Netherlands (1995)"},{"issue":"1","key":"52_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1093\/jigpal\/5.1.79","volume":"5","author":"G. Sandu","year":"1997","unstructured":"Sandu, G.: The logic of informational independence and finite models. Logic Journal of the IGPL\u00a05(1), 79\u201395 (1997)","journal-title":"Logic Journal of the IGPL"},{"key":"52_CR19","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1002\/malq.19920380134","volume":"38","author":"G. Sandu","year":"1992","unstructured":"Sandu, G., V\u00e4\u00e4n\u00e4nen, J.: Partially ordered connectives. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a038, 361\u2013372 (1992)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"52_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(84)90166-3","volume":"49","author":"G. Tur\u00e1n","year":"1984","unstructured":"Tur\u00e1n, G.: On the definability of properties of finite graphs. Discrete Mathematics\u00a049, 291\u2013302 (1984)","journal-title":"Discrete Mathematics"},{"key":"52_CR21","doi-asserted-by":"publisher","first-page":"535","DOI":"10.2307\/2271440","volume":"35","author":"W. Walkoe","year":"1970","unstructured":"Walkoe, W.: Finite partially-ordered quantification. Journal of Symbolic Logic\u00a035, 535\u2013555 (1970)","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Logical Approaches to Computational Barriers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780342_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T22:42:53Z","timestamp":1552344173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780342_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354666","9783540354680"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11780342_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}