Translator Disclaimer
June 2003 Simulating polyadic modal logics by monadic ones
George Goguadze, Carla Piazza, Yde Venema
J. Symbolic Logic 68(2): 419-462 (June 2003). DOI: 10.2178/jsl/1052669058

Abstract

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.

Citation

Download Citation

George Goguadze. Carla Piazza. Yde Venema. "Simulating polyadic modal logics by monadic ones." J. Symbolic Logic 68 (2) 419 - 462, June 2003. https://doi.org/10.2178/jsl/1052669058

Information

Published: June 2003
First available in Project Euclid: 11 May 2003

zbMATH: 1059.03008
MathSciNet: MR1976585
Digital Object Identifier: 10.2178/jsl/1052669058

Rights: Copyright © 2003 Association for Symbolic Logic

JOURNAL ARTICLE
44 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.68 • No. 2 • June 2003
Back to Top