Properties of independently axiomatizable bimodal logics
From MaRDI portal
Publication:3984418
DOI10.2307/2275487zbMath0743.03013OpenAlexW2081329681MaRDI QIDQ3984418
Publication date: 27 June 1992
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.545.428
interpolationpersistencecompletenesscompactnessfinite model propertytransferHalldén- completenessindependently axiomatizable bimodal logicmonomodal fragments
Related Items
What is the upper part of the lattice of bimodal logics? ⋮ Towards resolution-based reasoning for connected logics ⋮ Splittings and the finite model property ⋮ Updating knowledge using subsets ⋮ Orthogonal frames and indexed relations ⋮ The structure of lattices of subframe logics ⋮ The finite model property in tense logic ⋮ On combined connectives ⋮ A new combination procedure for the word problem that generalizes fusion decidability results in modal logics ⋮ Completeness and decidability of tense logics closely related to logics above K4 ⋮ Finite model property in weakly transitive tense logics ⋮ Frames for fusions of modal logics ⋮ An analytic tableau calculus for a temporalised belief logic ⋮ Preservation of Craig interpolation by the product of matrix logics ⋮ Distributed knowability and Fitch's paradox ⋮ Craig interpolation in the presence of unreliable connectives ⋮ PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS ⋮ Modal logics that need very large frames ⋮ Grafted frames and S1 -completeness ⋮ On combinations of propositional dynamic logic and doxastic modal logics ⋮ Modal languages and bounded fragments of predicate logic ⋮ Editors' introduction to the special issue on combining logics ⋮ The price of universality ⋮ Combining temporal logic systems ⋮ On logics with coimplication ⋮ Metatheory of actions: beyond consistency ⋮ COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS ⋮ Fibred semantics and the weaving of logics. Part 1: Modal and intuitionistic logics ⋮ REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION ⋮ Adding a temporal dimension to a logic system ⋮ \({\mathcal E}\)-connections of abstract description systems
Cites Work
