Mereotopology

Last updated

In formal ontology, a branch of metaphysics, and in ontological computer science, mereotopology is a first-order theory, embodying mereological and topological concepts, of the relations among wholes, parts, parts of parts, and the boundaries between parts.

Contents

History and motivation

Mereotopology begins in philosophy with theories articulated by A. N. Whitehead 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). [1] The theory of Whitehead's 1929 Process and Reality augmented the part-whole relation with topological notions such as contiguity 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. [2] 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. 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. 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, [3] Anthony Cohn, Achille Varzi 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, connection, boundaries, 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, [4] which grew out of the attempt to distinguish formally between

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, [7] 2002 [8] ). It has been applied also to deal with vague boundaries in geography (Smith and Mark, 2003 [9] ), and in the study of vagueness and granularity (Smith and Brogaard, 2002, [10] Bittner and Smith, 2001, [11] 2001a [12] ).

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 . Casati and Varzi do not say if the models of GEMTC include any conventional topological spaces.

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.

An upper case Latin letter denotes both a relation and the predicate letter referring to that relation in first-order logic. 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 followed by the biconditional, 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. 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 called connection; the atomic formula Cxy denotes that "x is connected to y." Connection is governed, at minimum, by the axioms:

C1. (reflexive)

C2. (symmetric)

Let E, the binary relation of enclosure, be defined as:

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. If E is also assumed extensional, so that:

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 of the underlying mereology, and let the atomic formula 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.

C3 nicely connects mereological parthood to topological enclosure.

Let O, the binary relation of mereological overlap, be defined as:

Let Oxy denote that "x and y overlap." With O in hand, a consequence of C3 is:

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 mereology GEM results in the theory GEMT.

Let IPxy denote that "x is an internal part of y." IP is defined as:

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, as the mereological sum of all interior parts z of x, or:

df

Two easy consequences of this definition are:

where W is the universal individual, and

C5. [13] (Inclusion)

The operator i has two more axiomatic properties:

C6. (Idempotence)

C7.

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 of topology. Hence the dual of i, the topological closure operator 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:

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 for the mereological sum of two individuals to exist: they must be connected. Formally:

C8.

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 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 topological boundary:

C9.

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

Notes

  1. Cf. Peter Simons, "Whitehead and Mereology", in Guillaume Durand et Michel Weber (éditeurs), Les principes de la connaissance naturelle d’Alfred North Whitehead — Alfred North Whitehead’s Principles of Natural Knowledge , Frankfurt / Paris / Lancaster, ontos verlag, 2007. See also the relevant entries of Michel Weber and Will Desmond, (eds.), Handbook of Whiteheadian Process Thought , Frankfurt / Lancaster, ontos verlag, Process Thought X1 & X2, 2008.
  2. Casati & Varzi (1999: ch. 4) and Biacino & Gerla (1991) have reservations about some aspects of Clarke's formulation.
  3. Barry Smith, “Mereotopology: A Theory of Parts and Boundaries”, Data and Knowledge Engineering, 20 (1996), 287–303.
  4. Barry Smith and Achille Varzi, “Fiat and Bona Fide Boundaries”, Philosophy and Phenomenological Research, 60: 2 (March 2000), 401–420.
  5. Barry Smith, “On Drawing Lines on a Map”, in Andrew U. Frank and Werner Kuhn (eds.), Spatial Information Theory. A Theoretical Basis for GIS (Lecture Notes in Computer Science 988), Berlin/Heidelberg/New York, etc.: Springer, 1995, 475–484.
  6. Barry Smith, “Fiat Objects”, Topoi, 20: 2 (September 2001), 131–148.
  7. Barry Smith and Achille Varzi, “The Niche”, Nous, 33:2 (1999), 198–222.
  8. Barry Smith and Achille Varzi, “Surrounding Space: The Ontology of Organism-Environment Relations”, Theory in Biosciences, 121 (2002), 139–162.
  9. Barry Smith and David M. Mark, “Do Mountains Exist? Towards an Ontology of Landforms”, Environment and Planning B (Planning and Design), 30(3) (2003), 411–427.
  10. Barry Smith and Berit Brogaard, “Quantum Mereotopology”, Annals of Mathematics and Artificial Intelligence, 35/1–2 (2002), 153–175.
  11. Thomas Bittner and Barry Smith, “A unified theory of granularity, vagueness and approximation”, Proceedings of COSIT Workshop on Spatial Vagueness, Uncertainty and Granularity (2001).
  12. Thomas Bittner and Barry Smith, "Granular Partitions and Vagueness" in Christopher Welty and Barry Smith (eds.), Formal Ontology in Information Systems, New York: ACM Press, 2001, 309–321.
  13. The axiom C4 of Casati and Varzi (1999) is irrelevant to this entry.

Related Research Articles

<span class="mw-page-title-main">Associative property</span> Property of a mathematical operation

In mathematics, the associative property is a property of some binary operations, which means that rearranging the parentheses in an expression will not change the result. In propositional logic, associativity is a valid rule of replacement for expressions in logical proofs.

In mathematics, a set is countable if either it is finite or it can be made in one to one correspondence with the set of natural numbers. Equivalently, a set is countable if there exists an injective function from it into the natural numbers; this means that each element in the set may be associated to a unique natural number, or that the elements of the set can be counted one at a time, although the counting may never finish due to an infinite number of elements.

In set theory, Zermelo–Fraenkel set theory, named after mathematicians Ernst Zermelo and Abraham Fraenkel, is an axiomatic system that was proposed in the early twentieth century in order to formulate a theory of sets free of paradoxes such as Russell's paradox. Today, Zermelo–Fraenkel set theory, with the historically controversial axiom of choice (AC) included, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics. Zermelo–Fraenkel set theory with the axiom of choice included is abbreviated ZFC, where C stands for "choice", and ZF refers to the axioms of Zermelo–Fraenkel set theory with the axiom of choice excluded.

In axiomatic set theory and the branches of mathematics and philosophy that use it, the axiom of infinity is one of the axioms of Zermelo–Fraenkel set theory. It guarantees the existence of at least one infinite set, namely a set containing the natural numbers. It was first published by Ernst Zermelo as part of his set theory in 1908.

Mereology is the philosophical study of part-whole relationships, also called parthood relationships. As a branch of metaphysics, mereology examines the connections between parts and their wholes, exploring how components interact within a system. This theory has roots in ancient philosophy, with significant contributions from Plato, Aristotle, and later, medieval and Renaissance thinkers like Thomas Aquinas and John Duns Scotus. Mereology gained formal recognition in the 20th century through the pioneering works of Polish logician Stanisław Leśniewski, who introduced it as part of a comprehensive framework for logic and mathematics, and coined the word "mereology". The field has since evolved to encompass a variety of applications in ontology, natural language semantics, and the cognitive sciences, influencing our understanding of structures ranging from linguistic constructs to biological systems.

In algebraic topology, singular homology refers to the study of a certain set of algebraic invariants of a topological space X, the so-called homology groups Intuitively, singular homology counts, for each dimension n, the n-dimensional holes of a space. Singular homology is a particular example of a homology theory, which has now grown to be a rather broad collection of theories. Of the various theories, it is perhaps one of the simpler ones to understand, being built on fairly concrete constructions.

Algebraic K-theory is a subject area in mathematics with connections to geometry, topology, ring theory, and number theory. Geometric, algebraic, and arithmetic objects are assigned objects called K-groups. These are groups in the sense of abstract algebra. They contain detailed information about the original object but are notoriously difficult to compute; for example, an important outstanding problem is to compute the K-groups of the integers.

In mathematical logic, positive set theory is the name for a class of alternative set theories in which the axiom of comprehension holds for at least the positive formulas.

The Kripke–Platek set theory with urelements (KPU) is an axiom system for set theory with urelements, based on the traditional (urelement-free) Kripke–Platek set theory. It is considerably weaker than the (relatively) familiar system ZFU. The purpose of allowing urelements is to allow large or high-complexity objects to be included in the theory's transitive models without disrupting the usual well-ordering and recursion-theoretic properties of the constructible universe; KP is so weak that this is hard to do by traditional means.

The situation calculus is a logic formalism designed for representing and reasoning about dynamical domains. It was first introduced by John McCarthy in 1963. The main version of the situational calculus that is presented in this article is based on that introduced by Ray Reiter in 1991. It is followed by sections about McCarthy's 1986 version and a logic programming formulation.

In the foundations of mathematics, Morse–Kelley set theory (MK), Kelley–Morse set theory (KM), Morse–Tarski set theory (MT), Quine–Morse set theory (QM) or the system of Quine and Morse is a first-order axiomatic set theory that is closely related to von Neumann–Bernays–Gödel set theory (NBG). While von Neumann–Bernays–Gödel set theory restricts the bound variables in the schematic formula appearing in the axiom schema of Class Comprehension to range over sets alone, Morse–Kelley set theory allows these bound variables to range over proper classes as well as sets, as first suggested by Quine in 1940 for his system ML.

In logic, a functionally complete set of logical connectives or Boolean operators is one that can be used to express all possible truth tables by combining members of the set into a Boolean expression. A well-known complete set of connectives is { AND, NOT }. Each of the singleton sets { NAND } and { NOR } is functionally complete. However, the set { AND, OR } is incomplete, due to its inability to express NOT.

In mathematics, point-free geometry is a geometry whose primitive ontological notion is region rather than point. Two axiomatic systems are set out below, one grounded in mereology, the other in mereotopology and known as connection theory.

General set theory (GST) is George Boolos's (1998) name for a fragment of the axiomatic set theory Z. GST is sufficient for all mathematics not requiring infinite sets, and is the weakest known set theory whose theorems include the Peano axioms.

In mathematics and philosophy, Łukasiewicz logic is a non-classical, many-valued logic. It was originally defined in the early 20th century by Jan Łukasiewicz as a three-valued modal logic; it was later generalized to n-valued as well as infinitely-many-valued (0-valued) variants, both propositional and first order. The ℵ0-valued version was published in 1930 by Łukasiewicz and Alfred Tarski; consequently it is sometimes called the Łukasiewicz–Tarski logic. It belongs to the classes of t-norm fuzzy logics and substructural logics.

In mathematical logic, more specifically in the proof theory of first-order theories, extensions by definitions formalize the introduction of new symbols by means of a definition. For example, it is common in naive set theory to introduce a symbol for the set that has no member. In the formal setting of first-order theories, this can be done by adding to the theory a new constant and the new axiom , meaning "for all x, x is not a member of ". It can then be proved that doing so adds essentially nothing to the old theory, as should be expected from a definition. More precisely, the new theory is a conservative extension of the old one.

In philosophy, specifically in the area of metaphysics, counterpart theory is an alternative to standard (Kripkean) possible-worlds semantics for interpreting quantified modal logic. Counterpart theory still presupposes possible worlds, but differs in certain important respects from the Kripkean view. The form of the theory most commonly cited was developed by David Lewis, first in a paper and later in his book On the Plurality of Worlds.

In mathematical logic, the ancestral relation of a binary relation R is its transitive closure, however defined in a different way, see below.

S is an axiomatic set theory set out by George Boolos in his 1989 article, "Iteration Again". S, a first-order theory, is two-sorted because its ontology includes “stages” as well as sets. Boolos designed S to embody his understanding of the “iterative conception of set“ and the associated iterative hierarchy. S has the important property that all axioms of Zermelo set theory Z, except the axiom of extensionality and the axiom of choice, are theorems of S or a slight modification thereof.

The following system is Mendelson's ST type theory. ST is equivalent with Russell's ramified theory plus the Axiom of reducibility. The domain of quantification is partitioned into an ascending hierarchy of types, with all individuals assigned a type. Quantified variables range over only one type; hence the underlying logic is first-order logic. ST is "simple" primarily because all members of the domain and codomain of any relation must be of the same type. There is a lowest type, whose individuals have no members and are members of the second lowest type. Individuals of the lowest type correspond to the urelements of certain set theories. Each type has a next higher type, analogous to the notion of successor in Peano arithmetic. While ST is silent as to whether there is a maximal type, a transfinite number of types poses no difficulty. These facts, reminiscent of the Peano axioms, make it convenient and conventional to assign a natural number to each type, starting with 0 for the lowest type. But type theory does not require a prior definition of the naturals.

References