We will present all the mixed and impure disjoint three-valued logics based on the Strong Kleene schema. Some, but not all of them, are (inferentially) empty logics, while one of them is trivial. We will compare them ...

In 1986, Mikenberg et al. introduced the semantic notion of quasi-truth defined by means of partial structures. In such structures, the predicates are seen as triples of pairwise disjoint sets: the set of tuples which ...

Three important results about the expressivity of a modal logic L are the Characterization Theorem (that identifies a modal logic L as a fragment of a better known logic), the Definability Theorem (that provides conditions ...

Three important results about the expressivity of a modal logic L are the Characterization Theorem (that identifies a modal logic L as a fragment of a better known logic), the Definability theorem (that provides conditions ...

This paper proposes a solver-friendly model for disjoint, non-smooth, and nonconvex optimal power flow (OPF) problems. The conventional OPF problem is considered as a nonconvex and highly nonlinear problem for which finding ...

The design algorithm for binary reversible circuits based on the decomposition of permutations as cascade of disjoint cycles (CD algorithm) is extended to the ternary domain. Its performance is evaluated using as a benchmark ...