Algorithms for recognizing restricted interpolation over the modal logic S4
From MaRDI portal
Publication:2123084
DOI10.1134/S0037446622020070OpenAlexW4225983143MaRDI QIDQ2123084
Veta Fedorovna Yun, Larisa L. Maksimova
Publication date: 8 April 2022
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0037446622020070
interpolationmodal logicdecidabilityamalgamationrecognizabilitynonclassical logicscharacteristic formulas
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weak interpolation in extensions of the logics S4 and K4
- Interpolation theorems in modal logics and amalgamable varieties of topological Boolean algebras
- A lattice of normal modal logics
- Finite-level modal logics
- Intuitionistic logic and implicit definability
- Restricted interpolation over modal logic S4
- Projective Beth property in extensions of Grzegorczyk logic
- Classification of extensions of the modal logic S4
- Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
- A weak form of interpolation in equational logic
- Problem of restricted interpolation in superintuitionistic and some modal logics
- An ascending chain of S4 logics
- Definability in Normal Extensions of S4