Curry systems for algebraisation of some non-classical logics
Jair Minoro Abe, Kazumi Nakamatsu
Abstract
Jair Minoro Abe, Kazumi Nakamatsu
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.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Curry, Computer science, Calculus (dental), Mathematics, Programming language, Medicine, Dentistry