Axiomatization and completeness of lexicographic products of modal logics
Pages 165 - 180
Abstract
This paper sets out a new way of combining Kripke-complete modal logics: lexicographic product. It discusses some basic properties of the lexicographic product construction and proves axiomatization/completeness results.
References
[1]
Balbiani, P.: Time representation and temporal reasoning from the perspective of non-standard analysis. In: Brewka, G., Lang, J. (eds.) Eleventh International Conference on Principles of Knowledge Representation and Reasoning. Association for the Advancement of Artificial Intelligence, pp. 695-704 (2008).
[2]
Balbiani, P.: Axiomatization and completeness of lexicographic products of modal logics (long version). Research Report IRIT/RR-2009-20-FR+ of the Institut de recherche en informatique de Toulouse (2009).
[3]
Balbiani, P.: Lexicographic products of modal logics with linear frames (to appear).
[4]
Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001).
[5]
Van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Springer, Heidelberg (2007).
[6]
Euzenat, J., Montanari, A.: Time granularity. In: Fisher, M., Gabbay, D., Vila, L. (eds.) Handbook of Temporal Reasoning in Artificial Intelligence, pp. 59-118. Elsevier B.V., Amsterdam (2005).
[7]
Fagin, R., Halpern, J., Moses, Y., Vardi, M.: Reasoning About Knowledge. MIT Press, Cambridge (1995).
[8]
Fine, K.: The logics containing S4.3. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 17, 371-376 (1971).
[9]
Gabbay, D., Kurucz, A., Wolter, F., Zakharyaschev, M.: Many-Dimensional Modal Logics: Theory and Applications. Elsevier B.V., Amsterdam (2003).
[10]
Gabbay, D., Shehtman, V.: Products of modal logics, part 1. Logic Journal of the IGPL 6, 73-146 (1998).
[11]
Hemaspaandra, E.: The price of universality. Notre Dame Journal of Formal Logic 37, 174-203 (1996).
[12]
Kurucz, A.: Combining modal logics. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logic, pp. 869-924. Elsevier B.V., Amsterdam (2007).
[13]
Ladner, R.: The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing 6, 467-480 (1977).
[14]
Nagle, M.: The decidability of normal K5 logics. Journal of Symbolic Logic 46, 319-328 (1981).
[15]
Nagle, M., Thomason, S.: The extensions of the modal logic K5. Journal of Symbolic Logic 50, 102-109 (1985).
[16]
Oztürk, M., Tsoukiàs, A., Vincke, P.: Preference modelling. In: Figueira, J., Greco, S., Ehrgott, M. (eds.) Multiple Criteria Decision Analysis, pp. 27-71. Springer, Heidelberg (2005).
[17]
Palanque, P., Paternò, F. (eds.): Formal Methods in Human-Computer Interaction. Springer, Heidelberg (1998).
[18]
Wolter, F.: Fusions of modal logics revisited. In: Kracht, M., de Rijke, M., Wansing, H., Zakharyaschev, M. (eds.) Advances in Modal Logic, pp. 361-379. CSLI Publications, Stanford (1998).
Recommendations
Labelled Sequent Calculi for Inquisitive Modal Logics
Logic, Language, Information, and ComputationAbstractWe present cut-free labelled sequent calculi for various systems of inquisitive modal logic, including inquisitive epistemic logic and inquisitive doxastic logic. Inquisitive modal logic extends the framework of standard modal logic with a ...
Hypersequent Calculi for Modal Logics Extending S4
New Frontiers in Artificial IntelligenceAbstractIn this paper, we introduce hypersequent calculi for some modal logics extending S4 modal logic. In particular, we uniformly characterize hypersequent calculi for S4, S4.2, S4.3, S5 in terms of what are called “external modal structural rules” for ...
Elementary Definability and Completeness in General and Positive Modal Logic
The paper generalises Goldblatt's completeness proof for Lemmon–Scott formulas to various modal propositional logics without classical negation and without ex falso , up to positive modal logic, where conjunction and disjunction, and where necessity and ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 16 September 2009
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 1Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 21 Nov 2024
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in