{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:13:49Z","timestamp":1725732829261},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44602-7_8","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:18:40Z","timestamp":1408756720000},"page":"90-103","source":"Crossref","is-referenced-by-count":2,"title":["Capturing Bisimulation-Invariant Complexity Classes with Higher-Order Modal Fixpoint Logic"],"prefix":"10.1007","author":[{"given":"Martin","family":"Lange","sequence":"first","affiliation":[]},{"given":"Etienne","family":"Lozes","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-540-28644-8_33","volume-title":"CONCUR 2004 - Concurrency Theory","author":"M. Viswanathan","year":"2004","unstructured":"Viswanathan, M., Viswanathan, R.: A higher order modal fixed point logic. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 512\u2013528. Springer, Heidelberg (2004)"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional \u03bc-calculus. TCS\u00a027, 333\u2013354 (1983)","journal-title":"TCS"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-3(2:7)2007","volume":"3","author":"R. Axelsson","year":"2007","unstructured":"Axelsson, R., Lange, M., Somla, R.: The complexity of model checking higher-order fixpoint logic. Logical Methods in Computer Science\u00a03, 1\u201333 (2007)","journal-title":"Logical Methods in Computer Science"},{"key":"8_CR4","first-page":"43","volume":"7","author":"R. Fagin","year":"1974","unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. Complexity and Computation\u00a07, 43\u201373 (1974)","journal-title":"Complexity and Computation"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L.J. Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. TCS\u00a03(1), 1\u201322 (1976)","journal-title":"TCS"},{"issue":"4","key":"8_CR6","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N. Immerman","year":"1987","unstructured":"Immerman, N.: Languages that capture complexity classes. SIAM Journal of Computing\u00a016(4), 760\u2013778 (1987)","journal-title":"SIAM Journal of Computing"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1006\/jcss.1995.1025","volume":"50","author":"S. Abiteboul","year":"1995","unstructured":"Abiteboul, S., Vianu, V.: Computing with first-order logic. Journal of Computer and System Sciences\u00a050(2), 309\u2013335 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: STOC, pp. 137\u2013146. ACM (1982)","DOI":"10.1145\/800070.802186"},{"issue":"1-3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","volume":"68","author":"N. Immerman","year":"1986","unstructured":"Immerman, N.: Relational queries computable in polynomial time. Information and Control\u00a068(1-3), 86\u2013104 (1986)","journal-title":"Information and Control"},{"key":"8_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1999","unstructured":"Immerman, N.: Descriptive Complexity. Springer, New York (1999)"},{"key":"8_CR11","unstructured":"Gr\u00e4del, E., Kolaitis, P.G., Libkin, L., Marx, M., Spencer, J., Vardi, M.Y., Venema, Y., Weinstein, S.: Finite Model Theory and its Applications. Springer (2007)"},{"issue":"1-2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(98)00314-4","volume":"224","author":"M. Otto","year":"1999","unstructured":"Otto, M.: Bisimulation-invariant PTIME and higher-dimensional \u03bc-calculus. Theor. Comput. Sci.\u00a0224(1-2), 237\u2013265 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR13","unstructured":"Andersen, H.R.: A polyadic modal \u03bc-calculus. Technical Report 145, IT Universitetet i K\u00f8benhavn (1994)"},{"key":"8_CR14","unstructured":"Milner, R.: Communication and Concurrency. International Series in Computer Science. Prentice Hall (1989)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Stirling, C.: Modal and Temporal Properties of Processes. Texts in Computer Science. Springer (2001)","DOI":"10.1007\/978-1-4757-3550-5"},{"issue":"1","key":"8_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(92)90149-A","volume":"101","author":"E. Gr\u00e4del","year":"1992","unstructured":"Gr\u00e4del, E.: Capturing complexity classes by fragments of second-order logic. Theor. Comput. Sci.\u00a0101(1), 35\u201357 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-642-54830-7_10","volume-title":"Foundations of Software Science and Computation Structures","author":"N. Kobayashi","year":"2014","unstructured":"Kobayashi, N., Inaba, K., Tsukada, T.: Unsafe order-2 tree languages are context-sensitive. In: Muscholl, A. (ed.) FOSSACS 2014 (ETAPS). LNCS, vol.\u00a08412, pp. 149\u2013163. Springer, Heidelberg (2014)"},{"key":"8_CR18","unstructured":"Lange, M., Lozes, E.: Capturing bisimulation invariant complexity classes with higher-order modal fixpoint logic, \n                    \n                      http:\/\/carrick.fmv.informatik.uni-kassel.de\/~lozes\/tcs14-long.pdf"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: Word problems requiring exponential time. In: STOC, pp. 1\u20139. ACM (1973)","DOI":"10.1145\/800125.804029"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A. Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its application. Pacific Journal of Mathematics\u00a05, 285\u2013309 (1955)","journal-title":"Pacific Journal of Mathematics"},{"key":"8_CR21","series-title":"LNCS","first-page":"288","volume-title":"Parallel Architectures and Languages Europe, PARLE 1991","author":"C. \u00c0lvarez","year":"1991","unstructured":"\u00c0lvarez, C., Balc\u00e1zar, J.L., Gabarr\u00f3, J., Santha, M.: Parallel complexity in the design and analysis on concurrent systems. In: Aarts, E.H.L., Rem, M., van Leeuwen, J. (eds.) PARLE 1991. LNCS, vol.\u00a0505, pp. 288\u2013303. Springer, Heidelberg (1991)"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44602-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T17:13:24Z","timestamp":1558977204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44602-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44602-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}