Curry systems for algebraisation of some non-classical logics Online publication date: Sun, 26-Dec-2010
by Jair Minoro Abe, Kazumi Nakamatsu
International Journal of Reasoning-based Intelligent Systems (IJRIS), Vol. 3, No. 1, 2011
Abstract: With the appearance of several non-classical logics notably over the past decades, one natural question arises: What is the algebraic version of these logics? In this paper, we discuss some applications of the concept of Curry algebra for algebraisation of some paraconsistent, paracomplete and non-alethic logics. Such concept is also correlated with some fundamental themes in logic, such as computability, constructability, topology and many other basic branches.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Reasoning-based Intelligent Systems (IJRIS):
Login with your Inderscience username and 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