Advanced search
Start date
Betweenand


Modal (in)completeness by finite Nmatrices

Full text
Author(s):
Newton Marques Peron
Total Authors: 1
Document type: Doctoral Thesis
Press: Campinas, SP.
Institution: Universidade Estadual de Campinas (UNICAMP). Instituto de Filosofia e Ciências Humanas
Defense date:
Examining board members:
Marcelo Esteban Coniglio; Cezar Augusto Mortari; Luis Fariñas del Cerro; Marcelo Finger; Walter Alexandre Carnielli
Advisor: Marcelo Esteban Coniglio
Abstract

This is a study on the feasibility of finite matrices as semantics for modal logics. We separate our analysis into two cases: deterministic and non-deterministic matrices. In the first case, we generalize Dugundji's Incompleteness Theorem, ensuring that a wide family of modal logic cannot be characterized by deterministic finite matrices. In the second, we extend the non-deterministic matrices semantics to modal logics proposed independently by Kearns and Ivlev. This extension embraces modal systems that, according to our generalization, cannot be characterized by finite deterministic matrices (AU)

FAPESP's process: 09/10239-5 - Studies on advanced paraconsistent modal logic
Grantee:Newton Marques Peron
Support Opportunities: Scholarships in Brazil - Doctorate