{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:04:23Z","timestamp":1743073463917,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153488"},{"type":"electronic","value":"9783642153495"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15349-5_10","type":"book-chapter","created":{"date-parts":[[2010,8,21]],"date-time":"2010-08-21T03:39:27Z","timestamp":1282361967000},"page":"146-160","source":"Crossref","is-referenced-by-count":4,"title":["The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions"],"prefix":"10.1007","author":[{"given":"Martin","family":"Mundhenk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Felix","family":"Wei\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-85108-0","volume-title":"Logic and Structure","author":"D. van Dalen","year":"2004","unstructured":"van Dalen, D.: Logic and Structure, 4th edn. Springer, Heidelberg (2004)","edition":"4"},{"key":"10_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537793.001.0001","volume-title":"Modal Logic","author":"A. Chagrov","year":"1997","unstructured":"Chagrov, A., Zakharyaschev, M.: Modal Logic. Clarendon Press, Oxford (1997)"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M.J. Fischer","year":"1979","unstructured":"Fischer, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci.\u00a018(2), 194\u2013211 (1979)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10_CR4","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/322033.322037","volume":"24","author":"N.A. Lynch","year":"1977","unstructured":"Lynch, N.A.: Log space recognition and translation of parenthesis languages. J. ACM\u00a024(4), 583\u2013590 (1977)","journal-title":"J. ACM"},{"key":"10_CR5","first-page":"123","volume-title":"Proc. 19th STOC","author":"S.R. Buss","year":"1987","unstructured":"Buss, S.R.: The Boolean formula value problem is in ALOGTIME. In: Proc. 19th STOC, pp. 123\u2013131. ACM Press, New York (1987)"},{"issue":"24","key":"10_CR6","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1002\/malq.19590051405","volume":"14","author":"M. Dummett","year":"1959","unstructured":"Dummett, M., Lemmon, E.: Modal logics between S4 and S5. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a014(24), 250\u2013264 (1959)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01874706","volume":"40","author":"A. Visser","year":"1980","unstructured":"Visser, A.: A propositional logic with explicit fixed points. Studia Logica\u00a040, 155\u2013175 (1980)","journal-title":"Studia Logica"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R. Ladner","year":"1977","unstructured":"Ladner, R.: The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing\u00a06(3), 467\u2013480 (1977)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR9","unstructured":"Spaan, E.: Complexity of Modal Logics. PhD thesis, Department of Mathematics and Computer Science. University of Amsterdam (1993)"},{"key":"10_CR10","unstructured":"Mundhenk, M., Wei\u00df, F.: The model checking problem for intuitionistic logic with one variable is AC1 -complete (2010) (unpublished manuscript)"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. Journal of the Association for Computing Machinery\u00a028, 114\u2013133 (1981)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10_CR12","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to Parallel Computation: P-Completeness Theory","author":"R. Greenlaw","year":"1995","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, New York (1995)"},{"key":"10_CR13","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"327","DOI":"10.2307\/2963526","volume":"25","author":"I. Nishimura","year":"1960","unstructured":"Nishimura, I.: On formulas of one variable in intuitionistic propositional calculus. J. of Symbolic Logic\u00a025, 327\u2013331 (1960)","journal-title":"J. of Symbolic Logic"},{"issue":"3","key":"10_CR15","doi-asserted-by":"publisher","first-page":"406","DOI":"10.2307\/2270456","volume":"31","author":"D. Makinson","year":"1966","unstructured":"Makinson, D.: There are infinitely many Diodorean modal functions. J. of Symbolic Logic\u00a031(3), 406\u2013408 (1966)","journal-title":"J. of Symbolic Logic"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Gabbay, D.M.: Semantical investigations in Heyting\u2019s intuitionistic logic. D.Reidel, Dordrecht (1981)","DOI":"10.1007\/978-94-017-2977-2"},{"key":"10_CR17","unstructured":"Rybakov, M.N.: Complexity of intuitionistic and Visser\u2019s basic and formal logics in finitely many variables. In: Papers from the 6th conference on \u201cAdvances in Modal Logic\u201d, pp. 393\u2013411. College Publications (2006)"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-540-72734-7_30","volume-title":"Logical Foundations of Computer Science","author":"M. O\u2019Connor","year":"2007","unstructured":"O\u2019Connor, M.: Embeddings into free Heyting algebras and translations into intuitionistic propositional logic. In: Artemov, S., Nerode, A. (eds.) LFCS 2007. LNCS, vol.\u00a04514, pp. 437\u2013448. Springer, Heidelberg (2007)"},{"issue":"3","key":"10_CR19","doi-asserted-by":"crossref","first-page":"989","DOI":"10.2178\/jsl\/1154698587","volume":"71","author":"D. Fernandez","year":"2005","unstructured":"Fernandez, D.: A polynomial translation of S4 into intuitionistic logic. J. of Symbolic Logic\u00a071(3), 989\u20131001 (2005)","journal-title":"J. of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15349-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T19:31:58Z","timestamp":1711740718000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-15349-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153488","9783642153495"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15349-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}