eng Science and Education Publishing American Journal of Systems and Software 2014-12-08 2 6 139 145 10.12691/ajss-2-6-1 AJSS2014261 article Usó-Doménech J.L. 1 Nescolarde-Selva J. josue.selva@ua.es 1 Perez-Gonzaga S. 1 Department of Applied Mathematics, University of Alicante, Alicante, Spain 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. http://pubs.sciepub.com/ajss/2/6/1/ajss-2-6-1.pdf contradiction denier logic coordinations propositions truth value