{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T12:35:14Z","timestamp":1772368514741,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":["Studia Logica"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1023\/a:1013842612702","type":"journal-article","created":{"date-parts":[[2003,3,20]],"date-time":"2003-03-20T21:15:11Z","timestamp":1048194911000},"page":"133-169","source":"Crossref","is-referenced-by-count":37,"title":["Term-Modal Logics"],"prefix":"10.1007","volume":"69","author":[{"given":"Melvin","family":"Fitting","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Thalmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Voronkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"389697_CR1","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1093\/jigpal\/8.5.653","volume":"8","author":"C. Areces","year":"2000","unstructured":"Areces, C., P. Blackburn, and M. Marx: 2000, 'The computational complexity of hybrid temporal logics', Logic Journal of the IGPL 8(5), 653-679.","journal-title":"Logic Journal of the IGPL"},{"issue":"1","key":"389697_CR2","first-page":"56","volume":"34","author":"P. Blackburn","year":"1993","unstructured":"Blackburn, P.: 1993, 'Nominal tense logic', Notre Dame Journal of Formal Logic 34(1), 56-83.","journal-title":"Notre Dame Journal of Formal Logic"},{"issue":"3","key":"389697_CR3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01049415","volume":"4","author":"P. Blackburn","year":"1993","unstructured":"Blackburn, P. and J. Seligman: 1993, 'Hybrid languages'. Journal of Logic, Language, and Information 4(3), 251-272.","journal-title":"Journal of Logic, Language, and Information"},{"issue":"4","key":"389697_CR4","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1093\/jigpal\/6.4.625","volume":"6","author":"P. Blackburn","year":"1998","unstructured":"Blackburn, P. and M. Tzakova: 1998, 'Hybrid completeness'. Logic Journal of the IGPL 6(4), 625-650.","journal-title":"Logic Journal of the IGPL"},{"issue":"1","key":"389697_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/S0747-7171(85)80027-4","volume":"1","author":"E. Eder","year":"1985","unstructured":"Eder, E.: 1985, 'Properties of substitutions and unifications'. Journal of Symbolic Computations 1(1), 31-48.","journal-title":"Journal of Symbolic Computations"},{"key":"389697_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about Knowledge","author":"R. Fagin","year":"1995","unstructured":"Fagin, R., J. Halpern, Y. Moses, and M. Vardi: 1995, Reasoning about Knowledge, Cambridge: The MIT Press."},{"key":"389697_CR7","first-page":"286","volume-title":"Ninth Annual ACM Symposium on Theory of Computing","author":"M. J. Fischer","year":"1977","unstructured":"Fischer, M. J., and R. E. Ladner: 1977, 'Propositional modal logic of programs', in: Ninth Annual ACM Symposium on Theory of Computing, New York, N.Y., pp. 286-294, ACM."},{"issue":"2","key":"389697_CR8","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M.J. Fischer","year":"1979","unstructured":"Fischer, M.J., and R.E. Ladner: 1979, 'Propositional dynamic logic of regular programs', Journal of Computer and System Sciences 18(2), 194-211.","journal-title":"Journal of Computer and System Sciences"},{"key":"389697_CR9","doi-asserted-by":"crossref","unstructured":"Fitting, M.: 1983, Proof methods for modal and intuitionistic logics, Vol. 169 of Synthese Library, Reidel Publ. Comp.","DOI":"10.1007\/978-94-017-2794-5"},{"key":"389697_CR10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF00244394","volume":"4","author":"M. Fitting","year":"1988","unstructured":"Fitting, M.: 1988, 'First-order modal tableaux', Journal of Automated Reasoning 4, 191-213.","journal-title":"Journal of Automated Reasoning"},{"key":"389697_CR11","doi-asserted-by":"crossref","unstructured":"Fitting, M., L. Thalmann, and A. Voronkov: 2000, 'Term-Modal Logics', in: R. Dyckhoff (ed.): Tableaux 2000, Vol. 1847 of Lecture Notes in Artificial Intelligence, Berlin Heidelberg, pp.220-236, Springer-Verlag.","DOI":"10.1007\/10722086_19"},{"issue":"6","key":"389697_CR12","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1007\/BF01054038","volume":"22","author":"G. Gargov","year":"1993","unstructured":"Gargov, G., and V. Goranko: 1993, 'Modal logic with names'. Journal of Philosophical Logic 22(6), 607-636.","journal-title":"Journal of Philosophical Logic"},{"key":"389697_CR13","doi-asserted-by":"crossref","unstructured":"Garson, J.: 1984, 'Quantification in modal logic', in: D. Gabbay and F. Guenther (eds.): Handbook in Philosophical Logic, Vol. II, D. Reidel Publishing Company, Chapt. II.5, pp. 249-307.","DOI":"10.1007\/978-94-009-6259-0_5"},{"key":"389697_CR14","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BF01201353","volume":"39","author":"G. Gentzen","year":"1934","unstructured":"Gentzen, G.: 1934, 'Untersuchungen \u00a8uber das logische Schlie\u00df en', Mathematical Zeitschrift 39, 176-210, 405-431. Translated as (Gentzen, 1969).","journal-title":"Mathematical Zeitschrift"},{"key":"389697_CR15","first-page":"68","volume-title":"The Collected Papers of Gerhard Gentzen","author":"G. Gentzen","year":"1969","unstructured":"Gentzen, G.: 1969, 'Investigations into logical deduction', in: M. Szabo (ed.): The Collected Papers of Gerhard Gentzen, Amsterdam: North Holland, pp. 68-131. Originally appeared as (Gentzen, 1934)."},{"key":"389697_CR16","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0004-3702(95)98593-D","volume":"74","author":"A. Grove","year":"1995","unstructured":"Grove, A.: 1995, 'Naming and identity in epistemic logics. Part II: A first-order logic for naming', Artificial Intelligence 74, 311-350.","journal-title":"Artificial Intelligence"},{"key":"389697_CR17","unstructured":"Grove, A., and J. Halpern: 1991,' Naming and identity in a multi-agent epistemic logic', in: J. Allen, R. Fikes, and E. Sandewall (eds.): KR'91. Proc. of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, Massachusets, pp. 301-312, Morgan Kaufmann."},{"key":"389697_CR18","volume-title":"Encyclopedia of Computer Science and Technology","author":"J.Y. Halpern","year":"1993","unstructured":"Halpern, J.Y.: 1993, 'Reasoning about knowledge: a survey circa 1991', in: A. Kent and J.G. Williams (eds.), Encyclopedia of Computer Science and Technology, Volume 27 (Supplement 12), New York: Marcel Dekker."},{"key":"389697_CR19","doi-asserted-by":"crossref","unstructured":"Harel, D.: 1979, First-order dynamic logic, Vol. 68 of LNCS, Springer.","DOI":"10.1007\/3-540-09237-4"},{"key":"389697_CR20","volume-title":"Knowledge and Belief","author":"J. Hintikka","year":"1962","unstructured":"Hintikka, J.: 1962, Knowledge and Belief, Ithaca, New York: Cornell University Press."},{"key":"389697_CR21","volume-title":"Handbook of Theoretical Computer Science","author":"D. Kozen","year":"1989","unstructured":"Kozen, D., and J. Tiuryn: 1989, 'Logics of programs', in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Amsterdam: North Holland."},{"key":"389697_CR22","volume-title":"Acta Philosophica Fennica","author":"W. Lenzen","year":"1978","unstructured":"Lenzen, W.: 1978, Recent work in epistemic logic, Vol. 30 of Acta Philosophica Fennica, Amsterdam: North-Holland."},{"key":"389697_CR23","doi-asserted-by":"crossref","unstructured":"Meyer, J.J.C., and W. Van der Hoek: 1995, Epistemic Logic for AI and Computer Science, No. 41 in Cambridge Tracts in Theoretical Computer Science, Cambridge University Press.","DOI":"10.1017\/CBO9780511569852"},{"issue":"2","key":"389697_CR24","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0890-5401(91)90026-X","volume":"93","author":"S. Passay","year":"1991","unstructured":"Passay, S., and T. Tinchev: 1991, 'An essay in combinatory dynamic logic', Information and Computation 93(2), 263-332.","journal-title":"Information and Computation"},{"key":"389697_CR25","doi-asserted-by":"crossref","unstructured":"Passy, S., and T. Tinchev: 1985, 'Quantifiers in combinatory PDL: completeness, definability, incompleteness', in: L. Budach (ed.): 5th International Conference on Fundamentals of Computation Theory, Vol. 199 of Lecture notes in computer science, Cottbus, GDR, pp. 512-519, Springer-Verlag.","DOI":"10.1007\/BFb0028835"},{"key":"389697_CR26","doi-asserted-by":"crossref","unstructured":"Pratt, V.R.: 1976, 'Semantical considerations on Floyd-Hoare Logic', in: 17th Annual Symposium on Foundations of Computer Science, pp. 109-121.","DOI":"10.1109\/SFCS.1976.27"},{"key":"389697_CR27","doi-asserted-by":"crossref","unstructured":"Ryan, M., J. Fiadeiro, and T. Maibaum: 1991, 'Sharing actions and attributes in modal action logic', in: T. Ito and A.R. Meyer (eds.), Theoretical Aspects of Computer Software, Vol. 526 of Lecture Notes in Computer Science. pp. 569-593, Springer-Verlag.","DOI":"10.1007\/3-540-54415-1_65"},{"key":"389697_CR28","unstructured":"Sch\u00d1tte, K.: 1960, Beweistheorie (in German), Springer Verlag."},{"key":"389697_CR29","doi-asserted-by":"crossref","first-page":"828","DOI":"10.1073\/pnas.49.6.828","volume":"49","author":"R. Smullyan","year":"1963","unstructured":"Smullyan, R.: 1963, 'A unifying principle in quantification theory', in: Proc. Nat. Acad. Sci. U.S.A., Vol. 49. pp. 828-832.","journal-title":"Proc. Nat. Acad. Sci. U.S.A."},{"key":"389697_CR30","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-48754-9_24","volume-title":"Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-99)","author":"M. Tzakova","year":"1999","unstructured":"Tzakova, M.: 1999, 'Tableau calculi for hybrid logics', in: N.V. Murray (ed.): Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX-99), Vol. 1617 of LNAI, Berlin, pp. 278-292, Springer."},{"key":"389697_CR31","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-1-4613-1139-3_2","volume-title":"Epistemic Logic and the Theory of Games and Decisions","author":"W. van der Hoek","year":"1997","unstructured":"van der Hoek, W., and J.J.C. Meyer: 1997, 'A complete epistemic logic for multiple agents-Combining Distributed and Common Knowledge', in: M. Bacharach, L. Gerard-Varet, P. Mongin, and H. Shin (eds.), Epistemic Logic and the Theory of Games and Decisions, Dordrecht: Kluwer Academic Publishers, pp. 35-68."},{"key":"389697_CR32","doi-asserted-by":"crossref","unstructured":"Voronkov, A.: 1996, 'Proof search in intuitionistic logic based on constraint satisfaction', in: P. Miglioli, U. Moscato, D. Mundici, and M. Ornaghi (eds.): Theorem Proving with Analytic Tableaux and Related Methods. 5th International Workshop, TABLEAUX '96, Vol. 1071 of Lecture Notes in Artificial Intelligence, Terrasini, Palermo Italy, pp. 312-329.","DOI":"10.1007\/3-540-61208-4_20"},{"key":"389697_CR33","unstructured":"Wallen, L.: 1990, Automated Deduction in Nonclassical Logics, The MIT Press."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013842612702.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013842612702\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013842612702.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:18:59Z","timestamp":1754630339000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013842612702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["389697"],"URL":"https:\/\/doi.org\/10.1023\/a:1013842612702","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"value":"0039-3215","type":"print"},{"value":"1572-8730","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}