{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:10:50Z","timestamp":1725905450629},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319628080"},{"type":"electronic","value":"9783319628097"}],"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_19","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T08:37:57Z","timestamp":1500539877000},"page":"260-271","source":"Crossref","is-referenced-by-count":1,"title":["Two-Variable First Order Logic with Counting Quantifiers: Complexity Results"],"prefix":"10.1007","author":[{"given":"Kamal","family":"Lodaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. V.","family":"Sreejith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"DAM Barrington","year":"1990","unstructured":"Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity within $$NC^1$$ . J. Comp. Syst. Sci. 41(3), 274\u2013306 (1990)","journal-title":"J. Comp. Syst. Sci."},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"JR B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundl. Math. 6, 66\u201392 (1960)","journal-title":"Z. Math. Logik Grundl. Math."},{"issue":"4","key":"19_CR3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF01305232","volume":"12","author":"J Cai","year":"1992","unstructured":"Cai, J., F\u00fcrer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identification. Combinatorica 12(4), 389\u2013410 (1992)","journal-title":"Combinatorica"},{"doi-asserted-by":"crossref","unstructured":"van Emde Boas, P.: The convenience of tilings. In: Sorbi, A. (ed.) Complexity, Logic and Recursion Theory, pp. 331\u2013363. CRC Press (1997)","key":"19_CR4","DOI":"10.1201\/9780429187490-12"},{"issue":"2","key":"19_CR5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1006\/inco.2001.2953","volume":"179","author":"K Etessami","year":"2002","unstructured":"Etessami, K., Vardi, M.Y., Wilke, T.: First-order logic with two variables and unary temporal logic. Inf. Comput. 179(2), 279\u2013295 (2002)","journal-title":"Inf. Comput."},{"key":"19_CR6","first-page":"213","volume":"38","author":"E Gr\u00e4del","year":"1999","unstructured":"Gr\u00e4del, E., Otto, M., Rosen, E.: Undecidability results on two-variable logics. Arch. Math. Log. 38, 213\u2013354 (1999)","journal-title":"Arch. Math. Log."},{"unstructured":"Krebs, A.: Typed semigroups, majority logic, and threshold circuits. Ph.D. thesis, Universit\u00e4t T\u00fcbingen (2008)","key":"19_CR7"},{"doi-asserted-by":"crossref","unstructured":"Krebs, A., Lodaya, K., Pandya, P., Straubing, H.: Two-variable logic with a between relation. In: Proceeding of 31st LICS (2016)","key":"19_CR8","DOI":"10.1145\/2933575.2935308"},{"issue":"4","key":"19_CR9","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1006\/jcss.2000.1742","volume":"62","author":"C Lautemann","year":"2001","unstructured":"Lautemann, C., McKenzie, P., Schwentick, T., Vollmer, H.: The descriptive complexity approach to LOGCFL. J. Comp. Syst. Sci. 62(4), 629\u2013652 (2001)","journal-title":"J. Comp. Syst. Sci."},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-15643-4_19","volume-title":"Automated Technology for Verification and Analysis","author":"K Lodaya","year":"2010","unstructured":"Lodaya, K., Sreejith, A.V.: LTL can be more succinct. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 245\u2013258. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15643-4_19"},{"unstructured":"Manuel, A., Sreejith, A.: Two-variable logic over countable linear orderings. In: 41st MFCS, Krak\u00f3w, pp. 66:1\u201366:13 (2016)","key":"19_CR11"},{"key":"19_CR12","volume-title":"Computation: Finite and Infinite Machines","author":"ML Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, New Jersy (1967)"},{"doi-asserted-by":"crossref","unstructured":"Pacholski, L., Szwast, W., Tendera, L.: Complexity of two-variable logic with counting. In: 12th LICS, Warsaw, pp. 318\u2013327. IEEE (1997)","key":"19_CR13","DOI":"10.1109\/LICS.1997.614958"},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.4064\/fm-127-1-67-76","volume":"127","author":"J Paris","year":"1986","unstructured":"Paris, J., Wilkie, A.: Counting $$\\Delta _0$$ sets. Fundam. Math. 127, 67\u201376 (1986)","journal-title":"Fundam. Math."},{"key":"19_CR15","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1090\/S0002-9939-1958-0093479-4","volume":"9","author":"RM Robinson","year":"1958","unstructured":"Robinson, R.M.: Restricted set-theoretical definitions in arithmetic. Proc. Am. Math. Soc. 9, 238\u2013242 (1958)","journal-title":"Proc. Am. Math. Soc."},{"issue":"3","key":"19_CR16","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/1071596.1071602","volume":"6","author":"N Schweikardt","year":"2005","unstructured":"Schweikardt, N.: Arithmetic, first-order logic, and counting quantifiers. ACM Trans. Comput. Log. 6(3), 634\u2013671 (2005)","journal-title":"ACM Trans. Comput. Log."},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-46011-X_20","volume-title":"Developments in Language Theory","author":"T Schwentick","year":"2002","unstructured":"Schwentick, T., Th\u00e9rien, D., Vollmer, H.: Partially-ordered two-way automata: A new characterization of DA. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 239\u2013250. Springer, Heidelberg (2002). doi: 10.1007\/3-540-46011-X_20"},{"key":"19_CR18","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/j.entcs.2011.10.016","volume":"278","author":"AV Sreejith","year":"2011","unstructured":"Sreejith, A.V.: Expressive completeness for LTL with modulo counting and group quantifiers. Electr. Notes Theor. Comput. Sci. 278, 201\u2013214 (2011)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"unstructured":"Sreejith, A.V.: Regular quantifiers in logics. Ph.D. thesis, HBNI (2013)","key":"19_CR19"},{"issue":"2","key":"19_CR20","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1142\/S0218196710005686","volume":"20","author":"H Straubing","year":"2010","unstructured":"Straubing, H., Tesson, P., Th\u00e9rien, D.: Weakly iterated block products and applications to logic and complexity. Int. J. Alg. Comput. 20(2), 319\u2013341 (2010)","journal-title":"Int. J. Alg. Comput."},{"issue":"1","key":"19_CR21","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s00224-002-1035-9","volume":"36","author":"H Straubing","year":"2003","unstructured":"Straubing, H., Th\u00e9rien, D.: Regular languages defined by generalized first-order formulas with a bounded number of bound variables. Theor. Comput. Syst. 36(1), 29\u201369 (2003)","journal-title":"Theor. Comput. Syst."},{"issue":"3","key":"19_CR22","first-page":"389","volume":"118","author":"H Straubing","year":"1995","unstructured":"Straubing, H., Th\u00e9rien, D., Thomas, W.: Regular languages defined with generalized quantifiers. Inf. Comput. 118(3), 389\u2013301 (1995)","journal-title":"Inf. Comput."},{"issue":"1","key":"19_CR23","first-page":"1","volume":"3","author":"P Tesson","year":"2007","unstructured":"Tesson, P., Th\u00e9rien, D.: Logic meets algebra: the case of regular languages. Log. Meth. Comp. Sci. 3(1), 1\u201326 (2007)","journal-title":"Log. Meth. Comp. Sci."},{"issue":"3","key":"19_CR24","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W Thomas","year":"1982","unstructured":"Thomas, W.: Classifying regular events in symbolic logic. J. Comput. Syst. Sci. 25(3), 360\u2013376 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"19_CR25","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/978-3-642-59126-6_7","volume-title":"Handbook of Formal Language Theory","author":"W Thomas","year":"1997","unstructured":"Thomas, W.: Languages, automata and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Language Theory, vol. III, pp. 389\u2013455. Springer, Heidelberg (1997)"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-74915-8_27","volume-title":"Computer Science Logic","author":"P Weis","year":"2007","unstructured":"Weis, P., Immerman, N.: Structure theorem and strict alternation hierarchy for FO2 on words. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 343\u2013357. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74915-8_27"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62809-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T03:06:09Z","timestamp":1569899169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}