<!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>
      <journal-title-group>
        <journal-title>FOUST</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>The Counting Problem of Slot Mereology</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Cédric Tarbouriech</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Adrien Barton</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Laure Vieu</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jean-François Éthier</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Groupe de Recherche Interdisciplinaire en Informatique de la Santé (GRIIS), Sherbrooke University</institution>
          ,
          <addr-line>Québec</addr-line>
          ,
          <country country="CA">Canada</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Institut de Recherche en Informatique de Toulouse (IRIT), Université de Toulouse &amp; CNRS</institution>
          ,
          <country country="FR">France</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Laboratorio di Ontologia Applicata</institution>
          ,
          <addr-line>ISTC-CNR</addr-line>
          ,
          <country country="IT">Italy</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2021</year>
      </pub-date>
      <volume>5</volume>
      <fpage>11</fpage>
      <lpage>18</lpage>
      <abstract>
        <p>Bennett proposed in 2013 a new mereological theory based on the decomposition of the parthood relation into two relations: having a slot and occupying that slot. Slot mereology can be used to represent the mereological structure of a variety of entities that can have the same part multiple times, including (but not only) structural universals. We show here that this theory is not compatible with a counting criterion that would enable us to count appropriately how many times a whole has a part. We propose news axioms to ifx those flaws.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;ontology</kwd>
        <kwd>mereology</kwd>
        <kwd>slot mereology</kwd>
        <kwd>structural universal</kwd>
        <kwd>counting</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        Bennett proposed in 2013 [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] a new mereological theory that makes it possible for a whole to
have the same part multiple times. In this theory, the parthood relation is analysed in terms of
two relations: having a slot, and filling a slot . More precisely, x is a part of y iff x fills a slot of y.
Thus, y can have the same part x several times, by x filling several slots of y. Bennett motivated
her theory by a problem, exposed by Lewis in 1986 [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], that appears with structural universals,
namely universals that are composed of other universals. Indeed, a structural universal can have
the same universal as part multiple times. Bennett illustrates her theory by using the example
of the methane molecule universal, first introduced by Lewis [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]: in her theory, the methane
molecule universal CH4 can have the hydrogen atom universal H as part four times, reflecting
the structure of methane particulars. Structural universals were debated by Armstrong [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] and
Bigelow [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] in 1986, and by Fisher (2018) [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], Masolo and Vieu (2018) [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and Garbacz (2020)
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] in articles discussing mereological theories for structural universals, including Bennett’s slot
mereology. The slot mereology is in particular analysed by Fisher (2013) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] and Garbacz (2016)
[
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Note however that Bennett’s mereology is not restricted to structural universals and can be
applied to other entities, such as informational entities (see [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] and [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]). This theory is inspired
by a role-based analysis in which the slots would be identified with roles and the fillers with the
role-players, although Bennett does not propose a full account of roles in terms of slot mereology
and does not exploit any well-developed formal ontology of roles (such as [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] or [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]).
      </p>
      <p>In spite of its aim to account for having a part multiple times, as we are going to show,
Bennett’s proposition has counterintuitive implications when counting parts is at stake. For
example, according to some counting criterion and some model of the METHANE universal, the
METHANE universal would have hydrogen as part not four times, but vfie. According to another
counting criterion, the METHANE universal would have the ELECTRON universal as part not
ten times, as expected (six times from the carbon atom and four times from the four hydrogen
atoms), but seven times. We will thus propose a modification of Bennett’s theory that solves such
problems. We will illustrate our theory by using the METHANE example, occasionally completed
by other examples of structural universals and informational entities when needed.</p>
    </sec>
    <sec id="sec-2">
      <title>2. The Slot Mereology</title>
      <p>The slot mereology separates the parthood relation into two primitive relations: being the parthood
slot of and occupying a parthood slot, respectively named slot_of and fills .1 This theory was
motivated by the possibility for a whole to have the same part multiple times. For example, a
structural universal can have the same universal as part multiple times (e.g. CH4 having H as part
four times), or an informational entity particular can have the same informational entity particular
as part multiple times (e.g. ‘aa’ having ‘a’ as part twice). Thus, one could expect this theory
to enable a correct count of the number of appearances of each part (even if Bennett does not
discuss countability). However, the system fails in that respect, as we are going to see. Let us
ifrst present the system.</p>
      <sec id="sec-2-1">
        <title>2.1. Presentation of the System</title>
        <p>
          The theory is based on the two primitive relations slot_of and fills . Five relations are then defined
on this basis, as presented in Table 1. The definitions, axioms and theorems from Bennett’s paper
[
          <xref ref-type="bibr" rid="ref1">1</xref>
          ] are identified by, respectively, “BD”, “BA” and “BT”, followed by a number.
part_of(x, y) ≜ ∃z(slot_of(z, y) ∧ fills(x, z))
proper_part_of(x, y) ≜ part_of(x, y) ∧ ¬part_of(y, x)
overlap(x, y) ≜ ∃z(part_of(z, x) ∧ part_of(z, y))
slot_overlap(x, y) ≜ ∃z(slot_of(z, x) ∧ slot_of(z, y))
proper_slot_of(x, y) ≜ slot_of(x, y) ∧ ¬fills(y, x)
1The names have been changed. The original names in Bennett’s work were Ps and F. Note also that we do not
generally conceive of slots in spatial terms, although the connection between slots and spatial locations might be worth
investigating in the future.
        </p>
        <p>Eight axioms constrain the system, presented in Table 2. Axiom (BA5) makes slots inheritable.
fills(x, y) → ∃z(slot_of(y, z))
fills(x, y) → ¬∃z(slot_of(x, z))
slot_of(x, y) → ¬∃z(slot_of(z, x))
∃y(slot_of(y, x)) → ∃z(slot_of(z, x) ∧ fills(x, z))
[slot_of(z1, y) ∧ fills(x, z1) ∧ slot_of(z2, x)] → slot_of(z2, y)
(slot_of(z1, y) ∧ fills(x, z1))∧
(slot_of(z2, x) ∧ fills(y, z2)) → x = y
slot_of(x, y) → ∃!z(fills(z, x))
∃z(slot_of(z, x)) ∧ ∃z(slot_of(z, y)) →
[¬(∃z(slot_of(z, x) ∧ fills(y, z))) →
∃z(slot_of(z, y) ∧ ¬slot_of(z, x))]</p>
        <p>If s is a slot of a, we say that s is a “direct slot” of a iff there is no proper part b of a such that s
is also a slot of b (see (D1)3). If s is a slot of a that is not a direct slot, we call it a “non-direct
slot”. Axiom (BA5) implies the existence of non-direct slots in non-trivial models. Note that in
absence of any discreteness axiom, the existence of direct slots is not guaranteed.
Definition D1.</p>
        <p>direct_slot_of(s, a) ≜ slot_of(s, a) ∧ ¬∃b(proper_part_of(b, a) ∧ slot_of(s, b))
We will call “filler” an entity that fills a slot. (BA4) implies that anything that has at least one
slot is also a filler. At this point, we can make some remarks:
• Being a proper slot is not an intrinsic property of slots, but a relational property: the same
slot can be a proper slot of a filler and an improper slot of another filler.
• Even though every whole that has a proper part also has an improper slot (axiom (BA4)),
the converse is not true: a filler can have an improper slot without having any proper parts.
• Although Bennett’s paper does not mention this possibility, nothing in her system prevents
a filler from having several improper slots.</p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Representing the Methane Molecule</title>
        <p>
          Any methane molecule particular is composed of vfie atoms: one carbon and four hydrogens,
each bound to the carbon atom. Moreover, any carbon atom particular has six electrons, and each
hydrogen atom particular has one electron.4 Using the slot mereology, the universal METHANE is
2A typographical mistake in Bennett’s paper has been corrected, following Garbacz [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ].
        </p>
        <p>3Our definitions, axioms and theorems are denoted using only the first letter of the word, respectively D, A and T.
Therefore, they can be distinguished from Bennett’s.</p>
        <p>4Note that atoms also have other parts, such as nuclei, but for the sake of simplicity, we only represent electrons
here. The reasoning we will develop for electrons also applies to other parts such as nuclei.
part_of(x, y) ∧ part_of(y, z) → part_of(x, z)
∃z(slot_of(z, x)) → part_of(x, x)
proper_part_of(x, y) → ∃z(slot_of(z, y) ∧ ¬slot_of(z, x))
well as in the following ones, F ← Si
Si
described as having vfie proper slots, one for the CARBON universal and four for the HYDROGEN
universal. The current structure is described by Facts (1) and pictured in Figure 1, where, as
Si
represents slot_of(Si, F ), F represents fills (F, Si) and</p>
        <p>F ← represents slot_of(Si, F ) ∧ fills (F, Si). Note that axiom (BA4) entails that S0 exists and that
it is an improper slot of METHANE. For now and in the remainder, different constant symbols are
supposed to be interpreted as different fillers and different slots.
(1)
(2)
slot_of(Si, METHANE)
iflls (METHANE, S0)
iflls (CARBON, S1)
iflls (HYDROGEN, Si)
0 ≤ i ≤ 5 5</p>
        <p>Let’s represent the electrons of each atom. Each carbon atom has six electrons, each hydrogen
atom has one. So, in our case, the universal CARBON owns six slots filled with ELECTRON,
whereas the universal HYDROGEN owns only one, as described by Facts (2).</p>
        <p>slot_of(Si, CARBON)
slot_of(S12, HYDROGEN)
iflls (ELECTRON, Si)</p>
        <p>One thing to keep in mind is the fact that even if there are four slots of METHANE filled
by HYDROGEN, there is only one universal of HYDROGEN, which has only one slot filled by
ELECTRON. Bennett’s axiom (BA5) states that slots are inherited by wholes. In our case, this
means that METHANE inherits from CARBON and HYDROGEN their slots filled by ELECTRON.
METHANE inherits six slots from CARBON and only one slot from HYDROGEN. Considering
that METHANE has no other slots filled by ELECTRON, METHANE has in total seven slots filled
by ELECTRON.</p>
        <p>5This is a compact notation for six formulas. This notation is used in the remainder of the paper.</p>
        <p>According to axioms (BA4) and (BA5), there are two additional slots, called S13 and S14, that
are improper slots of CARBON and HYDROGEN, respectively (see Facts (3)).
slot_of(S13, CARBON)
iflls (CARBON, S13)
slot_of(S14, HYDROGEN)
iflls (HYDROGEN, S14)
(3)</p>
        <p>Regarding improper slots, there are two possibilities: either those two slots are different from
the ones previously mentioned, or some of them are identical to some of the previously mentioned
slots. In this example, we chose the first possibility: S13 and S14 are different from all the other
slots. All the slots of CARBON and HYDROGEN are inherited by METHANE, due to axiom (BA5):
slot_of(Si, METHANE) (6 ≤ i ≤ 14). Note that it is also the case for the improper slots.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Counting the Parts</title>
      <sec id="sec-3-1">
        <title>3.1. Counting Criteria</title>
        <p>“Counting how many times filler A has filler B as part” means counting the number of appearances
of B in A. But what counts as a genuine appearance? As a matter of fact, because Bennett’s
theory includes improper slots, we can define two counting criteria. The first counting criterion,
C1, is to count the number of different slots owned by A that are filled by B, whether they are
also owned by B or not. The second counting criterion, C2, is to count the number of different
slots owned by A that are filled by B and that are not owned by B (that is, that are not improper
slots of B).</p>
        <p>The results obtained with the two criteria will be compared to the result obtained when
analysing a methane molecule particular, which has one carbon atom particular, four hydrogen
atom particulars and ten electron particulars. Thus, we expect from our mereological theory
and counting criterion to lead to the methane molecule universal METHANE having as parts the
carbon atom universal CARBON once, the hydrogen atom universal HYDROGEN four times and
the electron universal ELECTRON ten times.</p>
      </sec>
      <sec id="sec-3-2">
        <title>3.2. Counting Problems</title>
        <p>Bennett’s theory raises two issues concerning the countability of parts: a first one stems from the
existence of improper slots, and a second one from slots of parts. Ultimately, as we will see, both
are caused by the slot inheritance axiom (BA5).</p>
        <sec id="sec-3-2-1">
          <title>3.2.1. Improper Slot Problem</title>
          <p>Let’s say we want to count the number of times HYDROGEN is part of METHANE. METHANE
has vfie different slots filled with HYDROGEN: four direct slots (S2 to S5) and one inherited slot
(S14), the latter being the improper slot of HYDROGEN itself. HYDROGEN is part of METHANE
vife times according to C1 and four times according to C2.6 By comparing those results with the
6Note that different results from the ones presented are possible if a different representation of the slot structure of
the methane molecule is used.
expected result when we count how many hydrogen particulars belong to a particular of methane
molecule, we can state that criterion C2 leads to a correct result, whereas criterion C1 leads to an
incorrect result.</p>
          <p>Among the possible models of the slot mereology, Figure 2 illustrates three models worthy of
interest. In these models, A and B are different and B is part of A. Here is an informal description
of the three models:
(a) A has only one slot S1 that is filled by B and this slot is not owned by B;
(b) A has only one slot S1 that is filled by B and this slot is also owned by B (and thus, is an
improper slot of B);
(c) A has exactly two different slots S1 and S2 that are filled by B. One of these slots (say S2)
is also owned by B.</p>
          <p>S0</p>
          <p>A↑</p>
          <p>↙
S1</p>
          <p>B
(a)</p>
          <p>S0</p>
          <p>A↑</p>
          <p>↙</p>
          <p>B ←
S1
(b)</p>
          <p>S0
S1</p>
          <p>B</p>
          <p>↙
↗ A ↖
(c)</p>
          <p>S2</p>
          <p>B ←</p>
          <p>From the facts represented in Figure 2, we can deduce the following facts:
• in the model (a), according to both C1 and C2, B is part of A once;
• in model (b), by C1, B is part of A once. However, by C2, B is part of A, but zero times ;
• in model (c), by C1, B is part of A twice. However, by C2, B is part of A once.7
According to the counting criteria, we get different results for models (b) and (c). Since it is
obviously absurd for B to be part of A, but zero times, C2 is inappropriate. Thus, we have shown
that neither C1 (by the METHANE example) nor C2 (by examples of Figure 2) can be compatible
with Bennett’s theory. Therefore, we need to change Bennett’s theory.</p>
        </sec>
        <sec id="sec-3-2-2">
          <title>3.2.2. Parts of Parts Problem</title>
          <p>The second problem stems from the parts of the parts. Let’s say we want to count how many times
ELECTRON is part of METHANE. If we do so, we will find six slots inherited from CARBON
(namely S6, S7, S8, S9, S10, S11) and one slot inherited from HYDROGEN (namely S12), that is,
seven slots in total. C1 would thus lead to METHANE having ELECTRON as part seven times,
whereas C2 would lead to it having ELECTRON as part at most seven times (depending on whether
some of those slots also are improper slots of ELECTRON). This result is different from the
expected result of ELECTRON being part of METHANE ten times.</p>
          <p>7S1 and S2 are filled by the very same universal. In contrast to Bennett’s figures in which slots can be drawn one
inside another, we chose to separate them, even if it implies to repeat the filler.</p>
        </sec>
        <sec id="sec-3-2-3">
          <title>3.2.3. Conclusion on the Two Counting Problems</title>
          <p>These two problems are in fact caused by the same axiom of slot inheritance (BA5), which i)
makes improper slots inheritable and ii) does not make the subparts inheritable multiple times.
Since this axiom was presumably introduced by Bennett to allow parthood transitivity, we will
need to replace it by alternative axioms that do not lead to the same problems, while still ensuring
parthood transitivity.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Fixing Bennett’s Theory</title>
      <p>Our analysis above suggests that the theory lacks axioms that could ensure correct counting
results according to our counting criteria. We suggest a few solutions in the following sections.</p>
      <sec id="sec-4-1">
        <title>4.1. Constraining Improper Slots Further</title>
        <p>Bennett does not state explicitly why she admitted in her theory the possibility for fillers to
have improper slots. However, we can assume that they were introduced to satisfy conditional
reflexivity (BT9) as they are not used for any other purpose in Bennett’s paper. Hence, we could
impose that an improper slot should not be owned by anything else than the filler it is an improper
slot of, with axiom (A1).</p>
        <p>Axiom A1. Improper Slots are only owned by their Filler</p>
        <p>slot_of(s, x) ∧ fills (x, s) → ∀y(slot_of(s, y) → x = y)</p>
        <p>Using axiom (A1) and definitions (BD1), (BD2), we can deduce the following theorem, which
states that a proper part of A is a part of A by filling a slot it does not own itself:
Theorem T1. ∀x, y, s(proper_part_of(y, x) → ∃s(slot_of(s, x) ∧ fills (y, s) ∧ ¬slot_of(s, y)))
Proof. Let x and y be two fillers such that y is a proper part of x. By definition of proper parthood
(BD2), we know that part_of(y, x) ∧ ¬part_of(x, y), which leads to ∃s(slot_of(s, x) ∧ fills (y, s).</p>
        <p>To complete the proof, we need to show that s is not a slot of y. Suppose that s is a slot of y.
We have slot_of(s, y) ∧ fills (y, s), which, according to (1), leads to x = y. However, we know that
¬part_of(x, y): contradiction. Therefore, we have ¬slot_of(s, y).</p>
        <p>This would make sure that every proper part of a filler fills a slot of this filler which it does not
own. Therefore, models like model (b) in Figure 2 are excluded.</p>
        <p>(A1) and Bennett’s slot inheritance axiom (BA5) and definition (BD1) lead together to the
following theorem (T2), stating that every part which has an improper slot is identical to its whole,
which is way too restrictive, and leads to trivial models only. For this reason, the slot inheritance
axiom should be revised.</p>
        <p>Theorem T2. ∀x, y, s(part_of(y, x) ∧ slot_of(s, y) ∧ fills (y, s) → x = y)
Proof. Let x and y be two fillers such that y is part of x. Let s be an improper slot of y. According
to axiom (BA5), s is also a slot of x. Therefore, according to axiom (A1), x = y.</p>
        <p>We revise axiom (BA5) by accepting instead that if x is a part of y and s is a proper slot of
x, then s is also a slot of y. That is, we restrict slot inheritance to proper slots, by the following
axiom (A2).</p>
        <p>Axiom A2. Proper Slot Inheritance</p>
        <p>part_of(x, y) ∧ slot_of(s, x) ∧ ¬fills (x, s) → slot_of(s, y)</p>
        <p>Transitivity of parthood (BT7) still holds when replacing axiom (BA5) by axiom (A2):
Proof. Let x, y and z be three fillers such that x is a part of y and y is a part of z.</p>
        <p>If x = y then part_of(x, z). Let’s suppose now that x ̸= y.</p>
        <p>By definition of part_of (BD1), there is a slot s such that slot_of(s, y) ∧ fills (x, s).</p>
        <p>By unicity of the filler and x ̸= y, y does not fill s. Then, since y is a part of z, by (A2) s is a
slot of z. Since x fills s, x is a part of z by definition of parthood (BD1).</p>
        <p>Thus, in all cases, x is a part of z.</p>
        <p>There are still two things to discuss: the generalisation of improper slots to all fillers, and the
possibility for a filler to have multiple improper slots.</p>
        <p>
          Bennett’s axiom (BA4) ensures that anything that possesses a slot has an improper slot. Bennett
justifies the conditional reflexivity by stating that “the reflexivity of parthood is restricted to
things that have parthood slots. That’s because [(BA3)] and the definition of parthood entail that
parthood slots cannot have parts at all” [1, p. 94]. This certainly justifies why slots are not part of
themselves, but it does not justify why fillers without slots are not part of themselves. We found
no other justification for this. Garbacz [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] made the same observation. We therefore generalize
Bennett’s axiom (BA4) by adding that every filler has an improper slot, in line with what Garbacz
proposed in his axiom (GA9). We thus add (A3) to the theory.
        </p>
        <p>Axiom A3. Additional Improper Parthood Slots</p>
        <p>iflls (x, s) → ∃t(slot_of(t, x) ∧ fills (x, t))</p>
        <p>We can broaden the theorem of conditional reflexivity (BT9) as theorem (T3).</p>
        <p>Theorem T3. General Conditional Reflexivity</p>
        <p>∃s(slot_of(s, x) ∨ fills (x, s)) → part_of(x, x)
Proof. This is a trivial consequence of (BD1), (BA4) and (A3).</p>
        <p>The last point to discuss about improper slots is that in Bennett’s theory, an entity can have
several improper slots. Remember that we determine the number of slots of a universal by
considering the number of parts of a particular that would instantiate this universal. For example,
a particular of METHANE has arguably itself as part only once. From this viewpoint, METHANE
should have a unique improper slot. More generally, we add the following axiom (A4) asserting
that a thing has only one improper slot.</p>
        <p>Axiom A4. Only One Improper Slot per Filler</p>
        <p>slot_of(s, x) ∧ fills (x, s) ∧ slot_of(t, x) ∧ fills (x, t) → s = t</p>
        <p>With these new axioms, we can reconsider the METHANE universal. The mereological structure
of METHANE is described by Facts (4) for the proper slots as well as Facts (5) for the improper
slots.</p>
        <p>If we count how many times HYDROGEN is part of METHANE, the result is four times, for
both counting criteria C1 and C2. In the remainder, we will no longer refer to counting criteria
C1 and C2 for proper parts, as they are equivalent in the new theory, since improper slots are not
inheritable anymore. Also, as every filler has now a unique improper slot, improper slots will no
longer be represented on figures in the remainder of the paper.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Parts of Parts</title>
        <sec id="sec-4-2-1">
          <title>4.2.1. Pre-Formal Idea</title>
          <p>The second problem comes from the inheritance by the whole of the proper slots owned by its
parts. As shown with the slots filled by ELECTRON in section 3.2.2, these slots are not inherited
the correct number of times. To solve this problem, we will propose a different system. This
system will rest on the pre-formal intuition that slots should not be inherited but copied.</p>
          <p>To implement this idea, we drop the slot inheritance axioms (BA5) and (A2) altogether and
“simulate” a (controlled) slot inheritance using slots that we will call “copy-slots”. If a whole is a
part of a bigger whole, its entire structure is copied using copy-slots. These copy-slots are slots
that have the same filler as the slot they are copied from. Improper slots are not copied.</p>
          <p>We can represent from which slot a copy-slot is copied from with the relation copied_from. We
can also represent through which HYDROGEN-filled slots the copy-slots (filled by ELECTRON)
are copied thanks to another relation: copied_through between a copy-slot and a slot. Those
two relations are represented in Figure 3, where Si ← S j represents copied_through(S j, Si) and
Si ← S j represents copied_from(S j, Si). On this figure, S3 is a copy-slot owned by A which is
copied from S2 through S1.</p>
          <p>Let’s see what would happen on METHANE by using this pre-formal idea. CARBON fills one
slot of METHANE. Therefore, its structure is present only once: METHANE has six copy-slots
iflled by ELECTRON. HYDROGEN fills four slots of METHANE. Hence, its structure is repeated
four times: METHANE has four additional copy-slots filled by ELECTRON. With this structure
A
↑ ↖</p>
          <p>B↑ ←
S1
S2 ↙</p>
          <p>C</p>
          <p>S3
C
repetition, METHANE has now ten copy-slots filled by ELECTRON, which is the correct number.
That is, among the ten copy-slots of METHANE filled by ELECTRON, six of them are copied from
the six electron-filled slots of CARBON and four of them are the result of copying four times from
the one electron-filled slot of H YDROGEN.</p>
        </sec>
        <sec id="sec-4-2-2">
          <title>4.2.2. Axiomatizing Copy-Slots</title>
          <p>According to our pre-formal idea, the first thing to do is to get rid of the revised slot inheritance
axiom (A2) (as well as the original (BA5)) and endorse an axiom of anti-inheritance (A5).8
Axiom A5. Anti-inheritance. [slot_of(s, y) ∧ fills (x, s) ∧ slot_of(t, x)] → ¬slot_of(t, y)</p>
          <p>Since (A2) was previously used to prove parthood transitivity (BT7), we need to accept new
axioms involving copy-slots that would enable to prove (BT7). To illustrate how copy-slots
work, let’s use a simpler example: the HELIUMDIMER universal, whose mereological structure is
pictured in Figure 4a.</p>
          <p>S1
S3
H↑ e ←
E
↗ He2 ↖</p>
          <p>S2
→ H↑ e</p>
          <p>S4</p>
          <p>E
(a) without copy-slots</p>
          <p>S5</p>
          <p>E</p>
          <p>S6</p>
          <p>E</p>
          <p>S7
E</p>
          <p>S8</p>
          <p>E
↗→ He2 ↖←
S1
→ ↗H↑ e ←
→ E ← S3
(b) with copy-slots</p>
          <p>S2
→ H↑ e↖ ←
S4 → E ←</p>
          <p>Note that since a particular of HELIUMDIMER has four particulars of ELECTRON as parts, the
universal HELIUMDIMER should have four slots filled by ELECTRON. And this is indeed the
case in our theory. As a matter of fact, the HELIUM universal has two slots filled by ELECTRON,
which are each copied twice, through each of the two slots of HELIUMDIMER filled by HELIUM.</p>
          <p>
            More generally, we can say that there are as many copy-slots as there are possible pairs of slots
(s, t) such that the first element is the slot through which the copy-slot copies, called “path-slot”,
8This implies that parthood is discrete [
            <xref ref-type="bibr" rid="ref14">14</xref>
            ], which is not an issue for the examples considered here.
and the second element, called “source-slot”, is the slot from which the copy-slot is copied. In
the case of the HELIUMDIMER, those pairs are (S1, S3), (S1, S4), (S2, S3) and (S2, S4). This is
what axiom (A6) describes. Axiom (A7) imposes that the copy-slot has the same filler as its
source-slot. Figure 4b pictures how copy-slots work with the HELIUMDIMER universal.
Axiom A6. Existence of a Unique Copy-Slot for each Whole and Path-Slot, Source-Slot Pair.
proper_slot_of(s, x) ∧ fills (y, s) ∧ proper_slot_of(t, y) →
∃!u(slot_of(u, x) ∧ copied_through(u, s) ∧ copied_from(u,t))
Axiom A7. Copied Slot has the Same Filler as its Source.
          </p>
          <p>copied_from(t, s) → ∃x(fills (x, s) ∧ fills (x,t))</p>
          <p>Axioms (A6) and (A7) and definition (BD1) are sufficient to prove the theorem of transitivity
(BT7):
Proof. Let x, y and z be three fillers such that x is a part of y and y is a part of z.</p>
          <p>If x = y then x is a part of z. So let’s suppose that x ̸= y.</p>
          <p>By definition of part_of (BD1), there are two slots s and t such that slot_of(s, y) ∧ fills (x, s) ∧
slot_of(t, z) ∧ fills (y,t).</p>
          <p>According to axiom (A6), there is a slot u of z copied from s through t.</p>
          <p>By (A7), since x fill s, x also fills u. Therefore, x is a part of z.</p>
          <p>As pictured in Figure 3, any copy-slot is owned by the same filler as the path-slot it copies
through is. Axiom (A8) ensures that both slots are owned by the same filler. Also, any pair of
path-slot and source-slot are related by a lfiler: the path-slot is filled by it, and the source-slot is
owned by it. Axiom (A9) ensures that the path-slot and the source-slot are related.
Axiom A8. proper_slot_of(t, x) ∧ copied_through(t, s) → proper_slot_of(s, x)
Axiom A9. copied_through(u, s) ∧ copied_from(u,t) → ∃x(fills (x, s) ∧ proper_slot_of(t, x))</p>
          <p>Finally, both relations copied_from and copied_through are constrained to be functional, by
axioms (A10) and (A11).9 This ensures that a copy-slot is only related to one pair. Otherwise,
we cannot be sure that counting yields a proper result; if the same copy-slot is used for multiple
pairs of slots filled with CARBON and ELECTRON, METHANE will not have the right number of
ELECTRON parts.</p>
          <p>Axiom A10. copied_from(s,t) ∧ copied_from(s, u) → t = u
Axiom A11. copied_through(s,t) ∧ copied_through(s, u) → t = u</p>
          <p>The resulting theory, with axioms (BA1)-(BA4), (BA6)-(BA8), (A1), (A3)-(A11), along with
definitions (BD1)-(BD5) and (D1), is sufficient to prove that the problem of counting inherited
slots is solved. The proof below focuses on the representative case of a filler a that has b as part
m times, where b itself has c as part n times. It shows that a has c as part m × n times.
Proof. Let a, b and c be three different fillers, let s1, . . . , sm be different slots of a filled by b and
let z1, . . . , zn be different slots of b filled by c.</p>
          <p>9These axioms are discussed in the context of overlap in section 5.1.</p>
          <p>We want to make sure that a has exactly one slot filled by c for each pair (si, z j) of slots.</p>
          <p>Let’s first prove that a has at least one slot filled by c for each pair. Let (si, z j) and (sk, zl )
be two different pairs. Since proper_slot_of(si, a) ∧ fills (b, si) ∧ proper_slot_of(z j, b),
according to axiom (A6), there is a copy-slot v such that slot_of(v, a), copied_through(v, si) and
copied_from(v, z j). Assume that v is also the copy-slot for the pair (sk, zl ), i.e., copied_from(v, zl )
and copied_through(v, sk). According to axioms (A10) and (A11), both relations copied_from
and copied_through are functional. Therefore, we deduce that si = sk and z j = zl , making the two
pairs the same: contradiction. Hence, there is a different slot of a filled by c for each pair. Due to
the unicity in axiom (A6), there is at most one slot for each pair.</p>
          <p>We can conclude that a, having at least and at most one slot for each pair, has exactly the right
number of slots filled by c.</p>
          <p>Let’s illustrate this on the METHANE universal. Facts (6) describe the mereological structure
without improper slots nor copy-slots; note that Facts (5) still hold in addition. Facts (7) describe
the copy-slots. With copy-slots, METHANE has exactly ten slots (S16 to S25) filled by ELECTRON,
which is the expected result.</p>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Discussion</title>
      <sec id="sec-5-1">
        <title>5.1. Overlap</title>
        <p>Bennett’s system has two relations related to overlap: classical overlap (BD3) and slot_overlap
(BD4). However, these relations are of little interest for structural universals. Let’s consider our
standard examples, universals of molecules including METHANE. First, any molecule universal
that has CARBON as part overlaps all other molecules having CARBON as part. Furthermore,
if CARBON has proper parts, it also has an improper slot. This improper slot is inherited by
every molecule CARBON is part of. Therefore, all those molecules are also slot-overlapping in
Bennett’s theory.</p>
        <p>Nevertheless, provided we ignore slot-overlapping on improper slots, slot-overlapping is an
interesting feature. As argued by Bennett herself, in the case of structural universals, what best
mimics Classical Mereology’s overlap in standard domains is slot_overlap rather than overlap.</p>
        <p>The system proposed in this paper disables improper slot inheritance. Therefore, wholes can
only slot-overlap on proper slots. Yet, the current copy-slots theory to handle slot inheritance
makes overlap nearly impossible. Figure 5a pictures the mereological structures of two strings
“be” and “et”, respectively composed of letters “b” and “e”, and “e” and “t”. These two strings
can be composed to create (at least) two other strings: “beet” and “bet”. The theoretical extension
of slot mereology exposed in this paper enables representing the mereological structure of “beet”,
be
↗ ↑
e
S4 S5
et
↑ ↖
e
S3
b
(a) “be” and “et”
t
S6</p>
        <p>S7
b</p>
        <p>S8
e
S↘3
b
→ b↗ e↑ e↖t ↖ ←
S1
→ ↗ b↑e</p>
        <p>S2
e↑t ↖ ↖←
↘ eS4 S5e ↙
(b) “beet”</p>
        <p>S9
e
St6↙</p>
        <p>S10
t</p>
        <p>S7</p>
        <p>b
S3 ↓
b</p>
        <p>S1
→ ↗b↑e ←
S4e ↙
→ b↗ e↑t↖ ←
S8</p>
        <p>e
(c) “bet”</p>
        <p>S2
→ e↑t↖ ←
↘ S5
e
t
S9
↓ S6
t
as pictured in Figure 5b.10 However, the mereological structure of “bet” is not representable.
Indeed, we would like a structure like the one pictured on Figure 5c. In this figure, “bet” has
only one slot filled by “e” (namely S8), otherwise, the counting criterion would not be satisfied.
As “e” is part of “be” and “et” (respectively by slots S4 and S5), S8 should be copied from both
S4 and S5, and through S1 and S2. But axioms (A10) and (A11) prevent this. Therefore, in our
system, “bet”, as composed of “be” and “et”, is not representable. If we want to be able to handle
slot-overlap, the first step is to remove (A10) and (A11). The resulting theoretical issue—making
sure that copy-slots are not reused when overlap is not at stake, but may be reused when overlap
is involved—will be addressed in future work.</p>
      </sec>
      <sec id="sec-5-2">
        <title>5.2. Constraining the Slot Supplementation Further</title>
        <p>
          Garbacz [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] analysed Bennett’s slot mereology inadequacies, in particular slot supplementation.
He noted that Bennett’s theorem of weak slot supplementation (BT13) is arguably rather
superficial.11 In Classical Mereology, weak supplementation is meant to forbid the decomposition of a
whole into a single proper part [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ]. In Bennett’s theory, theorem (BT13), although presented as
a reformulated version of weak supplementation, misses the whole point. Figure 6a illustrates a
model challenging Bennett’s weak slot supplementation: theorem (BT13) is satisfied while X is a
single proper part of Y . (BT13) stipulates that there is a slot z owned by Y but not by X . In 6a,
two slots are in this situation. The first one is the improper slot of Y , S0. To reject this model,
the weak slot supplementation could be changed so as to only consider proper slots. However,
and quite surprisingly, in 6a a second slot plays the role of z in the theorem, namely, the slot that
makes X a proper part of Y , S1 itself. To fix this problem, one could think to change weak slot
supplementation into stating that the slot z should not be filled by x.
        </p>
        <p>We do not implement such changes here, because this constraint would hinder models such
as the one pictured in Figure 6b, which is a similar model as HELIUMDIMER presented above.
More work, beyond Garbacz’s considerations on the proof of weak supplementation in Bennett’s
theory, is needed to obtain an adequate version of weak supplementation in slot mereology.</p>
        <p>10Here, only the mereological structure of strings is considered, order is ignored. Therefore, “beet” and “bete” are
actually the same individual.</p>
        <p>
          11Theorem (BT13) still holds in our theory, since, as proved by Garbacz [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ], axiom (BA4), which we keep, suffices
to prove it.
        </p>
        <p>Y↑ ←
S1</p>
        <p>X
(a)</p>
        <p>S1</p>
        <p>X</p>
        <p>S2
X</p>
      </sec>
      <sec id="sec-5-3">
        <title>5.3. Using the Revised Slot Mereology with Particulars</title>
        <p>
          As mentioned earlier, Bennett’s slot mereology can be applied not only to structural universals,
but also to informational entity particulars, as they also can have a part several times. However, it
does not seem to bring any benefit for the analysis of material entity particulars such as a bike,
a human body or a table (although we could still apply a degenerated slot mereology in which
each part could appear only once). Indeed, a canonical human body would have two arms, but
not twice the same arm. Therefore, a classical mereology theory should probably be used in
complement of the revised slot mereology we proposed here. This will imply analyzing how
these two theories interact and, in particular, how a slot-mereological relation between universals
is reflected by a classical mereological relation among their instances. Such articulation might
also enable to represent “silent change” [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ] in which an assertion remains true at the universal
level while the involved particulars may change (such as “Every car has an engine as part”, even
though one engine instance might be replaced by another one in the same car).
        </p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusion</title>
      <p>
        In this paper we discussed Bennett’s slot mereology [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], mainly illustrated on standard examples
of structural universals such as METHANE. In section 3, we exposed two counting criteria C1
and C2 and showed how Bennett’s system, despite having been introduced with the motivation to
account for having a part several times over, fails on counting parts with both counting criteria.
More precisely, we first showed that Bennett’s axiom of slot inheritance (BA5) was problematic
for counting. As shown in section 3.2.1, improper slots are inherited in Bennett’s system, and
therefore are taken into account by counting criterion C1—although they arguably should not.
Therefore, in section 4.1, we proposed to constrain improper slots. Those constraints make
improper slots non-inheritable and only relevant for ensuring parthood reflexivity—but not for
counting. Second, in section 3.2.2, we showed that neither slot inheritance (BA5) nor the proposed
revised slot inheritance (A2) yield a theory with models satisfying any of the two counting criteria
when parts of parts are involved. Therefore, we proposed in section 4.2 to replace slot inheritance
by slot copy. The new system was shown to yield correct results for both counting criteria with
non-overlapping mereological structures. We are confident that this revision can serve as a basis
for further extensions with potential for multiple applications beyond structural universals, for
instance, for informational entities.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>K.</given-names>
            <surname>Bennett</surname>
          </string-name>
          ,
          <article-title>Having a part twice over</article-title>
          ,
          <source>Australasian Journal of Philosophy</source>
          <volume>91</volume>
          (
          <year>2013</year>
          )
          <fpage>83</fpage>
          -
          <lpage>103</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>D.</given-names>
            <surname>Lewis</surname>
          </string-name>
          , Against structural universals,
          <source>Australasian Journal of Philosophy</source>
          <volume>64</volume>
          (
          <year>1986</year>
          )
          <fpage>25</fpage>
          -
          <lpage>46</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>D.</given-names>
            <surname>Armstrong</surname>
          </string-name>
          , In defence of structural universals,
          <source>Australasian Journal of Philosophy</source>
          <volume>64</volume>
          (
          <year>1986</year>
          )
          <fpage>85</fpage>
          -
          <lpage>88</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>J.</given-names>
            <surname>Bigelow</surname>
          </string-name>
          , Towards structural universals,
          <source>Australasian Journal of Philosophy</source>
          <volume>64</volume>
          (
          <year>1986</year>
          )
          <fpage>94</fpage>
          -
          <lpage>96</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>A. R. J</surname>
          </string-name>
          . Fisher, Structural universals,
          <source>Philosophy Compass</source>
          <volume>13</volume>
          (
          <year>2018</year>
          )
          <article-title>e12518</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>C.</given-names>
            <surname>Masolo</surname>
          </string-name>
          , L. Vieu,
          <article-title>Graph-based approaches to structural universals and complex states of affairs</article-title>
          ,
          <source>in: Formal Ontology in Information Systems (FOIS</source>
          <year>2018</year>
          ), IOS Press,
          <year>2018</year>
          , pp.
          <fpage>69</fpage>
          -
          <lpage>82</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>P.</given-names>
            <surname>Garbacz</surname>
          </string-name>
          ,
          <article-title>An analysis of the debate over structural universals</article-title>
          ,
          <source>in: Formal Ontology in Information Systems (FOIS</source>
          <year>2020</year>
          ), IOS Press,
          <year>2020</year>
          , pp.
          <fpage>3</fpage>
          -
          <lpage>16</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <surname>A. R. J</surname>
          </string-name>
          . Fisher, Bennett on parts twice over,
          <source>Philosophia</source>
          <volume>41</volume>
          (
          <year>2013</year>
          )
          <fpage>757</fpage>
          -
          <lpage>761</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P.</given-names>
            <surname>Garbacz</surname>
          </string-name>
          , Slot mereology revised,
          <source>Australasian Journal of Philosophy</source>
          <volume>95</volume>
          (
          <year>2016</year>
          )
          <fpage>171</fpage>
          -
          <lpage>177</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A.</given-names>
            <surname>Barton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Toyoshima</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Vieu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Fabry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-F.</given-names>
            <surname>Ethier</surname>
          </string-name>
          ,
          <article-title>The mereological structure of informational entities</article-title>
          ,
          <source>in: Formal Ontology in Information Systems (FOIS</source>
          <year>2020</year>
          ), IOS Press,
          <year>2020</year>
          , p.
          <fpage>201</fpage>
          -
          <lpage>215</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Barton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Toyoshima</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.-F.</given-names>
            <surname>Ethier</surname>
          </string-name>
          ,
          <article-title>Clinical documents and their parts</article-title>
          ,
          <source>in: Proceedings of the 11th International Conference on Biomedical Ontologies (ICBO</source>
          <year>2020</year>
          ), CEUR, Vol.
          <volume>2807</volume>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>C.</given-names>
            <surname>Masolo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Vieu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Bottazzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Catenacci</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Ferrario</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gangemi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Guarino</surname>
          </string-name>
          ,
          <article-title>Social roles and their descriptions</article-title>
          .,
          <source>in: Proceedings of the 9th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR</source>
          <year>2004</year>
          ),
          <year>2004</year>
          , pp.
          <fpage>267</fpage>
          -
          <lpage>277</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>F.</given-names>
            <surname>Loebe</surname>
          </string-name>
          ,
          <article-title>Abstract vs. social roles-towards a general theoretical account of roles</article-title>
          ,
          <source>Applied Ontology</source>
          <volume>2</volume>
          (
          <year>2007</year>
          )
          <fpage>127</fpage>
          -
          <lpage>158</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>C.</given-names>
            <surname>Masolo</surname>
          </string-name>
          , L. Vieu,
          <article-title>Atomicity vs. infinite divisibility of space</article-title>
          , in: C.
          <string-name>
            <surname>Freksa</surname>
          </string-name>
          , D. Mark (Eds.),
          <article-title>Spatial Information theory</article-title>
          .
          <source>Proceedings of COSIT'99, LNCS 1661</source>
          , Springer Verlag, Berlin,
          <year>1999</year>
          , pp.
          <fpage>235</fpage>
          -
          <lpage>250</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>A.</given-names>
            <surname>Varzi</surname>
          </string-name>
          , Mereology, in: E. N.
          <string-name>
            <surname>Zalta</surname>
          </string-name>
          (Ed.),
          <source>The Stanford Encyclopedia of Philosophy</source>
          , Spring 2019 ed., Metaphysics Research Lab, Stanford University,
          <year>2019</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>N.</given-names>
            <surname>Grewe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jansen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Smith</surname>
          </string-name>
          ,
          <article-title>Permanent generic relatedness and silent change</article-title>
          , in: Joint Ontology Workshops,
          <article-title>FOIS 2016 Ontology Competition (JOWO 2016), CEUR</article-title>
          , Vol.
          <volume>1660</volume>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>