On triangular norm based axiomatic extensions of the weak nilpotent minimum logic
MetadataShow full item record
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 DOUBLE-STRUCK CAPITAL W]ℕ[MATHEMATICAL DOUBLE-STRUCK CAPITAL M]) and prove
that it is locally finite, so all its subvarieties are generated by finite chains. We give criteria to compare varieties generated by finite families of WNM-chains, in particular varieties generated by standard WNM-chains, or equivalently t-norm based axiomatic extensions of WNM, and we study their standard completeness properties. We also characterize the generic WNM-chains, i. e. those that generate the variety [MATHEMATICAL DOUBLE-STRUCK CAPITAL W]ℕ[MATHEMATICAL DOUBLE-STRUCK CAPITAL M], and we give finite axiomatizations for some t-norm based extensions of WNM.
Is part ofMathematical Logic Quarterly, 2008, vol. 54, núm. 4, p. 387-409
Showing items related by title, author, creator and subject.
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 ...
Horcık, Rostislav; Noguera, Carles; Petrık, Milan (Wiley, 2007)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 ...
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 ...