<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Isotone L-bonds</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jan Konecny</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Manuel Ojeda-Aciego</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Dept. Matema ́tica Aplicada</institution>
          ,
          <addr-line>Univ. Ma ́laga</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>University Palacky Olomouc</institution>
          ,
          <country country="CZ">Czech Republic</country>
        </aff>
      </contrib-group>
      <fpage>153</fpage>
      <lpage>162</lpage>
      <abstract>
        <p>L-bonds represent relationships between formal contexts. We study properties of these intercontextual structures w.r.t. isotone conceptforming operators in fuzzy setting. We also focus on the direct product of two formal fuzzy contexts and show conditions under which a bond can be obtained as an intent of the product. In addition, we show that the previously studied properties of their antitone counterparts can be easily derived from the present results.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>Formal Concept Analysis (FCA) has become a very active research topic, both
theoretical and practical, for formally describing structural and hierarchical
properties of data with “object-attribute” character. It is this wide applicability
which justifies the need of a deeper knowledge of its underlying mechanisms: and
one important way to obtain this extra knowledge turns out to be via
generalization and abstraction.</p>
      <p>
        A number of different approaches have presented towards a generalization
of the framework and scope of FCA and, nowadays, one can find papers which
extend the theory by using ideas from rough set theory [
        <xref ref-type="bibr" rid="ref14 ref15 ref21">21, 15, 14</xref>
        ], possibility
theory [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], fuzzy set theory [
        <xref ref-type="bibr" rid="ref1 ref2">1, 2</xref>
        ], the multi-adjoint framework [
        <xref ref-type="bibr" rid="ref16 ref17 ref19">16, 17, 19</xref>
        ] or
heterogeneous approaches [
        <xref ref-type="bibr" rid="ref18 ref6">6, 18</xref>
        ].
      </p>
      <p>
        Goguen argued in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] that concepts should be studied transversally,
transcending the natural boundaries between sciences and humanities, and proposed
category theory as a unifying language capable of merging different apparently
disparate approaches. Krotzsch [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] suggested a categorical treatment of
morphisms, understood as fundamental structuring blocks, in order to model, among
other applications, data translation, communication, and distributed computing.
      </p>
      <p>
        In this paper, we deal with an extremely general form of L-fuzzy Formal
Concept Analysis, based on categorical constructs and L-fuzzy sets. Particularly,
our approach originated in relation to a previous work [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] on the notion of Chu
correspondences between formal contexts, which led to obtaining information
about the structure of L-bonds in such a generalized framework.
c paper author(s), 2013. Published in Manuel Ojeda-Aciego, Jan Outrata (Eds.): CLA
2013, pp. 153{162, ISBN 978{2{7466{6566{8, Laboratory L3i, University of La
Rochelle, 2013. Copying permitted only for private and academic purposes.
      </p>
      <p>In this paper, we study properties of L-bonds w.r.t. isotone concept-forming
operators in a fuzzy setting. We also focus on the direct product of two formal
fuzzy contexts and show conditions under which a bond can be obtained as an
extent of the product. In addition, we show that the previously studied properties
of their antitone counterparts can be easily derived from the present results.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Preliminaries</title>
      <p>We use complete residuated lattices as basic structures of truth-degrees. A
complete residuated lattice is a structure L “ xL, ^, _, b, Ñ, 0, 1y such that
(i) xL, ^, _, 0, 1y is a complete lattice, i.e. a partially ordered set in which
arbitrary infima and suprema exist;
(ii) xL, b, 1y is a commutative monoid, i.e. b is a binary operation which is
commutative, associative, and a b 1 “ a for each a P L;
(iii) b and Ñ satisfy adjointness, i.e. a b b ď c iff a ď b Ñ c.
0 and 1 denote the least and greatest elements. The partial order of L is denoted
by ď. Throughout this work, L denotes an arbitrary complete residuated lattice.</p>
      <p>Elements a of L are called truth degrees. Operations b (multiplication) and
Ñ (residuum) play the role of (truth functions of) “fuzzy conjunction” and
“fuzzy implication”. Furthermore, we define the complement of a P L as
a “ a Ñ 0</p>
      <p>An L-set (or fuzzy set) A in a universe set X is a mapping assigning to each
x P X some truth degree Apxq P L where L is a support of a complete residuated
lattice. The set of all L-sets in a universe X is denoted LX , or LX if the structure
of L is to be emphasized.</p>
      <p>The operations with L-sets are defined componentwise. For instance, the
intersection of L-sets A, B P LX is an L-set A X B in X such that pA X Bqpxq “
Apxq^Bpxq for each x P X, etc. An L-set A P LX is also denoted tApxq{x | x P Xu.
If for all y P X distinct from x1, x2, . . . , xn we have Apyq “ 0, we also write
tApx1q{x1, Apx2q{x1, . . . , Apxnq{xnu.</p>
      <p>An L-set A P LX is called crisp if Apxq P t0, 1u for each x P X. Crisp
Lsets can be identified with ordinary sets. For a crisp A, we also write x P A for
Apxq “ 1 and x R A for Apxq “ 0. An L-set A P LX is called empty (denoted by
H) if Apxq “ 0 for each x P X. For a P L and A P LX , the L-sets a b A P LX ,
a Ñ A ,A Ñ a, and A in X are defined by
pa b Aqpxq “ a b Apxq,
pa Ñ Aqpxq “ a Ñ Apxq,
pA Ñ aqpxq “ Apxq Ñ a,</p>
      <sec id="sec-2-1">
        <title>Apxq “ Apxq Ñ 0.</title>
        <p>(1)
(2)
(3)
(4)
An L-set A P LX is called an a-complement if A “ a Ñ B for some B P LX .</p>
        <p>Binary L-relations (binary fuzzy relations) between X and Y can be thought
of as L-sets in the universe X ˆ Y . That is, a binary L-relation I P LXˆY
between a set X and a set Y is a mapping assigning to each x P X and each
y P Y a truth degree Ipx, yq P L (a degree to which x and y are related by I).</p>
        <p>The composition operators are defined by
pA ˝ Bqpx, yq “ ł Apx, f q b Bpf, yq,</p>
        <p>fPF
pA Ž Bqpx, yq “ ľ Apx, f q Ñ Bpf, yq,</p>
        <p>fPF
pA Ż Bqpx, yq “ ľ Bpf, yq Ñ Apx, f q.</p>
        <p>fPF</p>
        <p>An L-context is a triplet xX, Y, Iy where X and Y are (ordinary) sets and
I P LXˆY is an L-relation between X and Y . Elements of X are called objects,
elements of Y are called attributes, I is called an incidence relation. Ipx, yq “ a
is read: “The object x has the attribute y to degree a.”</p>
        <p>Consider the following pairs of operators induced by an L-context xX, Y, Iy.
First, the pair xÒ, Óy of operators Ò : LX Ñ LY and Ó : LY Ñ LX is defined by
CÒpyq “
ľ Cpxq Ñ Ipx, yq,
xPX</p>
        <p>DÓpxq “
ľ Dpyq Ñ Ipx, yq.
yPY
Second, the pair xX, Yy of operators X : LX Ñ LY and Y : LY Ñ LX is defined
by</p>
        <p>CXpyq “
C^pyq “
ł Cpxq b Ipx, yq,
xPX</p>
      </sec>
      <sec id="sec-2-2">
        <title>DYpxq “</title>
        <p>ľ Ipx, yq Ñ Dpyq,
yPY
ľ Ipx, yq Ñ Cpxq,
xPX</p>
        <p>D_pxq “
ł Dpyq b Ipx, yq,
yPY
Third, the pair x^, _y of operators ^ : LX Ñ LY and _ : LY Ñ LX is defined
by
(6)
(7)
(8)
(9)
(10)
(11)
for C P LX , D P LY .</p>
        <p>To emphasize that the operators are induced by I, we also denote the
operators by xÒI , ÓI y, xXI , YI y, and x^I , _I y. Furthermore, denote the corresponding
sets of fixpoints by BpXÒ, Y Ó, Iq, BpXX, Y Y, Iq, and BpX^, Y _, Iq, i.e.</p>
        <p>BpXÒ, Y Ó, Iq “ txC, Dy P LX ˆ LY | CÒ “ D, DÓ “ Cu,
BpXX, Y Y, Iq “ txC, Dy P LX ˆ LY | CX “ D, DY “ Cu,</p>
        <p>BpX^, Y _, Iq “ txC, Dy P LX ˆ LY | C^ “ D, D_ “ Cu.</p>
        <p>The sets of fixpoints are complete lattices, called L-concept lattices associated
to I, and their elements are called formal concepts.</p>
        <p>For a concept lattice BpXM, Y O, Iq, where xM, Oy is either of xÒ, Óy, xX, Yy, or
x^, _y, denote the corresponding sets of extents and intents by ExtpXM, Y O, Iq
and IntpXM, Y O, Iq. That is,</p>
        <p>ExtpXM, Y O, Iq “ tC P LX | xC, Dy P BpXM, Y O, Iq for some Du,
IntpXM, Y O, Iq “ tD P LY | xC, Dy P BpXM, Y O, Iq for some Cu,
A system of L-sets V Ď LX is called an L-interior system if
– V is closed under b-multiplication, i.e. for every a P L and C P V we have
a b C P V ;
– V is closed under union, i.e. for Cj P V (j P J ) we have ŤjPJ Cj P V .</p>
        <p>V Ď LX is called an L-closure system if
– V is closed under left Ñ-multiplication (or Ñ-shift), i.e. for every a P L and
C P V we have a Ñ C P V (here, a Ñ C is defined by pa Ñ Cqpiq “ a Ñ Cpiq
for i “ 1, . . . , n);
– V is closed under intersection, i.e. for Cj P V (j P J ) we have ŞjPJ Cj P V .
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Weak L-bonds</title>
      <p>This section introduces some new notions studied in this work. To begin with,
we introduce the notion of weak L-bonds as a convenient generalization of bond.
Definition 1. A weak L-bond between two L-contexts K1 “ xX1, Y1, I1y and
K2 “ xX2, Y2, I2y w.r.t. xX, Yy is an L-relation β P LX1ˆY2 s.t.</p>
      <p>ExtpX1X, Y2Y, βq Ď ExtpX1X, Y1Y, I1q</p>
      <p>and IntpX1X, Y2Y, βq Ď IntpX2X, Y2Y, I2q.</p>
      <p>This notion can be put in relation with that of i-morphism.</p>
      <p>Definition 2. A mapping h : V Ñ W from an L-interior system V Ď LX
into an L-interior system W Ď LY is called an i-morphism if it is a b- and
Ž-morphism, i.e. if
– hpa b Cq “ a b hpCq for each a P L and C P V ;
– hpŽkPK Ckq “ ŽkPK hpCkq for every collection of Ck P V (k P K).
An i-morphism h : V Ñ W is said to be an extendable i-morphism if h can
be extended to an i-morphism of LX to LY , i.e. if there exists an i-morphism
h1 : LX Ñ LY such that for every C P V we have h1pCq “ hpCq;</p>
      <sec id="sec-3-1">
        <title>The following results will be used hereafter.</title>
        <p>
          Lemma 1 ([
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]).
1. For V Ď LX , if h : V Ñ LY is an extendable i-morphism then there exists
an L-relation A P LXˆY such that hpCq “ C ˝ A for every C P LY .
2. Let A P LXˆY , the mapping hA : LX Ñ LY defined by hApCq “ C ˝A “ CXA
is an extendable i-morphism.
3. Consider two contexts xX, Y, Iy and xF, Y, By. Then, we have IntpXX, Y Y, Iq Ď
        </p>
        <p>IntpF X, Y Y, Bq if and only if there exists A P LXˆF such that I “ A ˝ B,
4. Consider two contexts xX, Y, Iy and xX, F, Ay. Then, we have ExtpXX, Y Y, Iq Ď</p>
        <p>ExtpXX, F Y, Aq if and only if there exists B P LF ˆY such that I “ A ˝ B.
Theorem 1. The weak L-bonds between K1 “ xX1, Y1, I1y and K2 “ xX2, Y2, I2y
are in one-to-one correspondence with extendable i-morphisms IntpX1X, Y1Y, I1q
to IntpX2X, Y2Y, I2q.</p>
        <p>Proof. We show procedures to obtain the i-morphism from a weak L-bond and
vice versa.</p>
        <p>“ñ”: Let β be a weak L-bond between K1 “ xX1, Y1, I1y and K2 “ xX2, Y2, I2y.
By Definition 1 we have IntpX1X, Y2Y, βq Ď IntpX2X, Y2Y, I2q; thus by Lemma 1(3)
there exists Si P LY1ˆY2 such that β “ I1 ˝ Si. The induced opeator XSi is an
extendable i-morphism IntpX1X, Y1Y, I1q to IntpX2X, Y2Y, I2q by Lemma 1(2).</p>
        <p>“ð”: For an extendable i-morphism f : IntpX1X, Y1Y, I1q Ñ IntpX2X, Y2Y, I2q
there is an L-relation Si s.t. f pBq “ BXSi for each B P IntpX1X, Y1Y, I1q by
Lemma 1(1). Then β “ I1 ˝ Si is a weak L-bond by Lemma 1(3) and Lemma
1(4).</p>
        <p>One can check that these two procedures are mutually inverse.
\[</p>
        <p>Now, consider L-bonds w.r.t. x^, _y defined similarly as in Definition 1, i.e.
an L-relation β P LX1ˆY2 s.t.</p>
        <p>ExtpX1^, Y2_, βq Ď ExtpX1^, Y1_, I1q and IntpX1^, Y2_, βq Ď IntpX2^, Y2_, I2q.</p>
        <p>Note that the weak L-bonds w.r.t. xX, Yy are different from L-bonds w.r.t.
x^, _y as the following example shows.</p>
        <p>Example 1. Consider L a finite chain containing a ă b with b defined as follows:
#x ^ y if x “ 1 or y “ 1,
x b y “ 0 otherwise,
for each x, y P L. One can easily see that x b Žj yj “ Žjpx b yjq and thus an
adjoint operation Ñ exists such that xL, ^, _, b, Ñ, 0, 1y is a complete residuated
lattice. Namely, Ñ is given as follows:
x Ñ y “
$1 if x ď y,
’
&amp;</p>
        <p>y if x “ 1,
’%b otherwise,
for each x, y P L. Consider I1 “ `a˘ and I2 “ `b˘. One can check that,
we have ExtptxuX, tyuY, I1q “ ExtptxuX, tyuY, I2q “ ttb{xu, xu and, trivially,
IntptxuX, tyuY, I2q “ IntptxuX, tyuY, I2q. Thus I2 is a weak L-bond between I1
and I2 w.r.t. xX, Yy.</p>
        <p>On the other hand, I2 is not a weak L-bond between I1 and I2 w.r.t. x^, _y
since Extptxu^, tyu_, I1q “ tH, ta{xuu Ğ tH, tb{xuu “ Extptxu^, tyu_, I2q.
Theorem 2. The system of all weak L-bonds is an L-interior system.</p>
      </sec>
      <sec id="sec-3-2">
        <title>Proof. From properties of i-morphism.</title>
        <p>4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Strong L-bonds</title>
      <p>We provide a stronger version of the previously studied weak L-bond, naturally
named strong L-bond.</p>
      <p>Definition 3. A strong L-bond between two L-contexts K1 “ xX1, Y1, I1y and
K2 “ xX2, Y2, I2y is an L-relation β P LX1ˆY2 s.t. β is a weak L-bond w.r.t. both
xX, Yy and x^, _y.</p>
      <p>The following lemma introduces equivalent definitions of strong L-bonds.
Lemma 2. The following propositions are equivalent:
(a) β is a strong L-bond between K1 “ xX1, Y1, I1y and K2 “ xX2, Y2, I2y.
(b) β satisfies both ExtpX1^, Y2_, βq Ď ExtpX1^, Y1_, I1q and IntpX1X, Y2Y, βq Ď</p>
      <p>IntpX2X, Y2Y, I2q.
(c) β “ Se ˝ I2 “ I1 ˝ Si for some Se P LX1ˆX2 and Si P LY1ˆY2 .</p>
      <p>Proof. (a) ô (b): By use of the Lemma 1(3) and (4).</p>
      <p>(a) ô (c): By definitions.</p>
      <p>In this case, this stronger notion can be related with the c-morphisms,
introduced below:
Definition 4. A mapping h : V Ñ W from a L-closure system V Ď LX into an
L-closure system W Ď LY is called a c-morphism if it is a Ñ- and Ź-morphism,
i.e. if
– hpa Ñ Cq “ a Ñ hpCq for each a P L and C P V ;
– hpŹkPK Ckq “ ŹkPK hpCkq for every collection of Ck P V (k P K);
– if C is an a-complement then hpCq is an a-complement.</p>
      <p>
        For formally establishing the relationship, the two following results are
recalled:
Lemma 3 ([
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]).
1. If h : V Ñ LY is an extendable c-morphism then there exists an L-relation
      </p>
      <p>A P LXˆY such that hpCq “ C Ż A for every C P LY .
2. Let A P LXˆY , the mapping hA : LX Ñ LY defined by hApCq “ C Ż A p“</p>
      <p>C^A q is an extendable c-morphism.</p>
      <p>Theorem 3. The strong L-bonds between K1 “ xX1, Y1, I1y and K2 “ xX2, Y2, I2y
are in one-to-one correspondence with extendable c-morphisms ExtpX2X, Y2Y, I2q
to ExtpX1X, Y1Y, I1q.
Proof. We show procedures to obtain the c-morphism from a strong L-bond and
vice versa.</p>
      <p>“ñ”: Let β be a strong L-bond between K1 “ xX1, Y1, I1y and K2 “
xX2, Y2, I2y. By Lemma 2 there is Se P LX1ˆX2 such that β “ Si˝I2. The induced
operator YSi is an extendable c-morphism ExtpX2X, Y2Y, I2q to ExtpX1X, Y1Y, I1q
by Lemma 3(2).</p>
      <p>“ð”: For extendable c-morphism f : ExtpX2Ò, Y2Ó, I2q Ñ ExtpX1X, Y1Y, I1q
there is an L-relation Se s.t. f pBq “ BYSi for each A P ExtpX2X, Y2Y, I2q by
Lemma 3(1). Then β “ Se ˝ I2 is a strong L-bond by Lemma 2.</p>
      <p>One can check that these two procedures are mutually inverse.
Theorem 4. The system of all strong L-bonds is an L-interior system.
Proof. Using Lemma 2 (b), it is an intersection of the L-interior systems from
Theorem 2. \[
Definition 5. Let K1 “ xX1, Y1, I1y, K2 “ xX2, Y2, I2y be L-contexts. The direct
product of K1 and K2 is defined as the L-context K1‘K2 “ xX2 ˆ Y1, X1 ˆ Y2, Δy
with Δpxx2, y1y, xx1, y2yq “ I1px1, y1q b I2px2, y2q.</p>
      <p>Theorem 5. The intents of K1 ‘ K2 are L-bonds between K1 and K2.
Proof. We have
φXpx1, y2q “ ł φpx2, y1q b Δpxx2, y1y, xx1, y2yq
“ ł φpx2, y1q b I1px1, y1q b I2px2, y2q
“
“
“
xx2,y1y
ł ł φpx2, y1q b I1px1, y1q b I2px2, y2q
y1PY1 x2PX2</p>
      <p>x2PX2
ł I1px1, y1q b pφT ˝ I2qpy1, y2q
y1PY1
ł I1px1, y1q b ł φpx2, y1q b I2px2, y2q
y1PY1
“ pI1 ˝ φT ˝ I2qpx1, y2q.</p>
      <p>Now, notice that pI1 ˝ φT q ˝ I2 “ I1 ˝ pφT ˝ I2q “ β is a strong L-bond by
Lemma 2. \[
Remark 1. It is worth mentioning that not every strong L-bond is included in
IntppX1 ˆ Y2qX, pX2 ˆ Y1qY, Δq since there are isotone L-bonds which are not of
the form of I1 ˝ φT ˝ I2. For instance, using the same structure of truth degrees
and I1 as in Example 1, obviously I1 is L-bond on K1 (i.e. between K1 and K1),
but IntppX1 ˆ Y2qX, pX2 ˆ Y1qY, Δq contains only H.</p>
      <p>
        The end of proof of the Theorem 5 also explains which L-bonds are intents
of K1 ‘ K2:
Corollary 1. The intents of K1 ‘ K2 are exactly those L-bonds between K1
and K2 which can be decomposed as I1 ˝ φT ˝ I2 for some φ P LX2ˆY1 .
Remark 2 (Relationship to the antitone case in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]).
      </p>
      <p>Assuming the double negation law, we have the equality ExtpXÒ, Y Ó, Iq “
ExtpXX, Y Y, Iq. Thus, for a strong L-bond β P LX1ˆY2 “ Se ˝ I2 “ I1 ˝ Si
between K1 and K2 we have β “ Se Ž I2 “ I1 Ż Si being an antitone L-bond
between K1 and K2.</p>
      <p>
        Remark 3. Some papers [
        <xref ref-type="bibr" rid="ref12 ref9">9, 12</xref>
        ] have considered direct products in the crisp and
the fuzzy settings, respectively, for the antitone case. In [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] conditions are
specified under which antitone L-bonds are present in the concept lattice of the
direct product. Corollary 1 and Remark 2 provide a simplification of these
conditions. The concept lattice of a direct product K1 b K2 defined as in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] i.e.
K1 b K2 “ xX2 ˆ Y1, X1 ˆ Y2, Δy with
Δpxx2, y1y, xx1, y2yq “
      </p>
      <p>I1px1, y1q Ñ I2px2, y2q p“</p>
      <p>I2px2, y2q Ñ I1px1, y1qq
induces concept-forming operator φÒΔ for which we have
φÒΔ px1, y2q “
“
“
“
“
“</p>
      <p>ľ
xx1,y2yPX1ˆY2</p>
      <p>ľ
xx2,y1yPX1ˆY2
ľ ľ
x2PX2 y1PY1
ľ
y1PY1
ľ
y1PY1
ľ
y1PY1
φpx2, y1q Ñ r I1px1, y1q Ñ I2px2, y2qs</p>
      <p>I1px1, y1q Ñ pφpx2, y1q Ñ I2px2, y2qq</p>
      <p>I1px1, y1q Ñ pφpx2, y1q Ñ I2px2, y2qq
I1px1, y1q Ñ
ľ pφpx2, y1q Ñ I2px2, y2qq
x2PX2
I1px1, y1q Ñ pφT Ž I2qpy1, y2q
pφT Ž I2qpy1, y2q Ñ I1px1, y1q
“ rI1 Ż pφT Ž I2qspx1, y2q
“ r I1 Ž pφT Ž I2qspx1, y2q
“ r I1 Ž pφT Ž I2qspx1, y2q
“ rp I1 ˝ φT q Ž I2qspx1, y2q
“ r p I1 ˝ φT ˝ I2qspx1, y2q
Whence an antitone L-bond is an intent of the concept lattice of K1 b K2 iff it
is possible to write it as p I1 ˝ φT ˝ I2q i.e. if its complement is an intent of
K1 ‘ K2.</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and future work</title>
      <p>We studied L-bonds with respect to isotone concept-forming operators,
computation of L-bonds using dirrect products, and the relationship of these results to
the previous results on antitone L-bonds.</p>
      <p>The present results can be easily generalized to a setting in which extents,
intents and the context relation use different structures of truth-degrees. We will
bring this generalization in an extended version of the paper.</p>
      <p>
        Our future research in this area includes the the study of yet another type of
(extendable) i-morphisms and c-morphisms. In [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], another type of morphism
is described: the a-morphism. In contrast to the morphisms used in this paper,
the a-morphisms are antitone, and their study could shed more light on antitone
fuzzy bonds.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>C.</given-names>
            <surname>Alcalde</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Burusco</surname>
          </string-name>
          , and
          <string-name>
            <surname>R.</surname>
          </string-name>
          <article-title>Fuentes-Gonza´lez. Interval-valued linguistic variables: an application to the L-fuzzy contexts with absent values</article-title>
          .
          <source>Int. J. General Systems</source>
          ,
          <volume>39</volume>
          (
          <issue>3</issue>
          ):
          <fpage>255</fpage>
          -
          <lpage>270</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>C.</given-names>
            <surname>Alcalde</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Burusco</surname>
          </string-name>
          ,
          <string-name>
            <surname>R.</surname>
          </string-name>
          <article-title>Fuentes-Gonza´lez, and</article-title>
          <string-name>
            <surname>I. Zubia.</surname>
          </string-name>
          <article-title>The use of linguistic variables and fuzzy propositions in the L-fuzzy concept theory</article-title>
          .
          <source>Computers &amp; Mathematics with Applications</source>
          ,
          <volume>62</volume>
          (
          <issue>8</issue>
          ):
          <fpage>3111</fpage>
          -
          <lpage>3122</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>R.</surname>
          </string-name>
          <article-title>Bˇelohla´vek</article-title>
          .
          <source>Fuzzy Relational Systems: Foundations and Principles</source>
          . Kluwer Academic Publishers,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>R.</given-names>
            <surname>Belohlavek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Konecny</surname>
          </string-name>
          .
          <article-title>Closure spaces of isotone Galois connections and their morphisms</article-title>
          .
          <source>In Dianhui Wang and Mark Reynolds</source>
          , editors,
          <source>Australasian Conference on Artificial Intelligence</source>
          , volume
          <volume>7106</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>182</fpage>
          -
          <lpage>191</lpage>
          . Springer,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>R.</given-names>
            <surname>Belohlavek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Konecny</surname>
          </string-name>
          .
          <article-title>Row and column spaces of matrices over residuated lattices</article-title>
          .
          <source>Fundam</source>
          . Inf.,
          <volume>115</volume>
          (
          <issue>4</issue>
          ):
          <fpage>279</fpage>
          -
          <lpage>295</lpage>
          ,
          <year>December 2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>P.</given-names>
            <surname>Butka</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          <article-title>Po´csova´, and</article-title>
          <string-name>
            <given-names>J.</given-names>
            <surname>Po</surname>
          </string-name>
          <article-title>´cs. On generation of one-sided concept lattices from restricted context</article-title>
          .
          <source>In IEEE 10th Jubilee Intl Symp on Intelligent Systems and Informatics (SISY)</source>
          , pages
          <fpage>111</fpage>
          -
          <lpage>115</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>J. T.</given-names>
            <surname>Denniston</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Melton</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S. E.</given-names>
            <surname>Rodabaugh</surname>
          </string-name>
          .
          <article-title>Formal concept analysis and lattice-valued Chu systems</article-title>
          .
          <source>Fuzzy Sets and Systems</source>
          ,
          <volume>216</volume>
          :
          <fpage>52</fpage>
          -
          <lpage>90</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>D.</given-names>
            <surname>Dubois</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Prade</surname>
          </string-name>
          .
          <article-title>Possibility theory and formal concept analysis: Characterizing independent sub-contexts</article-title>
          .
          <source>Fuzzy Sets and Systems</source>
          ,
          <volume>196</volume>
          :
          <fpage>4</fpage>
          -
          <lpage>16</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>B.</given-names>
            <surname>Ganter</surname>
          </string-name>
          .
          <article-title>Relational galois connections</article-title>
          .
          <source>In Sergei O. Kuznetsov and Stefan Schmidt</source>
          , editors,
          <source>Formal Concept Analysis</source>
          , volume
          <volume>4390</volume>
          of Lecture Notes in Computer Science, pages
          <fpage>1</fpage>
          -
          <lpage>17</lpage>
          . Springer Berlin Heidelberg,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <given-names>J.</given-names>
            <surname>Goguen</surname>
          </string-name>
          .
          <source>What is a concept? Lecture Notes in Computer Science</source>
          ,
          <volume>3596</volume>
          :
          <fpage>52</fpage>
          -
          <lpage>77</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>J.</given-names>
            <surname>Konecny</surname>
          </string-name>
          .
          <article-title>Closure and Interior Structures in Relational Data Analysis and Their Morphisms</article-title>
          .
          <source>PhD Thesis</source>
          , UP Olomouc,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. O. Kr´ıdlo, S. Krajˇci, and
          <string-name>
            <given-names>M.</given-names>
            <surname>Ojeda-Aciego</surname>
          </string-name>
          .
          <article-title>The category of L-Chu correspondences and the structure of L-bonds</article-title>
          .
          <source>Fundamenta Informaticae</source>
          ,
          <volume>115</volume>
          (
          <issue>4</issue>
          ):
          <fpage>297</fpage>
          -
          <lpage>325</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13. M. Kro¨tzsch, P. Hitzler, and
          <string-name>
            <given-names>G.-Q.</given-names>
            <surname>Zhang</surname>
          </string-name>
          . Morphisms in context.
          <source>Lecture Notes in Computer Science</source>
          ,
          <volume>3596</volume>
          :
          <fpage>223</fpage>
          -
          <lpage>237</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <given-names>H.</given-names>
            <surname>Lai</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhang</surname>
          </string-name>
          .
          <article-title>Concept lattices of fuzzy contexts: Formal concept analysis vs. rough set theory</article-title>
          .
          <source>Int. J. Approx. Reasoning</source>
          ,
          <volume>50</volume>
          (
          <issue>5</issue>
          ):
          <fpage>695</fpage>
          -
          <lpage>707</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Lei</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Luo</surname>
          </string-name>
          .
          <article-title>Rough concept lattices and domains</article-title>
          .
          <source>Annals of Pure and Applied Logic</source>
          ,
          <volume>159</volume>
          (
          <issue>3</issue>
          ):
          <fpage>333</fpage>
          -
          <lpage>340</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>J.</given-names>
            <surname>Medina</surname>
          </string-name>
          <article-title>. Multi-adjoint property-oriented and object-oriented concept lattices</article-title>
          .
          <source>Information Sciences</source>
          ,
          <volume>190</volume>
          :
          <fpage>95</fpage>
          -
          <lpage>106</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>J.</given-names>
            <surname>Medina</surname>
          </string-name>
          and
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Ojeda-Aciego. Multi-adjoint t-concept lattices</article-title>
          .
          <source>Information Sciences</source>
          ,
          <volume>180</volume>
          (
          <issue>5</issue>
          ):
          <fpage>712</fpage>
          -
          <lpage>725</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <given-names>J.</given-names>
            <surname>Medina</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Ojeda-Aciego</surname>
          </string-name>
          .
          <article-title>On multi-adjoint concept lattices based on heterogeneous conjunctors</article-title>
          .
          <source>Fuzzy Sets and Systems</source>
          ,
          <volume>208</volume>
          :
          <fpage>95</fpage>
          -
          <lpage>110</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>J. Medina</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Ojeda-Aciego</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <surname>J.</surname>
          </string-name>
          <article-title>Ruiz-Calvin˜o. Formal concept analysis via multi-adjoint concept lattices</article-title>
          .
          <source>Fuzzy Sets and Systems</source>
          ,
          <volume>160</volume>
          (
          <issue>2</issue>
          ):
          <fpage>130</fpage>
          -
          <lpage>144</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <given-names>S.</given-names>
            <surname>Solovyov</surname>
          </string-name>
          .
          <article-title>Lattice-valued topological systems as a framework for lattice-valued formal concept analysis</article-title>
          .
          <source>Journal of Mathematics</source>
          ,
          <year>2013</year>
          . To appear.
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <given-names>Q.</given-names>
            <surname>Wu</surname>
          </string-name>
          and
          <string-name>
            <given-names>Z.</given-names>
            <surname>Liu</surname>
          </string-name>
          .
          <article-title>Real formal concept analysis based on grey-rough set theory</article-title>
          .
          <source>Knowledge-Based Systems</source>
          ,
          <volume>22</volume>
          (
          <issue>1</issue>
          ):
          <fpage>38</fpage>
          -
          <lpage>45</lpage>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhang</surname>
          </string-name>
          .
          <article-title>Galois connections between categories of L-topological spaces</article-title>
          .
          <source>Fuzzy Sets and Systems</source>
          ,
          <volume>152</volume>
          (
          <issue>2</issue>
          ):
          <fpage>385</fpage>
          -
          <lpage>394</lpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>