{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:55Z","timestamp":1760202715719},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319670881"},{"type":"electronic","value":"9783319670898"}],"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-67089-8_3","type":"book-chapter","created":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T08:47:26Z","timestamp":1503564446000},"page":"26-41","source":"Crossref","is-referenced-by-count":3,"title":["Space-Efficient Fragments of Higher-Order Fixpoint Logic"],"prefix":"10.1007","author":[{"given":"Florian","family":"Bruse","sequence":"first","affiliation":[]},{"given":"Martin","family":"Lange","sequence":"additional","affiliation":[]},{"given":"Etienne","family":"Lozes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,25]]},"reference":[{"key":"3_CR1","unstructured":"Andersen, H.R.: A polyadic modal $$\\mu $$ -calculus. Technical Report ID-TR: 1994\u2013195, Dept. of Computer Science, Technical University of Denmark, Copenhagen (1994)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-75560-9_7","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"R Axelsson","year":"2007","unstructured":"Axelsson, R., Lange, M.: Model checking the first-order fragment of higher-order fixpoint logic. In: Dershowitz, N., Voronkov, A. (eds.) LPAR 2007. LNCS (LNAI), vol. 4790, pp. 62\u201376. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-75560-9_7"},{"key":"3_CR3","doi-asserted-by":"crossref","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 Meth. Comput. Sci. 3, 1\u201333 (2007)","journal-title":"Logical Meth. Comput. Sci."},{"issue":"2","key":"3_CR4","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(87)90097-4","volume":"24","author":"EA Emerson","year":"1987","unstructured":"Emerson, E.A.: Uniform inevitability is tree automaton ineffable. Inf. Process. Lett. 24(2), 77\u201379 (1987)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"3_CR5","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0022-0000(83)90014-4","volume":"26","author":"D Harel","year":"1983","unstructured":"Harel, D., Pnueli, A., Stavi, J.: Propositional dynamic logic of nonregular programs. J. Comput. Syst. Sci. 26(2), 222\u2013243 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J Hartmanis","year":"1965","unstructured":"Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Trans. AMS 117, 285\u2013306 (1965)","journal-title":"Trans. AMS"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Janin, D., Walukiewicz, I.: On the expressive completeness of the propositional $$\\mu $$ -calculus with respect to monadic second order logic. In: CONCUR, pp. 263\u2013277 (1996)","DOI":"10.1007\/3-540-61604-7_60"},{"issue":"1","key":"3_CR8","first-page":"5","volume":"11","author":"ND Jones","year":"2001","unstructured":"Jones, N.D.: The expressive power of higher-order types or, life without CONS. J. Funct. Progm. 11(1), 5\u201394 (2001)","journal-title":"J. Funct. Progm."},{"key":"3_CR9","doi-asserted-by":"crossref","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 $$\\mu $$ -calculus. TCS 27, 333\u2013354 (1983)","journal-title":"TCS"},{"issue":"1","key":"3_CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.jal.2005.08.002","volume":"4","author":"M Lange","year":"2005","unstructured":"Lange, M.: Model checking propositional dynamic logic with all extras. J. Appl. Logic 4(1), 39\u201349 (2005)","journal-title":"J. Appl. Logic"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Lange, M.: Temporal logics beyond regularity. Habilitation thesis, University of Munich, BRICS research report RS-07-13 (2007)","DOI":"10.7146\/brics.v14i13.22178"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-662-44602-7_8","volume-title":"Theoretical Computer Science","author":"M Lange","year":"2014","unstructured":"Lange, M., Lozes, E.: Capturing bisimulation-invariant complexity classes with higher-order modal fixpoint logic. In: Diaz, J., Lanese, I., Sangiorgi, D. (eds.) TCS 2014. LNCS, vol. 8705, pp. 90\u2013103. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-44602-7_8"},{"issue":"2","key":"3_CR13","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.ipl.2006.04.019","volume":"100","author":"M Lange","year":"2006","unstructured":"Lange, M., Somla, R.: Propositional dynamic logic of context-free programs and fixpoint logic with chop. Inf. Process. Lett. 100(2), 72\u201375 (2006)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20132","key":"3_CR14","doi-asserted-by":"crossref","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 $$\\mu $$ -calculus. Theor. Comput. Sci. 224(1\u20132), 237\u2013265 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"WJ Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4, 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Stearns, R.E., Hartmanis, J., Lewis II, P.M.: Hierarchies of memory limited computations. In: Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design, pp. 179\u2013190. IEEE (1965)","DOI":"10.1109\/FOCS.1965.11"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"van Emde Boas, P.: The convenience of tilings. In: Sorbi, A. (ed.) Complexity, Logic, and Recursion Theory, vol. 187 of Lecture Notes in Pure and Applied Mathematics, pp. 331\u2013363. Marcel Dekker Inc (1997)","DOI":"10.1201\/9780429187490-12"},{"key":"3_CR18","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. 3170, pp. 512\u2013528. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-28644-8_33"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67089-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T15:20:25Z","timestamp":1570029625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67089-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319670881","9783319670898"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67089-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}