Truth Values in t-norm based Systems Many-valued FUZZY Logic

In t-norm based systems many-valued logic, valuations of propositions form a non-countable set: interval [0,1]. In addition, we are given a set E of truth values p, subject to certain conditions, the valuation v is v=V(p), V reciprocal application of E on [0,1]. The general propositional algebra of t-norm based many-valued logic is then constructed from seven axioms. It contains classical logic (not many-valued) as a special case. It is first applied to the case where E=[0,1] and V is the identity. The result is a t-norm based many-valued logic in which contradiction can have a nonzero degree of truth but cannot be true; for this reason, this logic is called quasi-paraconsistent

Strict paraconsistency of truth-degree preserving intuitionistic logic with dual negation

In this article we provide some results concerning a logic that results from propositional intuitionistic logic when dual negation is added in certain way, producing a paraconsistent logic that has been called da Costa Logic. In particular, we prove the finite model property and strict paraconsistency of this logic.222SI26827

Strict paraconsistency of truth-degree preserving intuitionistic logic with dual negation

In this article we provide some results concerning a logic that results from propositional intuitionistic logic when dual negation is added in certain way, producing a paraconsistent logic that has been called da Costa Logic. In particular, we prove the finite model property and strict paraconsistency of this logic.Fil: Castiglioni, José Luis. Universidad Nacional de La Plata; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata; ArgentinaFil: Ertola Biraben, Rodolfo Cristian. Universidade Estadual de Campinas; Brasi