Fixpointed Idempotent Uninorm ( Based ) Logics

Idempotent uninorms are simply defined by fixpointed negations. These uninorms, called here fixpointed idempotent uninorms, have been extensively studied because of their simplicity, whereas logics characterizing such uninorms have not. Recently, fixpointed uninorm mingle logic (fUML) was introduced, and its standard completeness, i.e., completeness on real unit interval [0, 1], was proved by Baldi and Ciabattoni. However, their proof is not algebraic and does not shed any light on the algebraic feature by which an idempotent uninorm is characterized, using operations defined by a fixpointed negation. To shed a light on this feature, this paper algebraically investigates logics based on fixpointed idempotent uninorms. First, several such logics are introduced as axiomatic extensions of uninorm mingle logic (UML). The algebraic structures corresponding to the systems are then defined, and the results of the associated algebraic completeness are provided. Next, standard completeness is established for the systems using an Esteva–Godo-style approach for proving standard completeness.


Introduction
Uninorms are a special kind of associative and commutative aggregation operators allowing an identity in unit interval [0, 1].They were introduced by Yager and Rybalov in Reference [1], characterizing their structure along with Fodor [2].Since then, these kinds of operators have been extensively investigated due to their special interest from a theoretical and applicative point of view.As mentioned in Reference [3], these operators are theoretically interesting because of their structure, a special combination of a t-norm and a t-conorm, and also applicatively interesting due to their practicality in applications, e.g., aggregation in general [1,4], expert systems [5], and fuzzy system modeling [6,7].
Uninorms are divided into conjunctive and disjunctive, which are used as logical connectives modeling conjunction AND and disjunction OR operators.They are also divided into left-continuous and right-continuous uninorms, where the left-continuous ones are used as logical connectives modeling implication operators.In particular, conjunctive left-continuous uninorms are very important from a logical point of view because they give rise to standard algebraic semantics, i.e., algebraic semantics on [0, 1], for fuzzy logics: Several uninorm (based) logics characterizing the classes of conjunctive left-continuous uninorms have recently been introduced.For instance, weakening-free uninorm (based) logics, Uninorm Logic (UL), Involutive Uninorm Logic (IUL), Uninorm Mingle Logic (UML), and Involutive Uninorm Mingle Logic (IUML) have been introduced by Metcalfe (and Montagna) [8,9] as substructural fuzzy logics, 'substructural' in the sense that they lack various structural rules such as weakening or contraction and 'fuzzy' in the sense that they are complete with respect to (w.r.t.) linearly ordered algebras or matrices.Among them, UL is the most basic uninorm logic, which is the logic of conjunctive left-continuous uninorms and their residua.
This paper is a contribution to the study of substructural fuzzy logics characterized by idempotent uninorms, defined by fixpointed negations, called here fixpointed idempotent uninorms.In general, a function n : [0, 1] → [0, 1] is said to be a negation function if and only if (iff) it is nonincreasing and satisfies n(0) = 1 and n(1) = 0.This definition works on t-norms very well, but not as well on uninorms because, e.g., a nonincreasing function n may not satisfy n(1) = 0 in (conjunctive) uninorms.Thus, we henceforth call a nonincreasing function a negation function.In this paper, a negation function (briefly stated as negation) n satisfying n(n(x)) ≥ x for all x ∈ [0, 1] is said to be a superinvolutive negation; a superinvolutive negation n is called a weak negation if n further satisfies n(0) = 1 and n(1) = 0; a weak negation n is called a strong negation (or involutive negation) if n further satisfies n(n(x)) = x for all x ∈ [0, 1].In strong negations on [0, 1], n(x) may be defined as 1 − x (the so-called 'standard' negation), because strong negations on [0, 1] are all isomorphic (see Reference [22]).We in particular call a negation fixpointed if it has a fixpoint.By Brouwer's fixed-point theorem, every continuous negation on the [0, 1] interval is fixpointed.
For the past fifteen years, idempotent uninorms and, in particular, conjunctive left-continuous idempotent uninorms, have been introduced and characterized [3,13,14,17,23].Furthermore, the logics based on conjunctive left-continuous idempotent uninorms have been introduced [9,24,25].For instance, not only the UML and IUML systems, mentioned above, but also the fUML system (UML with fixpoint (FP) t ↔ ¬t (= f) were introduced [25].However, to our knowledge, any other satisfactory systems that are logics of conjunctive left-continuous idempotent uninorms with superinvolutive or weak negations (in place of strong ones) introduced in References [13,14], have not yet been studied.
The purpose of this paper is to introduce logics of conjunctive left-continuous idempotent uninorms with such negations and their corresponding standard algebraic semantics, i.e., algebraic semantics based on unit interval [0, 1].We first note the following three facts.
First, although UML was proved to be the logic of conjunctive left-continuous idempotent uninorms [9], this system is unsatisfactory in that, while a (left-continuous) idempotent uninorm is characterized by a fixpointed negation by virtue of which the uninorm is defined as a combination of minimum and maximum [3,13,17], UML itself does not prove the logical principle (FP) corresponding to the fixpoint.This fact shows that 1) not UML itself but fUML has such negation, and 2) this system may be regarded as the f-free fragment of UML, where negation is defined as ϕ → t.Note that IUML is the logic of conjunctive left-continuous idempotent uninorms with any fixpointed strong negation.
Second, although the standard completeness of fUML was proved by , their study is, in a sense, unsatisfactory in that, while a (left-continuous) idempotent uninorm is algebraically defined, their completeness proof is not algebraic.Note that, following Metcalfe and Montagna's method [9], Baldi and Ciabattoni proof-theoretically showed the standard completeness of fUML by virtue of introducing and eliminating density rule.Their proof does not shed any light on the algebraic feature by which an idempotent uninorm is characterized using operations defined by a fixpointed negation.
Thirdly, although the standard completeness of some particular extensions of UML was algebraically proved by Wang [26,27] and Yang [28], their constructions were not established using the definitions obtained by fixpointed negations.Note that Wang [26,27] performed algebraic standard completeness for the n-potent uninorm and involutive uninorm logics C n UL and C n IUL, for 3 ≤ n, using Jenei-Montagna-style construction.(As Wang stated, his approach does not work for n = 2.For C 2 UL and C 2 IUL, he instead mentioned Metcalfe-Montagna's standard completeness results of UML and IUML [9]).Yang [28] also established such completeness for UL c f r (UL with compensation-free reinforcement axiom).But these approaches do not work for UML (= C 2 UL) and IUML (= C 2 IUL with FP).(For the similarities and differences between constructions of Yang and Wang's Jenei-Montagna-style, see Reference [29]).
The paper is organized as follows.In Section 2, we introduce five fixpointed idempotent uninorm (based) systems, define their corresponding algebraic structures, and prove their algebraic completeness.In Section 3, we introduce several conjunctive left-continuous fixpointed idempotent uninorms.In particular, we introduce finite matrices satisfying UML-algebras, but not having the fixpointed negation by virtue of which a conjunctive left-continuous idempotent uninorm is defined (see Example 2).In Section 4, we establish standard completeness for the systems using an Esteva-Godo-style approach for proving standard completeness of the Weak nilpotent minimum logic (WNM) and Nilpotent minimum logic (NM) systems in Reference [22].
One important feature in the Esteva and Godo's approach is that intensional conjunction and implication operators are defined by weak and strong negations.Note that intensional conjunction and implication operators for our systems are also defined by such negations.This means that one natural way to establish standard completeness for the systems is to define standard algebras by virtue of fixpointed negations.We verify this using the Esteva-Godo-style construction for proving standard completeness of the systems.

Axiomatizations
The uninorm (based) logics introduced in Reference [9] are substructural fuzzy logics.Here, we base idempotent uninorm logics on a countable propositional language with formulas Fm built inductively as usual from a set of propositional variables VAR, binary connectives →, &, ∧, ∨, and constants , ⊥, f, t, with defined connectives: df1.
We moreover define ϕ n t as ϕ t & . . .&ϕ t , n factors, where ϕ t := ϕ ∧ t, and Gödel negation −ϕ as ϕ → ⊥. (Note that t may be defined as ¬f.)We use the axiom systems in order to provide a consequence relation.
We start with the following axiomatization of UML, the most basic idempotent uninorm (based) logic introduced here.Definition 1. UML consists of the following axiom schemes and rules: Fixpointed idempotent uninorm logics are defined by extending the UML with suitable axiom schemes as follows.
Definition 2. A logic is an axiomatic extension (extension for short) of L iff it results from L by adding axiom schemes.In particular, the following are fixpointed idempotent uninorm logics extending UML:
Remark 1. Uninorm logic UL is UML minus (ID), and the multiplicative additive intuitionistic linear logic MAILL is UL minus (PL t ).
For easy reference, we let Ls be the set of fixpointed idempotent uninorm logics introduced in Definition 2.

Definition 3. Ls = {fUML, nwfUML, wfUML, DwfUML, IUML}.
A theory is a set of formulas.A proof in theory T over L ∈ Ls is a sequence s of formulas such that each element of s is either an axiom of L, a member of T, or is derivable from previous elements of s by means of a rule of L. T ϕ, more exactly T L ϕ, means that ϕ is provable in T w.r.t.L, i.e., there is an L-proof of ϕ in T. A theory T is inconsistent if T ⊥; otherwise, it is consistent.
The t-deduction theorem (DT t ) for L is as follows: Proposition 1.Let T be a theory over L ∈ Ls and ϕ, ψ be formulas.
Proof.This is just the Enthymematic Deduction Theorem (see Reference [34]).
The following formulas can be proved straightforwardly.
The proofs for the other cases are left to the interested reader.
Note that the class of pointed bounded commutative residuated lattices characterizes the system MAILL.Thus, we henceforth call such residuated lattices MAILL-algebras.
By x n , we denote x * . . .* x, n factors, and let x t := x ∧ t.

Definition 5.
(i) (UL-algebra) A UL-algebra is a MAILL-algebra satisfying: for all x, y ∈ A, (PL t A ) t ≤ (x → y) t ∨ (y → x) t .If the lattice order is linear or total, we will call it a UL-chain.(ii) (UML-algebra) A UML-algebra is a UL-algebra satisfying: for all x ∈ A, (ID A ) x * x = x.Definition 6. (L-algebras) Let ¬x := x → f and −x := x → ⊥.We say the following algebras as L-algebras.
(iii) A wfUML-algebra is a fUML-algebra satisfying: (W A ) t ≤ ¬ → ⊥. (iv) A DwfUML-algebra is a wfUML-algebra satisfying: for all x ∈ A, (DW1 An MAILL-algebra is said to be linearly ordered if the ordering of its algebra is linear, i.e., x ≤ y or y ≤ x (equivalently, x ∧ y = x or x ∧ y = y) for each pair x, y.
Definition 8. ([30]) Let A be an L-algebra, T be a theory, ϕ be a formula, and K be a class of L-algebras.
(i) (Tautology) ϕ is a t-tautology in A, briefly an A-tautology Proof.We obtain this theorem as a corollary of Theorem 3.1.8in Reference [36].
These two properties, (UML) and (fUML), show that the negation for fUML is stronger than that for UML.
In standard L-algebras, monoid operator * is a uninorm.Definition 11.A uninorm is a function • : [0, 1] 2 → [0, 1] such that, for some e ∈ [0, 1] and for all x, y, z ∈ [0, 1]: A uninorm becomes a t-norm when e = 1 and t-conorm when e = 0.A uninorm The left-continuity property of uninorms is important in the sense that left-continuous uninorms give rise to their residua, and these residua are implication operators.In other words, the left-continuity property plays an important role in establishing standard completeness for Ls as in t-norm-based logics such as MTL and IMTL.(cf.see References [22,37,38]).The operation • is said to be residuated if there is a binary function → : [0, 1] 2 → [0, 1] satisfying (RE A ) in Definition 4 (III).Then, given uninorm •, residuated implication → determined by • is defined as x → y := sup{z : x • z ≤ y} for all x, y ∈ [0, 1].Then we can show that, for any uninorm •, • and its residuated implication → form a residuated pair iff • is conjunctive and left-continuous in both arguments (cf.see Reference [39], Proposition 5.4.2).
The general form of idempotent, associative and monotonic binary operators with an identity was given by Czogala and Drewniak [40].In particular, by virtue of fixpointed negations, a detailed characterization for the cases of (conjunctive) left-continuous idempotent uninorms is given in [13] as follows.

Fact 1. ([13])
A binary operator • is a conjunctive left-continuous idempotent uninorm with identity element e ∈ (0, 1] iff there is a super-involutive non-increasing function n : [0, 1] → [0, 1] with n(e) = e and n(0) = 1 such that for all x, y ∈ [0, 1]: Recall that a nonincreasing function n is said to be a negation here.As the result in Fact 1 shows, an idempotent uninorm defined by virtue of a negation n with fixpoint n(e) = e is a special combination of minimum and maximum.

Fact 2. ([9])
ϕ is valid in all standard IUML-algebras iff ϕ is valid in the IUML-algebra A s .
Operator • s is an example of Fact 1 where • s is defined from the standard negation n s , n s (x) := 1 − x, (see Reference [23]).Similarly, an example with an involutive negation is given by De Baets [13].We call a negation n satisfying n(0) = 1 conjunctive.The following are further hitherto (un)known examples with fixpointed superinvolutive or weak negations.
For Proof (iii), we need to show that condition (d) in Example 1 is equivalent to condition (NW A ) of nwfUML-chains.For the left-to-right direction, we assume (d) and instead prove −¬x = 0. Let x = 0.Then, since ¬x = 1, we have −¬x = 0. Otherwise, by (d), we have ¬x = 0 and thus −¬x = 0.
For Proof (v), we need to show that condition ( f ) in Example 1 is equivalent to the conditions (DW1 A ) and (DW2 A ) in DwfUML-chains.For the left-to-right direction, we assume ( f ) and prove (DW1 A ) and (DW2 A ).We first note that the conditions of ( f ) ensure that the algebras satisfying ( f ) are wfUML-algebras.For (DW1 A ), it suffices to show that either x = 0, or x = 0 and x ≤ e, or x ≤ e, i.e., e < x.This is obvious from the conditions.For (DW2 A ), we need to show that min{− − x, ¬x} ≤ ¬¬x.If x = 0, we have − − x = 0.If e < x, we also have ¬x = 0. Let 0 < x ≤ e.Then, we obtain ¬x, ¬¬x = e.Therefore, the claim holds.For the right-to-left direction, we assume (DW1 A ) and (DW2 A ) and prove ( f ).If x = 0, obviously ¬x = 1.Let 0 < x ≤ e.Since (DW1 A ) implies e ≤ ¬x and (DW2 A ) implies ¬x ≤ e, we have ¬x = e.Otherwise, (DW1 A ) implies ¬x = 0. Thus, ( f ) holds.Remark 3. Proposition 3 and Fact 2 show that the negations n 1 , n 2 , n 3 , n 4 , and n s can be expressed as algebraic (in)equations for negations of L-chains (i.e., linearly ordered L-algebras) in Definition 6, corresponding to negation axioms in the fUML, nwfUML, wfUML, DwfUML, and IUML systems, respectively.
Note that negation n 1 is stronger than the negation in the UML system in the sense that the former kind of negation is not directly expressed in UML, while it is the case in fUML.Note also that negation n 4 is a special weak fixpointed negation introduced by De Baets.
The left continuity of a uninorm ensures that its corresponding residuated implication can be obtained.The following are the known facts associated to residuated implications.
(ii) [14,23] Consider fixpointed standard negation n s .Then, the corresponding residuated implication of the conjunctive left-continuous idempotent uninorm • s is given by: The corresponding residuated implications of the conjunctive left-continuous idempotent uninorms with the fixpointed negations in (i) to (iv) of Example 1 are obtained as in Fact 3.
Given a conjunctive superinvolutive negation n, i.e., a negation satisfying Conditions (b) and (c) in Example 1 (i), as a negation for UML-algebras, we may not construct a conjunctive left-continuous idempotent uninorm • defined like • 1 because linearly ordered UML-algebras on [0, 1] satisfy (UML), but not (fUML) in general (see Remark 2).We give such an example as finite matrices.

Standard Completeness
In this section, we provide standard completeness results for Ls using the Esteva-Godo-style construction in Reference [22].We first note that given a negation n i , i ∈ {1, 2, 3, 4}, in Example 1, we can define a residuated pair as follows.
Since the axioms of fUML are valid in an fUML-algebra, this algebra is an fUML-algebra as well.The proofs for the other cases are analogous.
(ii) The proof for the case of standard negation is analogous to that of the negations in (i), i.e., given standard fixpointed negation n s on [0, 1], uninorm • n s for IUML is defined as in Fact 2.Then, the corresponding residuated implication → n s is given as in (ii) of Fact 3. Furthermore, we can easily prove that ([0, 1], • n s , → n s , 1, 0, 1  2 , 1 2) is an IUML-algebra, and corresponding negation n s is the standard one.
Proof.Each proof of (i) and (ii) is analogous to that of Theorems 3 and 4, respectively, in Reference [22].
(i) Soundness is obvious.For completeness, let L ϕ.We show that there is an L-chain C and an evaluation v on C such that v(ϕ) < e.We prove the case n 1C .Let n 1C be the negation in C; take X as the finite subset of C consisting of all values v(ψ), n 1C (v(ψ)), and n 1C (n 1C (v(ψ))) for all subformulas ψ of ϕ, plus 0 C , 1 C , and e C (= ∂ C ). (Note that Proposition 2 (i) (5) ensures Define on [0, 1] the negation function n 1 as follows: It is clear that n 1 is a conjunctive superinvolutive fixpointed negation on [0, 1] and f is a morphism w.r.t.minimum, maximum, implication, and negation.Note that we take e = f (e C ).Thus, by defining the evaluation v (p) = f (v(p)) for any propositional variable p occurring in ϕ, we get v (ϕ) = f (v(ϕ)) < e, as desired.
The proofs for the other cases are analogous.Here, we just define n 2 , n 3 , and n 4 .
otherwise, i.e., if e − < x ≤ e. ( The proof of the remaining is almost the same as in the case n 1C . (ii) Soundness is obvious.For completeness, let IUML ϕ.Then, there is an IUML-chain C and an evaluation v on C such that v(ϕ) < e.Let n C be a strong negation in C; take X as the finite subset of C, whose number of elements being odd, consisting of all the values v(ψ) and n C (v(ψ)), i.e., the strong negation of v(ψ), for all subformulas ψ of ϕ together with 0 C , 1 C , and e C (= ∂ C ). Suppose that X has m + 1 elements and let X = {0 C = a 0 < a 1 < • • • < e C = ∂ C < • • • < a m = 1 C }, where e C = a m 2 and m is even.Now let f (a i ) = i m , 0 ≤ i ≤ m.It is clear that f , as a mapping from X to the set { i m : 0 ≤ i ≤ m}, is a morphism w.r.t.minimum, maximum, implication, and negation; moreover, we take e = f (e C ).Thus, defining v (p) = f (v(p)) for any propositional variable p occurring in ϕ, we get v (ϕ) = f (v(ϕ)) < e, as required.Thus, IUML ϕ iff ϕ is a tautology in all standard IUML-algebras.
Furthermore, we can show the strong standard completeness for Ls.
Theorem 3. (Strong standard completeness) Let T be a theory over L ∈ Ls, and ϕ a formula.T L ϕ iff ϕ is true in each standard L-model of T.
Proof.The left-to-right direction follows from the definition.For the right-to-left direction, let ϕ be a formula such that T L ϕ, A be a linearly ordered L-algebra, and v an evaluation in A such that v(ψ) ≥ t for all ψ ∈ T and v(ϕ) < t.Let f be the embedding of A into the standard L-algebra as in Theorem 2.Then, f • v is an evaluation into the standard L-algebra such that f • v(ψ) ≥ e and yet f • v(ϕ) < e.

Concluding Remarks
In this paper, we first introduced several fixpointed idempotent uninorm (based) systems.After defining their corresponding algebraic structures, we briefly considered algebraic completeness results for the systems.Finally, we proved their algebraic standard completeness using the Esteva-Godo-style construction for proving standard completeness.
Note that, while algebraic completeness of some predicate uninorm logics is proved in Reference [41], such completeness for the predicate logics corresponding to the propositional logics introduced in Section 2 is not yet established.Note also that, while standard completeness for some uninorm-based logics has been established using Jenei-Montagna-style construction (see References [26][27][28]), such completeness for fixpointed idempotent uninorm-based systems has not been done using this construction.These are problems left in this paper.

Definition 9 .Theorem 1 .
(L-algebra,[30]) Let A, T, and ϕ be the same as in Definition 8.A is an L-algebra if whenever ϕ is L-provable in any T (i.e., T L ϕ, L an L logic), it is a semantic consequence of T w.r.t.{A} (i.e., T |= {A} ϕ, A a corresponding L-algebra).By MOD(L), we denote the class of L-algebras; and by MOD (L), the class of linearly ordered L-algebras.Finally, we use T |= L ϕ and T |= L ϕ in place of T |= MOD(L) ϕ and T |= MOD (L) ϕ, respectively.(Strong completeness) Let T be a theory over L ∈ Ls and ϕ be a formula.T L ϕ iff T |= L ϕ iff T |= L ϕ.

Proposition 3 .
Let n 1 , n 2 , n 3 , and n 4 be the negations introduced in Example 1.
(i) Conditions (b) and (c) of negation n 1 are the conditions for the negation of a UML-chain.

For e C such that e C = a m 2 if m is even and otherwise e C = a m+1 2 ,
define on [0, 1] the nonweak fixpointed negation function n 2 as follows: Taking e = f (e C ), and letting x

( 11 ) 2 , 2 ,
For e C such that e C = a m 2 if m is even and otherwise, e C = a m+1 define on [0, 1] the weak fixpointed negation function n 3 as follows: Taking e = f (e C ), and letting x − be x − 1 m , if x ∈ { i m : 0 ≤ i ≤ m} and x = e, e if e − < x ≤ e, For e C such that e C = a m 2 if m is even and otherwise, e C = a m+1 define on [0, 1] the weak fixpointed negation function n 4 as follows: Taking e = f (e C ), n 4 (x) = x ≤ e, 0 if e < x, 1 otherwise.