The fusion Ll ? Lr of two normal modal logics formulated in languages with disjoint sets of modal operators is the smallest normal modal logic containing Ll [ Lr. This paper proves that decidability, interpolation, uniform interpolation, and Halld?encompleteness are preserved under forming fusions of normal polyadic polymodal logics. Those problems remained open in [Fine & Schurz [3]] and [Kracht & Wolter [10]]. The paper defines the fusion `l ? `r of two classical modal consequence relations and proves that decidability transfers also in this case. Finally, these results are used to prove a general decidability result for modal logics based on superintuitionistic logics.
Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:31880 |
Date | 11 October 2018 |
Creators | Wolter, Frank |
Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
Language | English |
Detected Language | English |
Type | doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text |
Rights | info:eu-repo/semantics/openAccess |
Relation | 157586102X |
Page generated in 0.0022 seconds