{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T04:41:58Z","timestamp":1790743318100,"version":"4.1.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,4,1]],"date-time":"2005-04-01T00:00:00Z","timestamp":1112313600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Stud Logica"],"published-print":{"date-parts":[[2005,4]]},"DOI":"10.1007\/s11225-005-3612-9","type":"journal-article","created":{"date-parts":[[2005,6,8]],"date-time":"2005-06-08T08:12:21Z","timestamp":1118218341000},"page":"373-407","source":"Crossref","is-referenced-by-count":51,"title":["The Undecidability of Iterated Modal Relativization"],"prefix":"10.1007","volume":"79","author":[{"given":"Joseph S.","family":"Miller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lawrence S.","family":"Moss","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"3612_CR1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/B:SYNT.0000024912.56773.5e","volume":"139","author":"BALTAG","year":"2004","unstructured":"BALTAG, ALEXANDRU, and LAWRENCE S. MOSS, \u2018Logics for epistemic programs\u2019, Synthese 139, no. 2, (2004), 165\u2013224.","journal-title":"Synthese"},{"key":"3612_CR2","unstructured":"BALTAG, ALEXANDRU, LAWRENCE S. MOSS, and S\u0141LAWOMIR SOLECKI, \u2018The logic of common knowledge, public announcements, and private suspicions\u2019, Proceedings of TARK\u2013VII (Theoretical Aspects of Rationality and Knowledge), 1998."},{"key":"3612_CR3","unstructured":"BALTAG, ALEXANDRU, LAWRENCE S. MOSS, and S\u0141LAWOMIR SOLECKI, Revised version of [2], to appear."},{"key":"3612_CR4","doi-asserted-by":"crossref","unstructured":"BERGER, ROBERT, The Undecidability of the Domino Problem, Memoirs of the American Mathematical Society No. 66, 1966.","DOI":"10.1090\/memo\/0066"},{"key":"3612_CR5","doi-asserted-by":"crossref","unstructured":"BLACKBURN, PATRICK, MAARTEN DE RIJKE, and YDE VENEMA, Modal Logic, Cambridge Tracts in Theoretical Computer Science, vol. 53, Cambridge University Press, 2001.","DOI":"10.1017\/CBO9781107050884"},{"key":"3612_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59207-2","volume-title":"The Classical Decision Problem","author":"B\u00d6RGER","year":"1997","unstructured":"B\u00d6RGER, EGON, ERICH GR\u00c4DEL, and YURI GUREVICH, The Classical Decision Problem, Springer-Verlag, Berlin, 1997."},{"key":"3612_CR7","unstructured":"DAWAR, ANUJ, ERICH GR\u00c4DEL, and STEPHAN KREUTZER, \u2018Infiationary fixed points in modal logic\u2019, ACM Transactions on Computational Logic, to appear."},{"key":"3612_CR8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"DERSHOWITZ","year":"1982","unstructured":"DERSHOWITZ, NACHUM, \u2018Orderings for term-rewriting systems\u2019, Theoretical Computer Science 17 (1982), 279\u2013301.","journal-title":"Theoretical Computer Science"},{"key":"3612_CR9","first-page":"67","volume-title":"Models, Algebras, and Proofs (Bogot, 199), Lecture Notes in Pure and Applied Mathematics, vol. 203","author":"FLUM","year":"1999","unstructured":"FLUM, JORG, \u2018On the (infinite) model theory of fixed-point logics\u2019, in Models, Algebras, and Proofs (Bogot, 199), Lecture Notes in Pure and Applied Mathematics, vol. 203, Marcel Dekker, New York, 1999, pp. 67\u201375."},{"key":"3612_CR10","unstructured":"GERBRANDY, JELLE, \u2018Dynamic epistemic logic\u2019, in Lawrence S. Moss, et al., (eds.), Logic, Language, and Information, vol. 2, CSLI Publications, Stanford University, 1999."},{"key":"3612_CR11","unstructured":"GERBRANDY, JELLE, Bisimulations on Planet Kripke, Ph.D. dissertation, University of Amsterdam, 1999."},{"key":"3612_CR12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1023\/A:1008222603071","volume":"6","author":"GERBRANDY","year":"1997","unstructured":"GERBRANDY, JELLE, and WILLEM GROENEVELD, \u2018Reasoning about information change\u2019, Journal of Logic, Language, and Information 6 (1997), 147\u2013169.","journal-title":"Journal of Logic, Language, and Information"},{"key":"3612_CR13","doi-asserted-by":"crossref","unstructured":"GR\u00c4DEL, ERICH, and STEPHAN KREUTZER, \u2018Will defiation lead to depletion?\u2019, On non-monotone fixed-point inductions, IEEE Conference on Logic in Computer Science (LICS\u201903), pp. 158\u2013167.","DOI":"10.1109\/LICS.2003.1210055"},{"key":"3612_CR14","doi-asserted-by":"crossref","unstructured":"HAREL, DAVID, \u2018Recurring dominoes: making the highly undecidable highly understandable\u2019, Topics in the Theory of Computation (Borgholm, 1983), North-Holland Math. Stud., 102, North-Holland, Amsterdam, 1985, pp. 51\u201371.","DOI":"10.1016\/S0304-0208(08)73075-5"},{"key":"3612_CR15","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2516.001.0001","volume-title":"Dynamic Logic","author":"HAREL","year":"2000","unstructured":"HAREL, DAVID, DEXTER C. KOZEN, and J. TIURYN, Dynamic Logic, MIT Press, Cambridge Mass., 2000."},{"issue":"4","key":"3612_CR16","first-page":"721","volume":"B5","author":"LIN","year":"1984","unstructured":"LIN, YU CAI, \u2018The decision problems about the periodic solutions of the domino problems\u2019, Chinese Annals of Mathematics, Series B 5, no. 4, (1984), 721\u2013726.","journal-title":"Chinese Annals of Mathematics, Series"},{"key":"3612_CR17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.4064\/fm-82-1-39-83","volume":"82","author":"MOSCHOVAKIS","year":"1974\u201375","unstructured":"MOSCHOVAKIS, YIANNIS N., \u2018On nonmonotone inductive definability\u2019, Fundamenta Mathematicae 82 (1974\u201375), 39\u201383.","journal-title":"Fundamenta Mathematicae"},{"key":"3612_CR18","unstructured":"PLAISTED, DAVID A., \u2018Termination orderings\u2019, in D. Gabbay, et al. (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, vol. I, pp. 273\u2013364."},{"key":"3612_CR19","unstructured":"PLAZA, JAN, \u2018Logics of public communications\u2019, Proceedings, 4th International Symposium on Methodologies for Intelligent Systems, 1989."},{"key":"3612_CR20","unstructured":"VAN BENTHEM, JOHAN, \u2018 \u2018One is a lonely number\u2019: on the logic of communication\u2019, ILLC Research Report PP\u20132003\u201307, Amsterdam, 2003."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-005-3612-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11225-005-3612-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-005-3612-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T14:53:30Z","timestamp":1735743210000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11225-005-3612-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,4]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,4]]}},"alternative-id":["3612"],"URL":"https:\/\/doi.org\/10.1007\/s11225-005-3612-9","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"value":"0039-3215","type":"print"},{"value":"1572-8730","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,4]]}}}