Simulating polyadic modal logics by monadic ones
Goguadze, George ; Piazza, Carla ; Venema, Yde
J. Symbolic Logic, Tome 68 (2003) no. 1, p. 419- 462 / Harvested from Project Euclid
We define an interpretation of modal languages with polyadic operators in modal languages that use monadic operators (diamonds) only. We also define a simulation operator which associates a logic $\simL$ in the diamond language with each logic $\La$ in the language with polyadic modal connectives. We prove that this simulation operator transfers several useful properties of modal logics, such as finite/recursive axiomatizability, frame completeness and the finite model property, canonicity and first-order definability.
Publié le : 2003-06-14
Classification: 
@article{1052669058,
     author = {Goguadze, George and Piazza, Carla and Venema, Yde},
     title = {Simulating polyadic modal logics by monadic ones},
     journal = {J. Symbolic Logic},
     volume = {68},
     number = {1},
     year = {2003},
     pages = { 419- 462},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1052669058}
}
Goguadze, George; Piazza, Carla; Venema, Yde. Simulating polyadic modal logics by monadic ones. J. Symbolic Logic, Tome 68 (2003) no. 1, pp.  419- 462. http://gdmltest.u-ga.fr/item/1052669058/