On n-contractive fuzzy logics
MetadataShow full item record
It is well known that MTL satisfies the finite embeddability property. Thus MTL is complete w. r. t. the class of all finite MTL-chains. In order to reach a deeper understanding of the structure of this class, we consider the extensions of MTL by adding the generalized contraction since each finite MTL-chain satisfies a form of this generalized contraction. Simultaneously, we also consider extensions of MTL by the generalized excluded middle laws introduced in  and the axiom of weak cancellation defined in . The algebraic counterpart of these logics is studied characterizing the subdirectly irreducible, the semisimple, and the simple algebras. Finally, some important algebraic and logical properties of the considered logics are discussed: local finiteness, finite embeddability property, finite model property, decidability, and standard completeness.
Is part ofMathematical Logic Quarterly, 2007, vol. 53, núm. 3, p. 268-288
European research projects
Showing items related by title, author, creator and subject.
Noguera, Carles; Esteva, Francesc; Gispert, Joan (Wiley, 2008)In this paper we carry out an algebraic investigation of the weak nilpotent minimum logic (WNM) and its t-norm based axiomatic extensions. We consider the algebraic counterpart of WNM, the variety of WNM-algebras ([MATHEMATICAL ...
Noguera, Carles; Esteva, Francesc; Gispert, Joan; Godó, Lluís (Elsevier, 2007)In this paper we study generic expansions of logics of continuous t-norms with truth-constants, taking advantage of previous results for Łukasiewicz logic and more recent results for Gödel and Product logics. Indeed, we ...
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification Alsinet, Teresa; Chesñevar, Carlos Iván; Godo i Lacasa, Lluís; Sandri, Sandra; Simari, Guillermo Ricardo (Elsevier, 2008)Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the ...