We define an embedding from the lattice of extensions ofT into the lattice of extensions of the bimodal logic with two monomodal operators □1 and □2, whose □2-fragment isS5 and □1-fragment is the logic of a two-element chain. This embedding reflects the fmp, decidability, completenes and compactness. It follows that the lattice of extension of a bimodal logic can be rather complicated even if the monomodal fragments of the logic belong to the upper part of the lattice of monomodal logics.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
F. Bellisima,On the Lattice of Extensions of the Modal Logic K. Alt n Arch. Math Logic 27 pp. 107–114, 1988.
W. Blok,The Lattice of Modal Logics: An algebraic Investigation Journal of Symbolic Logic 45 pp. 221–236, 1980.
R. Bull,That all normal extensions of S4.3have the finite model property,Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 12 pp. 341 -344, 1966.
K. Fine,Logics containing K4, Part I Journal of Symbolic Logic 39 pp. 229–237, 1974.
K. Fine,Normal Forms in Modal Logic,Notre Dame Journal of Formal Logic 16 pp. 31–36, 1975.
M. Kracht &F. Wolter,Properties of independently axiomatizable bimodal logics Journal of Symbolic Logic 56 pp. 469–485, 1991.
K. Segerberg,Modal Logics with Functional Alternative Relations Notre Dame Journal of Formal Logic 27 pp. 504–522, 1986.
About this article
Cite this article
Wolter, F. What is the upper part of the lattice of bimodal logics?. Stud Logica 53, 235–241 (1994). https://doi.org/10.1007/BF01054711
- Mathematical Logic
- Computational Linguistic
- Bimodal Logic
- Monomodal Logic