All finitely axiomatizable subframe logics containing the provability logic CSM are decidable

Authors: 
Wolter, Frank
Year: 
1997
Language: 
English
Abstract: 
In this paper we investigate those extensions of the bimodal provability logic CSM0 (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 finitely axiomatizable subframe logics containing CSM0 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.
Appeared / Erschienen in: 
Archive in Mathematical logic (wird erscheinen)
Pubdate / Erscheinungsdatum: 
1997
Pages / Seitenanzahl: 
18
AttachmentSize
1997-37.pdf221.83 KB