Paraconsistent Multivalued Logic and Coincidentia Oppositorum: Evaluation with Complex Numbers

Paraconsistent logic admits that the contradiction can be true. Let p be the truth values and P be a proposition. In paraconsistent logic the truth values of contradiction is . This equation has no real roots but admits complex roots . This is the result which leads to develop a multivalued logic to complex truth values. The sum of truth values being isomorphic to the vector of the plane, it is natural to relate the function V to the metric of the vector space R2. We will adopt as valuations the norms of vectors. The main objective of this paper is to establish a theory of truth-value evaluation for paraconsistent logics with the goal of using in analyzing ideological, mythical, religious and mystic belief systems.

Neutrosophic and Modal Components of Relations in Complex Systems

Semiotic components in the relations of complex systems depend on the Subject. There are two main semiotic components: Neutrosophic and Modal. Modal components are alethical and deontical. In this paper the authors applied the theory of Neutrosophy and Modal Logic to Deontical Impure Systems.

Topological structures of complex belief systems (II): Textual materialization

Mythical and religious belief systems in a social context can be regarded as a conglomeration of sacrosanct rites, which revolve around substantive values that involve an element of faith. Moreover, we can conclude that ideologies, myths and beliefs can all be analyzed in terms of systems within a cultural context. The significance of being able to define ideologies, myths and beliefs as systems is that they can figure in cultural explanations. This, in turn, means that such systems can figure in logic-mathematical analyses.

Logic-Based Outer-Approximation Algorithm for Solving Discrete-Continuous Dynamic Optimization Problems

We present an extension of the logic outer-approximation algorithm for dealing with disjunctive discrete-continuous optimal control problems whose dynamic behavior is modeled in terms of differential-algebraic equations. Although the proposed algorithm can be applied to a wide variety of discrete-continuous optimal control problems, we are mainly interested in problems where disjunctions are also present. Disjunctions are included to take into account only certain parts of the underlying model which become relevant under some processing conditions. By doing so the numerical robustness of the optimization algorithm improves since those parts of the model that are not active are discarded leading to a reduced size problem and avoiding potential model singularities. We test the proposed algorithm using three examples of different complex dynamic behavior. In all the case studies the number of iterations and the computational effort required to obtain the optimal solutions is modest and the solutions are relatively easy to find.