{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:17Z","timestamp":1725558437792},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_32","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T23:33:58Z","timestamp":1277508838000},"page":"397-412","source":"Crossref","is-referenced-by-count":2,"title":["Complexity of Some Problems in Modal and Intuitionistic Calculi"],"prefix":"10.1007","author":[{"given":"Larisa","family":"Maksimova","sequence":"first","affiliation":[]},{"given":"Andrei","family":"Voronkov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"32_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1093\/jigpal\/7.4.447","volume":"7","author":"A. Avellone","year":"1999","unstructured":"Avellone, A., Ferrari, M., Miglioli, P.: Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics. Logic Journal of the IGPL\u00a07(4), 447\u2013480 (1999)","journal-title":"Logic Journal of the IGPL"},{"key":"32_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":"32_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M.J. Fisher","year":"1979","unstructured":"Fisher, M.J., Ladner, R.E.: Propositional dynamic logic of regular programs. Journal of Computer and System Sciences\u00a018(2), 194\u2013211 (1979)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"32_CR4","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1111\/j.1755-2567.1980.tb00686.x","volume":"45","author":"G. Boolos","year":"1980","unstructured":"Boolos, G.: On systems of modal logic with provability interpretations. Theoria\u00a045(1), 7\u201318 (1980)","journal-title":"Theoria"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","volume":"54","author":"J.Y. Halpern","year":"1992","unstructured":"Halpern, J.Y., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence\u00a054, 319\u2013379 (1992)","journal-title":"Artificial Intelligence"},{"key":"32_CR6","first-page":"67","volume":"5","author":"T. Hosoi","year":"1963","unstructured":"Hosoi, T., Ono, H.: Intermediate propositional logics. a survey. J. of Tsuda College\u00a05, 67\u201382 (1963)","journal-title":"J. of Tsuda College"},{"key":"32_CR7","first-page":"67","volume-title":"Handbook of Theoretical Computer Science","author":"D.S. Johnson","year":"1990","unstructured":"Johnson, D.S.: A catalog of complexity classes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0A, ch. 8, pp. 67\u2013161. Elsevier, Amsterdam (1990)"},{"key":"32_CR8","unstructured":"Kuznetsov, A.V.: Some properties of the lattice of varieties of pseudo-boolean algebras. In: 11th Sovjet Algebraic Colloquium, Abstracts, Kishinev, pp. 255\u2013256 (1971)"},{"issue":"3","key":"32_CR9","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R.E. Ladner","year":"1977","unstructured":"Ladner, R.E.: The computational complexity of provability in systems of modal prepositional logic. SIAM Journal of Computing\u00a06(3), 467\u2013480 (1977)","journal-title":"SIAM Journal of Computing"},{"issue":"5","key":"32_CR10","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/BF02330744","volume":"11","author":"L.L. Maksimova","year":"1972","unstructured":"Maksimova, L.L.: Pretabular superintuitionistic logics. Algebra and Logic\u00a011(5), 558\u2013570 (1972)","journal-title":"Algebra and Logic"},{"issue":"3","key":"32_CR11","first-page":"304","volume":"14","author":"L.L. Maksimova","year":"1975","unstructured":"Maksimova, L.L.: Modal logics of finite slices. Algebra and Logic\u00a014(3), 304\u2013319 (1975)","journal-title":"Algebra and Logic"},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BF01668576","volume":"14","author":"L.L. Maksimova","year":"1975","unstructured":"Maksimova, L.L.: Pretabular extensions of Lewis\u2019 logic S4. Algebra and Logic\u00a014(1), 28\u201355 (1975)","journal-title":"Algebra and Logic"},{"issue":"6","key":"32_CR13","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/BF01670006","volume":"16","author":"L.L. Maksimova","year":"1977","unstructured":"Maksimova, L.L.: Craig\u2019s theorem in superintuitionistic logics and amalgamable varieties of pseudoboolean algebras. Algebra and Logic\u00a016(6), 643\u2013681 (1977)","journal-title":"Algebra and Logic"},{"issue":"5","key":"32_CR14","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1007\/BF01673502","volume":"18","author":"L.L. Maksimova","year":"1979","unstructured":"Maksimova, L.L.: Interpolation theorems in modal logics and amalgamable varieties of topoboolean algebras. Algebra and Logic\u00a018(5), 556\u2013586 (1979)","journal-title":"Algebra and Logic"},{"issue":"3","key":"32_CR15","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/BF01674424","volume":"18","author":"L.L. Maksimova","year":"1979","unstructured":"Maksimova, L.L.: On a classification of modal logics. Algebra and Logic\u00a018(3), 328\u2013340 (1979)","journal-title":"Algebra and Logic"},{"issue":"2","key":"32_CR16","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/BF01669837","volume":"19","author":"L.L. Maksimova","year":"1980","unstructured":"Maksimova, L.L.: Interpolation theorems in modal logic: Sufficient conditions. Algebra and Logic\u00a019(2), 194\u2013213 (1980)","journal-title":"Algebra and Logic"},{"key":"32_CR17","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/BF01982206","volume":"21","author":"L.L. Maksimova","year":"1982","unstructured":"Maksimova, L.L.: Absence of interpolation in modal companions of Dummett\u2019s logic. Algebra and Logic\u00a021, 690\u2013694 (1982)","journal-title":"Algebra and Logic"},{"issue":"3\/4","key":"32_CR18","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/BF00370682","volume":"50","author":"L.L. Maksimova","year":"1991","unstructured":"Maksimova, L.L.: Amalgamation and interpolation in normal modal logics. Studia Logica\u00a050(3\/4), 457\u2013471 (1991)","journal-title":"Studia Logica"},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/BF01463150","volume":"13","author":"L.L. Maksimova","year":"1974","unstructured":"Maksimova, L.L., Rybakov, V.V.: On a lattice of normal modal logics. Algebra and Logic\u00a013, 188\u2013216 (1974)","journal-title":"Algebra and Logic"},{"key":"32_CR20","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1017\/S0027763000011715","volume":"26","author":"S. Miura","year":"1966","unstructured":"Miura, S.: A remark on the intersection of two logics. Nagoya Math. Journal\u00a026, 167\u2013171 (1966)","journal-title":"Nagoya Math. Journal"},{"key":"32_CR21","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: Models of program logics. In: Proceedings 20th IEEE Symposium on Foundations of Computer Science, pp. 115\u2013122 (1979)","DOI":"10.1109\/SFCS.1979.24"},{"key":"32_CR23","unstructured":"Spaan, E.: Complexity of Modal Logics. PhD thesis, Institute for Logic, Language and Computation, University of Amsterdam (1992)"},{"key":"32_CR24","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(79)90006-9","volume":"9","author":"R. Statman","year":"1979","unstructured":"Statman, R.: Intuitionistic propositional logic is polynomial-space complete. Theoretical Computer Science\u00a09, 67\u201372 (1979)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"32_CR25","first-page":"1044","volume":"32","author":"V.A. Yankov","year":"1968","unstructured":"Yankov, V.A.: On the calculus of weak low of excluded middle. Izvestia Academii Nauk SSSR, Ser. math.\u00a032(5), 1044\u20131051 (1968)","journal-title":"Izvestia Academii Nauk SSSR, Ser. math."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:48:39Z","timestamp":1711572519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}