PP-2001-02: Simulating polyadic modal logics by monadic ones

PP-2001-02: Goguadze, G. and Piazza, C. and Venema, Y. (2001) Simulating polyadic modal logics by monadic ones. [Report]

[thumbnail of Full Text] Text (Full Text)
PP-2001-02.text.ps.gz

Download (197kB)
[thumbnail of Abstract] Text (Abstract)
PP-2001-02.abstract.txt

Download (708B)

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 in the diamond
language with each logic 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.

Keyword(s): modal logic, polyadic operators, interpretation,
simulation, transfer results

Item Type: Report
Report Nr: PP-2001-02
Series Name: Prepublication (PP) Series
Year: 2001
Date Deposited: 12 Oct 2016 14:36
Last Modified: 12 Oct 2016 14:36
URI: https://eprints.illc.uva.nl/id/eprint/44

Actions (login required)

View Item View Item