Notre Dame Journal of Formal Logic

Bimodal Logics with a “Weakly Connected” Component without the Finite Model Property

Agi Kurucz

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

There are two known general results on the finite model property (fmp) of commutators [L0,L1] (bimodal logics with commuting and confluent modalities). If L is finitely axiomatizable by modal formulas having universal Horn first-order correspondents, then both [L,K] and [L,S5] are determined by classes of frames that admit filtration, and so they have the fmp. On the negative side, if both L0 and L1 are determined by transitive frames and have frames of arbitrarily large depth, then [L0,L1] does not have the fmp. In this paper we show that commutators with a “weakly connected” component often lack the fmp. Our results imply that the above positive result does not generalize to universally axiomatizable component logics, and even commutators without “transitive” components such as [K3,K] can lack the fmp. We also generalize the above negative result to cases where one of the component logics has frames of depth one only, such as [S4.3,S5] and the decidable product logic S4.3×S5. We also show cases when already half of commutativity is enough to force infinite frames.

Article information

Source
Notre Dame J. Formal Logic, Volume 58, Number 2 (2017), 287-299.

Dates
Received: 9 May 2014
Accepted: 14 October 2014
First available in Project Euclid: 9 March 2017

Permanent link to this document
https://projecteuclid.org/euclid.ndjfl/1489028416

Digital Object Identifier
doi:10.1215/00294527-3870247

Mathematical Reviews number (MathSciNet)
MR3634982

Zentralblatt MATH identifier
06751304

Subjects
Primary: 03B45: Modal logic (including the logic of norms) {For knowledge and belief, see 03B42; for temporal logic, see 03B44; for provability logic, see also 03F45}
Secondary: 03B62: Combined logics 03B44: Temporal logic

Keywords
multimodal logic finite model property linear orders

Citation

Kurucz, Agi. Bimodal Logics with a “Weakly Connected” Component without the Finite Model Property. Notre Dame J. Formal Logic 58 (2017), no. 2, 287--299. doi:10.1215/00294527-3870247. https://projecteuclid.org/euclid.ndjfl/1489028416


Export citation

References

  • [1] Blackburn, P., M. de Rijke, and Y. Venema, Modal Logic, vol. 53 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge, 2001.
  • [2] Bull, R. A., “That all normal extensions of ${\mathrm{S}}4.3$ have the finite model property,” Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 12 (1966), pp. 341–44.
  • [3] Chagrov, A., and M. Zakharyaschev, “The undecidability of the disjunction property of propositional logics and other related problems,” Journal of Symbolic Logic, vol. 58 (1993), pp. 967–1002.
  • [4] Chagrov, A., and M. Zakharyaschev, Modal Logic, vol. 35 of Oxford Logic Guides, Clarendon Press, New York, 1997.
  • [5] Fine, K., and G. Schurz, “Transfer theorems for stratified modal logics,” pp. 169–213 in Logic and Reality: Essays on the Legacy of Arthur Prior, edited by J. Copeland, Oxford University Press, New York, 1996.
  • [6] Gabbay, D. M., A. Kurucz, F. Wolter, and M. Zakharyaschev, Many-Dimensional Modal Logics: Theory and Applications, vol. 148of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 2003.
  • [7] Gabbay, D. M., and V. Shehtman, “Products of modal logics, I,” Logic Journal of the IGPL, vol. 6 (1998), pp. 73–146.
  • [8] Gabelaia, D., “Topological, algebraic and spatio-temporal semantics for multi-dimensional modal logics,” Ph.D. dissertation, King’s College London, London, 2004.
  • [9] Gabelaia, D., A. Kurucz, F. Wolter, and M. Zakharyaschev, “Products of ‘transitive’ modal logics,” Journal of Symbolic Logic, vol. 70 (2005), pp. 993–1021.
  • [10] Goldblatt, R., Logics of Time and Computation, vol. 7 in CSLI Lecture Notes, Stanford University, Center for the Study of Language and Information, Stanford, Calif., 1987.
  • [11] Hampson, C., and A. Kurucz, “Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting,” ACM Transactions on Computational Logic, vol. 16 (2015), art. 27, 1–36.
  • [12] Hampson, C., and A. Kurucz, “Axiomatisation problems of modal product logics with the difference operator,” preprint, 2014.
  • [13] Kracht, M., and F. Wolter, “Properties of independently axiomatizable bimodal logics,” Journal of Symbolic Logic, vol. 56 (1991), pp. 1469–85.
  • [14] Kurucz, A., “Combining modal logics,” pp. 869–924 in Handbook of Modal Logic, edited by P. Blackburn, J. van Benthem, and F. Wolter, vol. 3 of Studies in Logic and Practical Reasoning, Elsevier, Amsterdam, 2007.
  • [15] Kurucz, A., and S. Marcelino, “Non-finitely axiomatisable two-dimensional modal logics,” Journal of Symbolic Logic, vol. 77 (2012), pp. 970–86.
  • [16] Marx, M., and M. Reynolds, “Undecidability of compass logic,” Journal of Logic and Computation, vol. 9 (1999), pp. 897–914.
  • [17] Reynolds, M., “A decidable temporal logic of parallelism,” Notre Dame Journal of Formal Logic, vol. 38 (1997), pp. 419–36.
  • [18] Reynolds, M., and M. Zakharyaschev, “On the products of linear modal logics,” Journal of Logic and Computation, vol. 11 (2001), pp. 909–31.
  • [19] Segerberg, K., An Essay in Classical Modal Logic, vol. 13 of Filosofiska Studier, Filosofiska Föreningen och Filosofiska Institutionen vid Uppsala Universitet, Uppsala, 1971.
  • [20] Shehtman, V., “Filtration via bisimulation,” pp. 289–308 in Advances in Modal Logic, Vol. 5, edited by R. Schmidt, I. Pratt-Hartmann, M. Reynolds, and H. Wansing, King’s College Publications, London, 2005.
  • [21] Shehtman, V., “Canonical filtrations and local tabularity,” pp. 498–512 in Advances in Modal Logic, Vol. 10, edited by R. Goré, B. Kooi, and A. Kurucz, College Publications, Milton Keynes, United Kingdom, 2014.
  • [22] Spaan, E., “Complexity of modal logics,” Ph.D. dissertation, Department of Mathematics and Computer Science, University of Amsterdam, Amsterdam, 1993.
  • [23] Wolter, F., “The product of converse PDL and polymodal K,” Journal of Logic and Computation, vol. 10 (2000), pp. 223–51.
  • [24] Wolter, F., and M. Zakharyaschev, “Modal decision problems,” pp. 427–89 in Handbook of Modal Logic, edited by P. Blackburn, J. van Benthem, and F. Wolter, vol. 3 of Studies in Logic and Practical Reasoning, Elsevier, Amsterdam, 2007.