Interval-valued algebras and fuzzy logics

In this chapter, we present a propositional calculus for several interval-valued fuzzy logics, i.e., logics having intervals as truth values. More precisely, the truth values are preferably subintervals of the unit interval. The idea behind it is that such an interval can model imprecise information. To compute the truth values of ‘p implies q’ and ‘p and q’, given the truth values of p and q, we use operations from residuated lattices. This truth-functional approach is similar to the methods developed for the well-studied fuzzy logics. Although the interpretation of the intervals as truth values expressing some kind of imprecision is a bit problematic, the purely mathematical study of the properties of interval-valued fuzzy logics and their algebraic semantics can be done without any problem. This study is the focus of this chapter

Fredkin Gates for Finite-valued Reversible and Conservative Logics

The basic principles and results of Conservative Logic introduced by Fredkin and Toffoli on the basis of a seminal paper of Landauer are extended to d-valued logics, with a special attention to three-valued logics. Different approaches to d-valued logics are examined in order to determine some possible universal sets of logic primitives. In particular, we consider the typical connectives of Lukasiewicz and Godel logics, as well as Chang's MV-algebras. As a result, some possible three-valued and d-valued universal gates are described which realize a functionally complete set of fundamental connectives.Comment: 57 pages, 10 figures, 16 tables, 2 diagram

Non-deterministic algebraization of logics by swap structures1

Multialgebras have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing with several Logics of Formal Inconsistency that cannot be semantically characterized by a single finite matrix. In particular, these LFIs are not algebraizable by the standard tools of abstract algebraic logic. In this paper, the first steps towards a theory of non-deterministic algebraization of logics by swap structures are given. Specifically, a formal study of swap structures for LFIs is developed, by adapting concepts of universal algebra to multialgebras in a suitable way. A decomposition theorem similar to Birkhoff’s representation theorem is obtained for each class of swap structures. Moreover, when applied to the 3-valued algebraizable logics J3 and Ciore, their classes of algebraic models are retrieved, and the swap structures semantics become twist structures semantics. This fact, together with the existence of a functor from the category of Boolean algebras to the category of swap structures for each LFI, suggests that swap structures can be seen as non-deterministic twist structures. This opens new avenues for dealing with non-algebraizable logics by the more general methodology of multialgebraic semantics