Dyadic semantics for many-valued logics
Carlos Caleiro, Walter Alexandre Carnielli, Marcelo E. Coniglio, João Marcos · 2003
This paper obtains an effective method which assigns two-valued semantics to every finite-valued truth-functional logic (in the direction of the so-called "Suszko's Thesis"), provided that its truth-values can be individualized by means of its linguistic resources. Such two-valued semantics permit us to obtain new tableau proof systems for a wide class of finite-valued logics, including the main many-valued paraconsistent logics.