Finite bases of admissible rules for the logic S52C
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1234)
We study bimodal logic system S52C having two modal operators □0 and □1, each of which satisfies the axioms of S5 and in addition, an axiom for commutability of modal operators: □0□1p]≡□1□0p. The main result of this paper establishes that the bimodal logic S52C and all its extensions have finite bases for admissible inference rules. We also show that even though the logic S52C is not locally finite, any proper extension of S52C is already locally finite. Moreover, the universal theory of the free algebra of any S52C-logic is decidable. It is shown also that any S52C-logic λ with the adjoined inference rule is structurally complete and that logic has the same set of theorems as the logic λ.
Unable to display preview. Download preview PDF.
© Springer-Verlag Berlin Heidelberg 1997