{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:25:16Z","timestamp":1725600316436},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229923"},{"type":"electronic","value":"9783642229930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_34","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:44:46Z","timestamp":1312893886000},"page":"364-375","source":"Crossref","is-referenced-by-count":2,"title":["A Universally Defined Undecidable Unimodal Logic"],"prefix":"10.1007","author":[{"given":"Edith","family":"Hemaspaandra","sequence":"first","affiliation":[]},{"given":"Henning","family":"Schnoor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-14183-6_15","volume-title":"Deontic Logic in Computer Science","author":"G. Aucher","year":"2010","unstructured":"Aucher, G., Boella, G., van der Torre, L.: Privacy policies with modal logic: The dynamic turn. In: Governatori, G., Sartor, G. (eds.) DEON 2010. LNCS, vol.\u00a06181, pp. 196\u2013213. Springer, Heidelberg (2010)"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"H. Andr\u00e9ka","year":"1998","unstructured":"Andr\u00e9ka, H., van Benthem, J., N\u00e9meti, I.: Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic\u00a027, 217\u2013274 (1998)","journal-title":"Journal of Philosophical Logic"},{"key":"34_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal logic","author":"P. Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal logic. Cambridge University Press, New York (2001)"},{"issue":"1-2","key":"34_CR4","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.artint.2003.02.001","volume":"153","author":"B. Bennett","year":"2004","unstructured":"Bennett, B., Galton, A.: A unifying semantics for time and events. Artificial Intelligence\u00a0153(1-2), 13\u201348 (2004)","journal-title":"Artificial Intelligence"},{"issue":"2","key":"34_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01050635","volume":"2","author":"P. Blackburn","year":"1993","unstructured":"Blackburn, P., Spaan, E.: A modal perspective on the computational complexity of attribute value grammar. Journal of Logic, Language, and Information\u00a02(2), 129\u2013169 (1993)","journal-title":"Journal of Logic, Language, and Information"},{"key":"34_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-49545-2_19","volume-title":"Logics in Artificial Intelligence","author":"S. Demri","year":"1998","unstructured":"Demri, S., Konikowska, B.: Relative similarity logics are decidable: Reduction to FO2 with equality. In: Dix, J., Fari\u00f1as del Cerro, L., Furbach, U. (eds.) JELIA 1998. LNCS (LNAI), vol.\u00a01489, pp. 279\u2013293. Springer, Heidelberg (1998)"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Frendrup, U., H\u00fcttel, H., Jensen, J.: Modal logics for cryptographic processes. In: Proceedings of EXPRESS 2002 (2002)","DOI":"10.1016\/S1571-0661(05)80368-8"},{"issue":"3","key":"34_CR8","doi-asserted-by":"publisher","first-page":"619","DOI":"10.2307\/2274318","volume":"50","author":"K. Fine","year":"1985","unstructured":"Fine, K.: Logics containing K4. Part II. J. Symb. Log.\u00a050(3), 619\u2013651 (1985)","journal-title":"J. Symb. Log."},{"issue":"6","key":"34_CR9","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/BF01054038","volume":"22","author":"G. Garvon","year":"1993","unstructured":"Garvon, G., Goranko, V.: Modal logic with names. Journal of Philosophical Logic\u00a022(6), 607\u2013636 (1993)","journal-title":"Journal of Philosophical Logic"},{"issue":"3","key":"34_CR10","doi-asserted-by":"publisher","first-page":"993","DOI":"10.2178\/jsl\/1122038925","volume":"70","author":"D. Gabelaia","year":"2005","unstructured":"Gabelaia, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Products of \u2019transitive\u2019 modal logics. J. Symb. Log.\u00a070(3), 993\u20131021 (2005)","journal-title":"J. Symb. Log."},{"key":"34_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/3-540-12689-9_103","volume-title":"Foundations of Computation Theory","author":"D. Harel","year":"1983","unstructured":"Harel, D.: Recurring dominoes: Making the highly undecidable highly understandable (preliminary report). In: Karpinski, M. (ed.) FCT 1983. LNCS, vol.\u00a0158, pp. 177\u2013194. Springer, Heidelberg (1983)"},{"issue":"2","key":"34_CR12","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1305\/ndjfl\/1040046086","volume":"37","author":"E. Hemaspaandra","year":"1996","unstructured":"Hemaspaandra, E.: The price of universality. Notre Dame Journal of Formal Logic\u00a037(2), 174\u2013203 (1996)","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/62212.62224","volume-title":"STOC 1988: Proceedings of the 20th Annual ACM Symposium on Theory of Computing","author":"J. Halpern","year":"1988","unstructured":"Halpern, J., Moses, Y., Tuttle, M.: A knowledge-based analysis of zero knowledge. In: STOC 1988: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 132\u2013147. ACM Press, New York (1988)"},{"key":"34_CR14","unstructured":"Hemaspaandra, E., Schnoor, H.: On the complexity of elementary modal logics. In: Albers, S., Weil, P. (eds.) STACS, Germany, LIPIcs, vol.\u00a01, pp. 349\u2013360. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2008)"},{"key":"34_CR15","unstructured":"Hemaspaandra, E., Schnoor, H.: A simplest undecidable modal logic. CoRR, abs\/1105.0845 (2011)"},{"issue":"7","key":"34_CR16","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.jcss.2009.10.011","volume":"76","author":"E. Hemaspaandra","year":"2010","unstructured":"Hemaspaandra, E., Schnoor, H., Schnoor, I.: Generalized modal satisfiability. J. Comput. Syst. Sci.\u00a076(7), 561\u2013578 (2010)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"34_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0022-0000(89)90039-1","volume":"38","author":"J. Halpern","year":"1989","unstructured":"Halpern, J., Vardi, M.: The complexity of reasoning about knowledge and time. I. Lower bounds. J. Comput. Syst. Sci.\u00a038(1), 195\u2013237 (1989)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"34_CR18","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 of Computation\u00a06(3), 467\u2013480 (1977)","journal-title":"SIAM Journal of Computation"},{"key":"34_CR19","first-page":"207","volume-title":"TARK","author":"R. Ladner","year":"1986","unstructured":"Ladner, R., Reif, J.: The logic of distributed protocols. In: Halpern, J.Y. (ed.) TARK, pp. 207\u2013222. Morgan Kaufmann, San Francisco (1986)"},{"key":"34_CR20","unstructured":"Moody, J.: Modal logic as a basis for distributed computation. Technical Report CMU-CS-03-194, School of Computer Science, Carnegie Mellon University (October 2003)"},{"issue":"6","key":"34_CR21","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1093\/logcom\/11.6.909","volume":"11","author":"M. Reynolds","year":"2001","unstructured":"Reynolds, M., Zakharyaschev, M.: On the products of linear modal logics. J. Log. Comput.\u00a011(6), 909\u2013931 (2001)","journal-title":"J. Log. Comput."},{"key":"34_CR22","first-page":"241","volume-title":"TARK","author":"E. Spaan","year":"1990","unstructured":"Spaan, E.: Nexttime is not necessary. In: Parikh, R. (ed.) TARK, pp. 241\u2013256. Morgan Kaufmann, San Francisco (1990)"},{"key":"34_CR23","unstructured":"Spaan, E.: Complexity of Modal Logics. PhD thesis, Department of Mathematics and Computer Science, University of Amsterdam (1993)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_34.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:10:14Z","timestamp":1606187414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}