Semantics for some non-classical possibilistic logics

摘要

Possibilistic logic was developed as an approach to automated reasoning. The standard possibilistic expressions are classical logic formulas associated with weights. Intuitionistic logic and paraconsistent logics have proved to be useful in knowledge representation, because of their constructive and inconsistent, but non-trivial nature, respectively. Possibilistic intuitionistic logic has already been defined and some of its syntactic properties have been proved. This paper continues in that direction, defining the possibilistic C_ω logic and presenting some syntactic results as well as suitable Kripke and topological semantics to both of these logics. It also provides a topological semantics for the C_ω logic via closed subsets and the closure operator.