Semantics for some non-classical possibilistic logics
by Rubén Octavio Vélez-Salazar; José Ramón Enrique Arrazola-Ramírez; Iván Martínez-Ruiz
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 6, No. 3, 2014

Abstract: 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.

Online publication date: Wed, 29-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com