Term-Modal Logics

Studia Logica

Volumn 69, Issue 1, 2001, Pages 133-169

  Fitting, Melvin ^a   Thalmann, Lars ^b   Voronkov, Andrei ^c  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b UPPSALA UNIVERSITY   (Sweden)

^c UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Completeness; Epistemic logic; Modal logic; Multi agents; Tableaux

Indexed keywords

EID: 22944435730     PISSN: 00393215     EISSN: 15728730     Source Type: Journal    
DOI: 10.1023/A:1013842612702     Document Type: Article

References (33)

1. ARECES, C., P. BLACKBURN, and M. MARX: 2000, 'The computational complexity of hybrid temporal logics', Logic Journal of the IGPL 8(5), 653-679.
2. BLACKBURN, P.: 1993, 'Nominal tense logic', Notre Dame Journal of Formal Logic 34(1), 56-83.
3. BLACKBURN, P. and J. SELIGMAN: 1993, 'Hybrid languages'. Journal of Logic, Language, and Information 4(3), 251-272.
4. BLACKBURN, P. and M. TZAKOVA: 1998, 'Hybrid completeness'. Logic Journal of the IGPL 6(4), 625-650.
5. EDER, E.: 1985, 'Properties of substitutions and unifications'. Journal of Symbolic Computations 1(1), 31-48.
6. FAGIN, R., J. HALPERN, Y. MOSES, and M. VARDI: 1995, Reasoning about Knowledge, Cambridge: The MIT Press.
7. FISCHER, M. J., and R. E. LADNER: 1977, 'Prepositional modal logic of programs', in: Ninth Annual ACM Symposium on Theory of Computing, New York, N.Y., pp. 286-294, ACM.
8. FISCHER, M. J., and R. E. LADNER: 1979, 'Prepositional dynamic logic of regular programs', Journal of Computer and System Sciences 18(2), 194-211.
9. FITTING, M.: 1983, Proof methods for modal and intuitionistic logics, Vol. 169 of Synthese Library, Reidel Publ. Comp.
10. FITTING, M.: 1988, 'First-order modal tableaux', Journal of Automated Reasoning 4, 191-213.
11. 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.
12. GARGOV , G., and V. GORANKO: 1993, 'Modal logic with names'. Journal of Philosophical Logic 22(6), 607-636.
13. CARSON, 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.
14. GENTZEN, G.: 1934, 'Untersuchungen über das logische Schlieβen', Mathematical Zeitschrift 39, 176-210, 405-431. Translated as (Gentzen, 1969).
15. 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).
16. GROVE, A.: 1995, 'Naming and identity in epistemic logics. Part II: A first-order logic for naming', Artificial Intelligence 74, 311-350.
17. 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.
18. 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.
19. HAREL, D.: 1979, First-order dynamic logic, Vol. 68 of LNCS, Springer.
20. HlNTIKKA, J.: 1962, Knowledge and Belief, Ithaca, New York: Cornell University Press.
21. KOZEN, D., and J. TlURYN: 1989, 'Logics of programs', in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Amsterdam: North Holland.
22. LENZEN, W.: 1978, Recent work in epistemic logic, Vol. 30 of Acta Philosophica Fennica, Amsterdam: North-Holland.
23. 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.
24. PASSAY, S., and T. TINCHEV: 1991, 'An essay in combinatory dynamic logic', Information and Computation 93(2), 263-332.
25. PASSY, S., and T. TlNCHEV: 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.
26. PRATT, V.R.: 1976, 'Semantical considerations on Floyd-Hoare Logic', in: 17th Annual Symposium on Foundations of Computer Science, pp. 109-121.
27. 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.
28. SCHÜTTE, K.: 1960, Beweistheorie (in German), Springer Verlag.
29. SMULLYAN, R.: 1963, 'A unifying principle in quantification theory', in: Proc. Nat. Acad. Sci. U.S.A., Vol. 49. pp. 828-832.
30. 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.
31. 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. Gérard-Varet, P. Mongin, and H. Shin (eds.), Epistemic Logic and the Theory of Games and Decisions, Dordrecht: Kluwer Academic Publishers, pp. 35-68.
32. 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.
33. WALLEN, L.: 1990, Automated Deduction in Nonclassical Logics, The MIT Press.