{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:10:53Z","timestamp":1748405453104,"version":"3.41.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031896095","type":"print"},{"value":"9783031896101","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-89610-1_7","type":"book-chapter","created":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:41:29Z","timestamp":1748335289000},"page":"97-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounded Henkin Quantifiers and\u00a0the\u00a0Exponential Time Hierarchy"],"prefix":"10.1007","author":[{"given":"Abhishek","family":"De","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,26]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity. Cambridge University Press, Cambridge (2009)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1613\/jair.3152","volume":"40","author":"A Atserias","year":"2011","unstructured":"Atserias, A., Fichte, J.K., Thurley, M.: Clause-learning algorithms with many restarts and bounded-width resolution. J. Artif. Intell. Res. 40, 353\u2013373 (2011). https:\/\/doi.org\/10.1613\/jair.3152","journal-title":"J. Artif. Intell. Res."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-030-36755-8_9","volume-title":"Logical Foundations of Computer Science","author":"M Baaz","year":"2020","unstructured":"Baaz, M., Lolic, A.: A globally sound analytic calculus for Henkin quantifiers. In: Artemov, S., Nerode, A. (eds.) Logical Foundations of Computer Science, pp. 128\u2013143. Springer, Cham (2020)"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Beyersdorff, O., Janota, M., Lonsing, F., Seidl, M.: Chapter 31. Quantified Boolean Formulas. IOS Press (2021). https:\/\/doi.org\/10.3233\/faia201015","DOI":"10.3233\/faia201015"},{"key":"7_CR5","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. Ann. Pure Appl. Logic 32, 1\u201316 (1986). https:\/\/doi.org\/10.1016\/0168-0072(86)90040-0","journal-title":"Ann. Pure Appl. Logic"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Cook, S., Nguyen, P.: Logical Foundations of Proof Complexity. Cambridge University Press (2010). https:\/\/doi.org\/10.1017\/cbo9780511676277","DOI":"10.1017\/cbo9780511676277"},{"issue":"8","key":"7_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/malq.19700160802","volume":"16","author":"HB Enderton","year":"1970","unstructured":"Enderton, H.B.: Finite partially-ordered quantifiers. Math. Log. Q. 16(8), 393\u2013397 (1970). https:\/\/doi.org\/10.1002\/malq.19700160802","journal-title":"Math. Log. Q."},{"key":"7_CR8","unstructured":"Fagin, R.: Generalized first-order spectra, and polynomial. Time recognizable sets. SIAM-AMS Proc. 7 (1974)"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Hannula, M., Kontinen, J., L\u00fcck, M., Virtema, J.: On quantified propositional logics and the exponential time hierarchy. In: Cantone, D., Delzanno, G. (eds.) Proceedings of the Seventh International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2016, Catania, Italy, 14\u201316 September 2016. EPTCS, vol.\u00a0226, pp. 198\u2013212 (2016). https:\/\/doi.org\/10.4204\/EPTCS.226.14","DOI":"10.4204\/EPTCS.226.14"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0022-0000(89)90025-1","volume":"39","author":"LA Hemachandra","year":"1989","unstructured":"Hemachandra, L.A.: The strong exponential hierarchy collapses. J. Comput. Syst. Sci. 39(3), 299\u2013322 (1989). https:\/\/doi.org\/10.1016\/0022-0000(89)90025-1","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.2307\/2270594","volume":"30","author":"L Henkin","year":"1961","unstructured":"Henkin, L.: Some remarks on infinitely long formulas. J. Symb. Log. 30(1), 167\u2013183 (1961). https:\/\/doi.org\/10.2307\/2270594","journal-title":"J. Symb. Log."},{"issue":"3\u20134","key":"7_CR12","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1111\/j.1746-8361.1973.tb00624.x","volume":"27","author":"J Hintikka","year":"1973","unstructured":"Hintikka, J.: Quantifiers vs. quantification theory. Dialectica 27(3\u20134), 329\u2013358 (1973)","journal-title":"Dialectica"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"535","DOI":"10.2307\/2271440","volume":"35","author":"W John Walkoe","year":"1970","unstructured":"John Walkoe, W.: Finite partially-ordered quantification. J. Symb. Log. 35(4), 535\u2013555 (1970). https:\/\/doi.org\/10.2307\/2271440","journal-title":"J. Symb. Log."},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0304-3975(82)90076-7","volume":"21","author":"CF Kent","year":"1982","unstructured":"Kent, C.F., Hodgson, B.R.: An arithmetical characterization of NP. Theor. Comput. Sci. 21(3), 255\u2013267 (1982). https:\/\/doi.org\/10.1016\/0304-3975(82)90076-7","journal-title":"Theor. Comput. Sci."},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Kraj\u00ed\u010dek, J.: Proof Complexity. Cambridge University Press (2019). https:\/\/doi.org\/10.1017\/9781108242066","DOI":"10.1017\/9781108242066"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Krynicki, M., Mostowski, M.: Henkin Quantifiers, pp. 193\u2013262. Springer, Dordrecht (1995). https:\/\/doi.org\/10.1007\/978-94-017-0522-6_7","DOI":"10.1007\/978-94-017-0522-6_7"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Lipton, R.J.: Model theoretic aspects of computational complexity. In: 19th Annual Symposium on Foundations of Computer Science (SFCS 1978), pp. 193\u2013200 (1978). https:\/\/api.semanticscholar.org\/CorpusID:16784399","DOI":"10.1109\/SFCS.1978.23"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Lonsing, F., Biere, A.: Depqbf: a dependency-aware QBF solver: system description. J. Satisfiability Boolean Model. Comput. 7(2-3), 71\u201376 (2010). https:\/\/doi.org\/10.3233\/sat190077","DOI":"10.3233\/sat190077"},{"key":"7_CR19","unstructured":"Lorenzen, P., Lorenz, K. (eds.): Dialogische Logik. Wissenschaftliche Buchgesellschaft, [Abt. Verl.], Darmstadt (1978)"},{"issue":"1","key":"7_CR20","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(95)00078-X","volume":"158","author":"SE Mocas","year":"1996","unstructured":"Mocas, S.E.: Separating classes in the exponential-time hierarchy from classes in PH. Theor. Comput. Sci. 158(1), 221\u2013231 (1996). https:\/\/doi.org\/10.1016\/0304-3975(95)00078-X","journal-title":"Theor. Comput. Sci."},{"key":"7_CR21","unstructured":"Mostowski, M.: An extension of the logic with branched quantifiers. In: 8th International Congress of Logic, Methodology and Philosophy of Science, Abtracts, vol.\u00a05, pp. 261\u2013263 (1987)"},{"key":"7_CR22","unstructured":"Mostowski, M.: Arithmetic with the Henkin quantifier and its generalizations. In: Gaillard, F., Richard, D. (eds.) Seminaire du Laboratoire Logique, Algorithmique Et Informatique Clermontois, pp. 1\u201325 (1991)"},{"key":"7_CR23","unstructured":"Mostowski, M.: Branched quantifiers. Dzia\u0139 Wydawnictw Filii Uniwersytetu Warszawskiego (1991)"},{"issue":"7","key":"7_CR24","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1016\/S0898-1221(00)00333-3","volume":"41","author":"G Peterson","year":"2001","unstructured":"Peterson, G., Reif, J., Azhar, S.: Lower bounds for multiplayer noncooperative games of incomplete information. Comput. Math. Appl. 41(7), 957\u2013992 (2001). https:\/\/doi.org\/10.1016\/S0898-1221(00)00333-3","journal-title":"Comput. Math. Appl."},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Peterson, G.L., Reif, J.H.: Multiple-person alternation. In: 20th Annual Symposium on Foundations of Computer Science (SFCS 1979), pp. 348\u2013363 (1979). https:\/\/doi.org\/10.1109\/SFCS.1979.25","DOI":"10.1109\/SFCS.1979.25"},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning sat solvers as resolution engines. Artif. Intell. 175(2), 512\u2013525 (2011). https:\/\/doi.org\/10.1016\/j.artint.2010.10.002. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0004370210001669","DOI":"10.1016\/j.artint.2010.10.002"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Pudlak, P.: Logical Foundations of Mathematics and Computational Complexity. 2013th edn. Springer Monographs in Mathematics. Springer, Cham (2013)","DOI":"10.1007\/978-3-319-00119-7"},{"key":"7_CR28","unstructured":"Voss, C.: Descriptive complexity and some unusual quantifiers. Master\u2019s thesis, MIT (2016)"},{"key":"7_CR29","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-319-40970-2_29","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2016","author":"R Wimmer","year":"2016","unstructured":"Wimmer, R., Scholl, C., Wimmer, K., Becker, B.: Dependency schemes for DQBF. In: Creignou, N., Le Berre, D. (eds.) Theory and Applications of Satisfiability Testing - SAT 2016, pp. 473\u2013489. Springer, Cham (2016)"}],"container-title":["Lecture Notes in Computer Science","Logic and Its Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-89610-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T08:41:35Z","timestamp":1748335295000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-89610-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031896095","9783031896101"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-89610-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"26 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indian Conference on Logic and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 February 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 February 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icla2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logicindia.org\/icla\/icla2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}