Paradeduction in Axiomatic Formal Systems

The concept of paradeduction is presented in order to justify that we can overlook contradictory information taking into account only what is consistent. Besides that, paradeduction is used to show that there is a way to transform any logic, introduced as an axiomatic formal system, into a paraconsistent one

Paraconsistentization and many-valued logics

This paper shows how to transform explosive many-valued systems into paraconsistent logics. We investigate especially the case of three-valued systems showing how paraconsistent three-valued logics can be obtained from them

Conjunctive and Disjunctive Limits: Abstract Logics and Modal Operators

Departing from basic concepts in abstract logics, this paper introduces two concepts: conjunctive and disjunctive limits. These notions are used to formalize levels of modal operators

A dynamic model for balancing values

Published: 27 July 2021We propose an additive model for balancing the impacts of actions on values, where factors intensify or attenuate impacts on values, and values are assigned degrees of relative importance (weights). The balancing model induces axiological rules, consisting in prohibitions or permissions that are justified according to the impacts of the prohibited or permitted action on the values at stake. We also propose eight different revision operators, which shift the balance - and thus induce different norms - by expanding or contracting either the set of factors or the set of values. We provide the construction and prove some success properties of those operators

Definability in Infinitary Languages and Invariance by Automorphisms

Given a $\mathcal L_{\alpha\beta} ^E$-structure $E$, where $\mathcal L_{\alpha\beta} ^E$ is an infinitary language, we show that $\alpha$ and $\beta$ can be chosen in such way that every orbit of the group $G$ of automorphisms of $E$ is $\mathcal L_{\alpha\beta} ^E$-definable. It follows that two sequences of elements of the domain $D$ of $E$ satisfy the same set of $\mathcal L_{\alpha\beta}$-formulas if and only if they are in the same orbit of $G$

Paraconsistent orbits of logics

Some strategies to turn any logic into a paraconsistent system are examined. In the environment of universal logic, we show how to paraconsistentize logics at the abstract level using a transformation in the class of all abstract logics called paraconsistentization by consistent sets . Moreover, by means of the notions of paradeduction and paraconsequence we go on applying the process of changing a logic converting it into a paraconsistent system. We also examine how this transformation can be performed using multideductive abstract logics. To conclude, the conceptual notion paraconsistent orbit of a logic is proposed