Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Dugundji’s Theorem Revisited|
|Abstract:||In 1940 Dugundji proved that no system between S1 and S5 can be characterized by finite matrices. Dugundji’s result forced the development of alternative semantics, in particular Kripke’s relational semantics. The success of this semantics allowed the creation of a huge family of modal systems. With few adaptations, this semantics can characterize almost the totality of the modal systems developed in the last five decades. This semantics however has some limits. Two results of incompleteness (for the systems KH and VB) showed that not every modal logic can be characterized by Kripke frames. Besides, the creation of non-classical modal logics puts the problem of characterization of finite matrices very far away from the original scope of Dugundji’s result. In this sense, we will show how to update Dugundji’s result in order to make precise the scope and the limits of many-valued matrices as semantic of modal systems. A brief comparison with the useful Chagrov and Zakharyaschev’s criterion of tabularity for modal logics is provided.|
|Editor:||Birkhauser Verlag AG|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.