Spelling suggestions: "subject:"logic, kripke semantics,"" "subject:"logic, ripke semantics,""
1 |
All finitely axiomatizable subframe logics containing the provability logic CSM are decidableWolter, Frank 12 October 2018 (has links)
In this paper we investigate those extensions of the bimodal provability logic C⃗ SM0 (alias P⃗ RL1 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 finitely axiomatizable subframe logics containing C⃗ SM0 are decidable. We note that, as a rule, interesting systems in this class do not have the finite model property and are not even complete with respect to Kripke semantics.
|
Page generated in 0.0729 seconds