Involutive uninorm logic with the \(n\)-potency axiom (Q2450645): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.fss.2012.09.009 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2039022935 / rank | |||
Normal rank |
Revision as of 01:17, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Involutive uninorm logic with the \(n\)-potency axiom |
scientific article |
Statements
Involutive uninorm logic with the \(n\)-potency axiom (English)
0 references
14 May 2014
0 references
Uninorms are binary operations in the real unit interval which make it into a commutative ordered monoid. The involutive uninorm logic IUL has an algebraic semantics given by the class of all chains among the commutative residuated lattice-ordered semigroups over a bounded lattice. The author proves the standard completeness theorem for \(C_n\)-IUL, i.e.\ the axiomatic extension of IUL by the \(n\)-potency axiom \(A^n\leftrightarrow A^{n-1}\). That means, he proves that already the class of all those commutative residuated ordered semigroups over [0,1] gives an adequate semantics for \(C_n\)-IUL, which satisfy the \(n\)-potency condition \(x^n = x^{n-1}\) for the iteration of the semigroup operation. To reach this goal, he generalizes some methods for the construction of left continuous t-norms to uninorms.
0 references
fuzzy logics
0 references
uninorm logics
0 references
semilinear logics
0 references
completeness theorem
0 references
standard completeness
0 references
\(n\)-potency axiom
0 references