A map of dependencies among three-valued logics
نویسندگان
چکیده
منابع مشابه
A map of dependencies among three-valued logics
Three-valued logics arise in several fields of computer science, both inspired by concrete problems (such as in the management of the null value in databases) and theoretical considerations. Several three-valued logics have been defined. They differ by their choice of basic connectives, hence also from a syntactic and proof-theoretic point of view. Different interpretations of the third truth v...
متن کاملExploiting Data Dependencies in Many-Valued Logics
The purpose of this paper is to make some practically relevant results in automated theorem proving available to many-valued logics with suitable modifications. We are working with a notion of many-valued first-order clauses which any finitely-valued logic formula can be translated into and that has been used several times in the literature, but in an ad hoc way. We give a many-valued version o...
متن کاملMaximally Paraconsistent Three-Valued Logics
Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain from classical logic as much as possible. In this paper, we introduce the strongest possible notion of maximal paraconsistency, and investigate it in the context of logics that are based on deterministic or non-deterministic three-valued matrices. We ...
متن کاملInterpolation and Three-valued Logics
We consider propositional logic. Three-valued logics are old: the first one is Lukasiewicz three valued logic from 1920 [8]. Gödel in [5] from 1932 studied a hierarchy of finite-valued logics, containing Gödel three-valued logic. Our main interest pays to Kleene three-valued logic [6]. Other threevalued logics will not be considered here. Let us agree that the three truth values are 0, 1 2 , 1 ...
متن کاملForeword: Three-valued logics and their applications
Three-valued logics belong to a family of nonclassical logics that started to flourish in the 1920s and 1930s, following the work of ( Lukasiewicz, 1920), and earlier insights coming from Frege and Peirce (see (Frege, 1879), (Frege, 1892), (Fisch and Turquette, 1966)). All of them were moved by the idea that not all sentences need be True or False, but that some sentences can be indeterminate i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2013
ISSN: 0020-0255
DOI: 10.1016/j.ins.2013.06.040