All Nitely Axiomatizable Subframe Logics Containing the Provability Logic Csm 0 Are Decidable
نویسنده
چکیده
In this paper we investigate those extensions of the bimodal provability logicCSM0 (alias PRL1 or F ) which are subframe logics, i.e. whose general frames are closed under a certain type of substructures. Most bimodal provability logics are in this class. The main result states that all nitely axiomatizable subframe logics containing CSM0 are decidable. We note that, as a rule, interesting systems in this class do not have the nite model property and are not even complete with respect to Kripke semantics. Mathematics Subject Classi cation: 03B45, 03B25.
منابع مشابه
All finitely axiomatizable subframe logics containing the provability logic CSM 0_{0} are decidable
In this paper we investigate those extensions of the bimodal provability logic CSM 0 (alias PRL 1 or F ?) which are subframe logics, i.e. whose general frames are closed under a certain type of substructures. Most bimodal provability logics are in this class. The main result states that all nitely axiomatizable subframe logics containing CSM 0 are decidable. We note that, as a rule, interesting...
متن کاملFrame Based Formulas for Intermediate Logics
In this paper we define the notion of frame based formulas. We show that the well-known examples of formulas arising from a finite frame, such as the Jankov-de Jongh formulas, subframe formulas and cofinal subframe formulas, are all particular cases of the frame based formulas. We give a criterion for an intermediate logic to be axiomatizable by frame based formulas and use this criterion to ob...
متن کاملCanonical Formulas for Wk4
We generalize the theory of canonical formulas for K4 (the logic of transitive frames) to wK4 (the logic of weakly transitive frames). Our main result establishes that each logic over wK4 is axiomatizable by canonical formulas, thus generalizing Zakharyaschev’s theorem for logics over K4. The key new ingredients include the concepts of transitive and strongly cofinal subframes of weakly transit...
متن کاملCofinal Stable Logics
We generalize the (∧,∨)-canonical formulas of [3] to (∧,∨)-canonical rules, and prove that each intuitionistic multi-conclusion consequence relation is axiomatizable by (∧,∨)-canonical rules. This provides an intuitionistic analogue of [6], and is an alternative of [19]. It also yields a convenient characterization of stable superintuitionistic logics introduced in [3]. The (∧,∨)-canonical form...
متن کاملCanonical formulas via locally finite reducts and generalized dualities
Axiomatizability, the finite model property (FMP), and decidability are some of the most frequently studied properties of non-classical logics. One of the first general methods of axiomatizing large classes of superintuitionistic logics (si-logics for short) was developed by Jankov [8]. For each finite subdirectly irreducible Heyting algebra A, Jankov designed a formula that encodes the structu...
متن کامل