HOME

TheInfoList



OR:

In formal ontology, a branch of metaphysics, and in ontological computer science, mereotopology is a
first-order theory First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quan ...
, embodying mereological and topological concepts, of the relations among wholes, parts, parts of parts, and the
boundaries Boundary or Boundaries may refer to: * Border, in political geography Entertainment * ''Boundaries'' (2016 film), a 2016 Canadian film * ''Boundaries'' (2018 film), a 2018 American-Canadian road trip film *Boundary (cricket), the edge of the pla ...
between parts.


History and motivation

Mereotopology begins in philosophy with theories articulated by
A. N. Whitehead Alfred North Whitehead (15 February 1861 – 30 December 1947) was an English mathematician and philosopher. He is best known as the defining figure of the philosophical school known as process philosophy, which today has found applicat ...
in several books and articles he published between 1916 and 1929, drawing in part on the mereogeometry of De Laguna (1922). The first to have proposed the idea of a point-free definition of the concept of topological space in mathematics was Karl Menger in his book ''Dimensionstheorie'' (1928) -- see also his (1940). The early historical background of mereotopology is documented in Bélanger and Marquis (2013) and Whitehead's early work is discussed in Kneebone (1963: ch. 13.5) and Simons (1987: 2.9.1). The theory of Whitehead's 1929 ''
Process and Reality ''Process and Reality'' is a book by Alfred North Whitehead, in which the author propounds a philosophy of organism, also called process philosophy. The book, published in 1929, is a revision of the Gifford Lectures he gave in 1927–28. Whit ...
'' augmented the part-whole relation with topological notions such as
contiguity Contiguity or contiguous may refer to: *Contiguous data storage, in computer science *Contiguity (probability theory) *Contiguity (psychology) * Contiguous distribution of species, in biogeography *Geographic contiguity of territorial land *Contig ...
and connection. Despite Whitehead's acumen as a mathematician, his theories were insufficiently formal, even flawed. By showing how Whitehead's theories could be fully formalized and repaired, Clarke (1981, 1985) founded contemporary mereotopology. The theories of Clarke and Whitehead are discussed in Simons (1987: 2.10.2), and Lucas (2000: ch. 10). The entry Whitehead's point-free geometry includes two contemporary treatments of Whitehead's theories, due to Giangiacomo Gerla, each different from the theory set out in the next section. Although mereotopology is a mathematical theory, we owe its subsequent development to logicians and theoretical
computer scientists Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to practical disciplines (including th ...
. Lucas (2000: ch. 10) and Casati and Varzi (1999: ch. 4,5) are introductions to mereotopology that can be read by anyone having done a course in
first-order logic First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantifi ...
. More advanced treatments of mereotopology include Cohn and Varzi (2003) and, for the mathematically sophisticated, Roeper (1997). For a mathematical treatment of point-free geometry, see Gerla (1995). Lattice-theoretic ( algebraic) treatments of mereotopology as contact algebras have been applied to separate the topological from the mereological structure, see Stell (2000), Düntsch and Winter (2004).


Applications

Barry Smith, Anthony Cohn,
Achille Varzi Achille Varzi (8 August 1904 – 1 July 1948) was an Italian Grand Prix driver. Career Born in Galliate, province of Novara (Piedmont), Achille Varzi was the son of a textile manufacturer. As a young man, he was a successful motorcycle ...
and their co-authors have shown that mereotopology can be useful in formal ontology and computer science, by allowing the formalization of relations such as
contact Contact may refer to: Interaction Physical interaction * Contact (geology), a common geological feature * Contact lens or contact, a lens placed on the eye * Contact sport, a sport in which players make contact with other players or objects * C ...
, connection,
boundaries Boundary or Boundaries may refer to: * Border, in political geography Entertainment * ''Boundaries'' (2016 film), a 2016 Canadian film * ''Boundaries'' (2018 film), a 2018 American-Canadian road trip film *Boundary (cricket), the edge of the pla ...
, interiors, holes, and so on. Mereotopology has been applied also as a tool for qualitative spatial-temporal reasoning, with constraint calculi such as the Region Connection Calculus (RCC). It provides the starting point for the theory of fiat boundaries developed by Smith and Varzi, which grew out of the attempt to distinguish formally between *boundaries (in geography, geopolitics, and other domains) which reflect more or less arbitrary human demarcations and *boundaries which reflect bona fide physical discontinuities (Smith 1995, 2001). Mereotopology is being applied by Salustri in the domain of digital manufacturing (Salustri, 2002) and by Smith and Varzi to the formalization of basic notions of ecology and environmental biology (Smith and Varzi, 1999, 2002). It has been applied also to deal with vague boundaries in geography (Smith and Mark, 2003), and in the study of vagueness and granularity (Smith and Brogaard, 2002, Bittner and Smith, 2001, 2001a).


Preferred approach of Casati & Varzi

Casati and Varzi (1999: ch.4) set out a variety of mereotopological theories in a consistent notation. This section sets out several nested theories that culminate in their preferred theory GEMTC, and follows their exposition closely. The mereological part of GEMTC is the conventional theory
GEM A gemstone (also called a fine gem, jewel, precious stone, or semiprecious stone) is a piece of mineral crystal which, in cut and polished form, is used to make jewelry or other adornments. However, certain rocks (such as lapis lazuli, opal, an ...
. Casati and Varzi do not say if the
models A model is an informative representation of an object, person or system. The term originally denoted the plans of a building in late 16th-century English, and derived via French and Italian ultimately from Latin ''modulus'', a measure. Models c ...
of GEMTC include any conventional
topological space In mathematics, a topological space is, roughly speaking, a geometrical space in which closeness is defined but cannot necessarily be measured by a numeric distance. More specifically, a topological space is a set whose elements are called po ...
s. We begin with some domain of discourse, whose elements are called individuals (a synonym for mereology is "the calculus of individuals"). Casati and Varzi prefer limiting the ontology to physical objects, but others freely employ mereotopology to reason about geometric figures and events, and to solve problems posed by research in
machine intelligence Artificial intelligence (AI) is intelligence—perceiving, synthesizing, and inferring information—demonstrated by machines, as opposed to intelligence displayed by animals and humans. Example tasks in which this is done include speech rec ...
. An upper case Latin letter denotes both a relation and the
predicate Predicate or predication may refer to: * Predicate (grammar), in linguistics * Predication (philosophy) * several closely related uses in mathematics and formal logic: **Predicate (mathematical logic) **Propositional function **Finitary relation, o ...
letter referring to that relation in
first-order logic First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quantifi ...
. Lower case letters from the end of the alphabet denote variables ranging over the domain; letters from the start of the alphabet are names of arbitrary individuals. If a formula begins with an
atomic formula In mathematical logic, an atomic formula (also known as an atom or a prime formula) is a formula with no deeper propositional structure, that is, a formula that contains no logical connectives or equivalently a formula that has no strict subformul ...
followed by the
biconditional In logic and mathematics, the logical biconditional, sometimes known as the material biconditional, is the logical connective (\leftrightarrow) used to conjoin two statements and to form the statement " if and only if ", where is known as th ...
, the subformula to the right of the biconditional is a definition of the atomic formula, whose variables are unbound. Otherwise, variables not explicitly quantified are tacitly
universally quantified In mathematical logic, a universal quantification is a type of Quantification (logic), quantifier, a logical constant which is interpretation (logic), interpreted as "given any" or "for all". It expresses that a predicate (mathematical logic), pr ...
. The axiom Cn below corresponds to axiom C.n in Casati and Varzi (1999: ch. 4). We begin with a topological primitive, a
binary relation In mathematics, a binary relation associates elements of one set, called the ''domain'', with elements of another set, called the ''codomain''. A binary relation over sets and is a new set of ordered pairs consisting of elements in and i ...
called ''connection''; the atomic formula ''Cxy'' denotes that "''x'' is connected to ''y''." Connection is governed, at minimum, by the axioms: C1. \ Cxx. ( reflexive) C2. Cxy \rightarrow Cyx. (
symmetric Symmetry (from grc, συμμετρία "agreement in dimensions, due proportion, arrangement") in everyday language refers to a sense of harmonious and beautiful proportion and balance. In mathematics, "symmetry" has a more precise definit ...
) Let ''E'', the binary relation of ''enclosure'', be defined as: Exy \leftrightarrow zx \rightarrow Czy ''Exy'' is read as "''y'' encloses ''x''" and is also topological in nature. A consequence of C1-2 is that ''E'' is reflexive and transitive, and hence a
preorder In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive and transitive. Preorders are more general than equivalence relations and (non-strict) partial orders, both of which are special ca ...
. If ''E'' is also assumed
extensional In any of several fields of study that treat the use of signs — for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language — an extensional context (or transparent context) is a syntactic environment in wh ...
, so that: (Exa \leftrightarrow Exb) \leftrightarrow (a=b), then ''E'' can be proved antisymmetric and thus becomes a partial order. Enclosure, notated ''xKy'', is the single primitive relation of the theories in Whitehead (1919, 1920), the starting point of mereotopology. Let ''parthood'' be the defining primitive
binary relation In mathematics, a binary relation associates elements of one set, called the ''domain'', with elements of another set, called the ''codomain''. A binary relation over sets and is a new set of ordered pairs consisting of elements in and i ...
of the underlying mereology, and let the
atomic formula In mathematical logic, an atomic formula (also known as an atom or a prime formula) is a formula with no deeper propositional structure, that is, a formula that contains no logical connectives or equivalently a formula that has no strict subformul ...
''Pxy'' denote that "''x'' is part of ''y''". We assume that ''P'' is a partial order. Call the resulting minimalist mereological theory M. If ''x'' is part of ''y'', we postulate that ''y'' encloses ''x'': C3. \ Pxy \rightarrow Exy. C3 nicely connects mereological parthood to topological enclosure. Let ''O'', the binary relation of mereological ''overlap'', be defined as: Oxy \leftrightarrow \exist z zx \land\ Pzy Let ''Oxy'' denote that "''x'' and ''y'' overlap." With ''O'' in hand, a consequence of C3 is: Oxy \rightarrow Cxy. Note that the converse does not necessarily hold. While things that overlap are necessarily connected, connected things do not necessarily overlap. If this were not the case, topology would merely be a model of mereology (in which "overlap" is always either primitive or defined). Ground mereotopology (MT) is the theory consisting of primitive ''C'' and ''P'', defined ''E'' and ''O'', the axioms C1-3, and axioms assuring that ''P'' is a partial order. Replacing the M in MT with the standard
extensional In any of several fields of study that treat the use of signs — for example, in linguistics, logic, mathematics, semantics, semiotics, and philosophy of language — an extensional context (or transparent context) is a syntactic environment in wh ...
mereology
GEM A gemstone (also called a fine gem, jewel, precious stone, or semiprecious stone) is a piece of mineral crystal which, in cut and polished form, is used to make jewelry or other adornments. However, certain rocks (such as lapis lazuli, opal, an ...
results in the theory GEMT. Let ''IPxy'' denote that "''x'' is an internal part of ''y''." ''IP'' is defined as: IPxy \leftrightarrow (Pxy \land (Czx \rightarrow Ozy)). Let σ''x'' φ(''x'') denote the mereological sum (fusion) of all individuals in the domain satisfying φ(''x''). σ is a variable binding prefix operator. The axioms of GEM assure that this sum exists if φ(''x'') is a first-order formula. With σ and the relation ''IP'' in hand, we can define the interior of ''x'', \mathbfx, as the mereological sum of all interior parts ''z'' of ''x'', or: \mathbfx =df \sigma z Pzx Two easy consequences of this definition are: \mathbfW = W, where ''W'' is the universal individual, and C5.The axiom C4 of Casati and Varzi (1999) is irrelevant to this entry. \ P(\mathbfx)x. ( Inclusion) The operator i has two more axiomatic properties: C6. \mathbf(\mathbfx) = \mathbfx. ( Idempotence) C7. \mathbf(x \times y) = \mathbfx \times \mathbfy, where ''a''×''b'' is the mereological product of ''a'' and ''b'', not defined when ''Oab'' is false. i distributes over product. It can now be seen that i is isomorphic to the
interior operator In mathematics, a closure operator on a set ''S'' is a function \operatorname: \mathcal(S)\rightarrow \mathcal(S) from the power set of ''S'' to itself that satisfies the following conditions for all sets X,Y\subseteq S : Closure operators are d ...
of topology. Hence the
dual Dual or Duals may refer to: Paired/two things * Dual (mathematics), a notion of paired concepts that mirror one another ** Dual (category theory), a formalization of mathematical duality *** see more cases in :Duality theories * Dual (grammatical ...
of i, the topological
closure operator In mathematics, a closure operator on a set ''S'' is a function \operatorname: \mathcal(S)\rightarrow \mathcal(S) from the power set of ''S'' to itself that satisfies the following conditions for all sets X,Y\subseteq S : Closure operators are d ...
c, can be defined in terms of i, and Kuratowski's axioms for c are theorems. Likewise, given an axiomatization of c that is analogous to C5-7, i may be defined in terms of c, and C5-7 become theorems. Adding C5-7 to GEMT results in Casati and Varzi's preferred mereotopological theory, GEMTC. ''x'' is ''self-connected'' if it satisfies the following predicate: SCx \leftrightarrow ((Owx \leftrightarrow (Owy \lor Owz)) \rightarrow Cyz). Note that the primitive and defined predicates of MT alone suffice for this definition. The predicate ''SC'' enables formalizing the necessary condition given in Whitehead's ''
Process and Reality ''Process and Reality'' is a book by Alfred North Whitehead, in which the author propounds a philosophy of organism, also called process philosophy. The book, published in 1929, is a revision of the Gifford Lectures he gave in 1927–28. Whit ...
'' for the mereological sum of two individuals to exist: they must be connected. Formally: C8. Cxy \rightarrow \exist z atomless_and_weaker_than_GEM,_the_axiom_that_assures_the_absence_of_atoms_(P9_in_Casati_and_Varzi_1999)_may_be_replaced_by_C9,_which_postulates_that_no_individual_has_a_boundary_(topology).html" "title="Atomic_formula.html" ;"title="Cz \land Ozx \land (Pwz \rightarrow (Owx \lor Owy)). Given some mereotopology X, adding C8 to X results in what Casati and Varzi call the ''Whiteheadian extension'' of X, denoted WX. Hence the theory whose axioms are C1-8 is WGEMTC. The converse of C8 is a GEMTC theorem. Hence given the axioms of GEMTC, ''C'' is a defined predicate if ''O'' and ''SC'' are taken as primitive predicates. If the underlying mereology is Atomic formula">atomless and weaker than GEM, the axiom that assures the absence of atoms (P9 in Casati and Varzi 1999) may be replaced by C9, which postulates that no individual has a boundary (topology)">topological boundary In topology and mathematics in general, the boundary of a subset of a topological space is the set of points in the closure of not belonging to the interior of . An element of the boundary of is called a boundary point of . The term bound ...
: C9. \forall x \exist y[Pyx \land (Czy \rightarrow Ozx) \land \lnot (Pxy \land (Czx \rightarrow Ozy))]. When the domain consists of geometric figures, the boundaries can be points, curves, and surfaces. What boundaries could mean, given other ontologies, is not an easy matter and is discussed in Casati and Varzi (1999: ch. 5).


See also

* Mereology *
Pointless topology In mathematics, pointless topology, also called point-free topology (or pointfree topology) and locale theory, is an approach to topology that avoids mentioning points, and in which the lattices of open sets are the primitive notions. In this appr ...
*
Point-set topology In mathematics, general topology is the branch of topology that deals with the basic set-theoretic definitions and constructions used in topology. It is the foundation of most other branches of topology, including differential topology, geomet ...
* Topology *
Topological space In mathematics, a topological space is, roughly speaking, a geometrical space in which closeness is defined but cannot necessarily be measured by a numeric distance. More specifically, a topological space is a set whose elements are called po ...
(with links to T0 through T6) * Whitehead's point-free geometry


Notes

{{reflist


References

* Biacino L., and Gerla G., 1991,
Connection Structures
" ''Notre Dame Journal of Formal Logic'' 32: 242–47. * Casati, Roberto, and Varzi, Achille, 1999. ''Parts and places: the structures of spatial representation''. MIT Press. * Stell J. G., 2000,
Boolean connection algebras: A new approach to the Region-Connection Calculus
" ''Artificial Intelligence'' 122: 111–136.


External links

* Stanford Encyclopedia of Philosophy
Boundary
��by Achille Varzi. With many references. Mathematical axioms Mereology Ontology Topology