| Abstrakt: |
The main result of this paper is the following theorem: each modal logic extending K4 having the branching property below m and the effective m-drop point property is decidable with respect to admissibility. A similar result is obtained for intermediate intuitionistic logics with the branching property below m and the strong effective m-drop point property. Thus, general algorithmic criteria which allow to recognize the admissibility of inference rules for modal and intermediate logics of the above kind are found. These criteria are applicable to most modal logics for which decidability with respect to admissibility is known and to many others, for instance, to the modal logics K4, K4.1, K4.2, K4.3, S4.1, S4.2, GL.2; to all smallest and greatest counterparts of intermediate Gabbay-De-Jong logics D; to all intermediate Gabbay-De-Jong logics D; to all finitely axiomatizable modal and intermediate logics of finite depth etc. Semantic criteria for recognizing admissibility for these logics are offered as well. [ABSTRACT FROM AUTHOR] |
Full text from SpringerLink