We can see mereology as a theory of parthood and topology as a theory of wholeness. How can these be combined to obtain a unified theory of parts and wholes? This paper examines various non-equivalent ways of pursuing this task, with specific reference to its relevance to spatio-temporal reasoning. In particular, three main strategies are compared: (i) mereology and topology as two independent (though mutually related) chapters; (ii) mereology as a general theory subsuming topology; (iii) topology as a general theory (...) subsuming mereology. Some more speculative strategies and directions for further research are also considered. (shrink)

The relationship of part to whole is one of the most fundamental there is; this is the first and only full-length study of this concept. This book shows that mereology, the formal theory of part and whole, is essential to ontology. Peter Simons surveys and criticizes previous theories, especially the standard extensional view, and proposes a more adequate account which encompasses both temporal and modal considerations in detail. 'Parts could easily be the standard book on mereology for the next twenty (...) or thirty years.' Timothy Williamson, Grazer Philosophische Studien. (shrink)

Completed in 1983, this work culminates nearly half a century of the late Alfred Tarski's foundational studies in logic, mathematics, and the philosophy of science. Written in collaboration with Steven Givant, the book appeals to a very broad audience, and requires only a familiarity with first-order logic. It is of great interest to logicians and mathematicians interested in the foundations of mathematics, but also to philosophers interested in logic, semantics, algebraic logic, or the methodology of the deductive sciences, and to (...) computer scientists interested in developing very simple computer languages rich enough for mathematical and scientific applications. The authors show that set theory and number theory can be developed within the framework of a new, different, and simple equational formalism, closely related to the formalism of the theory of relation algebras. There are no variables, quantifiers, or sentential connectives. Predicates are constructed from two atomic binary predicates (which denote the relations of identity and set-theoretic membership) by repeated applications of four operators that are analogues of the well-known operations of relative product, conversion, Boolean addition, and complementation. All mathematical statements are expressed as equations between predicates. There are ten logical axiom schemata and just one rule of inference: the one of replacing equals by equals, familiar from high school algebra. Though such a simple formalism may appear limited in its powers of expression and proof, this book proves quite the opposite. The authors show that it provides a framework for the formalization of practically all known systems of set theory, and hence for the development of all classical mathematics. The book contains numerous applications of the main results to diverse areas of foundational research: propositional logic; semantics; first-order logics with finitely many variables; definability and axiomatizability questions in set theory, Peano arithmetic, and real number theory; representation and decision problems in the theory of relation algebras; and decision problems in equational logic. (shrink)

Whitehead, in his famous book "Process and Reality", proposed a definition of point assuming the concepts of “region” and “connection relation” as primitive. Several years after and independently Grzegorczyk, in a brief but very interesting paper proposed another definition of point in a system in which the inclusion relation and the relation of being separated were assumed as primitive. In this paper we compare their definitions and we show that, under rather natural assumptions, they coincide.

Although Aristotle (Metaphysics, Book IV, Chapter 2) was perhaps the first person to consider the part-whole relationship to be a proper subject matter for philosophic inquiry, the Polish logician Stanislow Lesniewski [15] is generally given credit for the first formal treatment of the subject matter in his Mereology.1 Woodger [30] and Tarski [24] made use of a specific adaptation of Lesniewski's work as a basis for a formal theory of physical things and their parts. The term 'calculus of individuals' was (...) introduced by Leonard and Goodman [14] in their presentation of a system very similar to Tarski's adaptation of Lesniewski's Mereology. Contemporaneously with Lesniewski's development of his Mereology, Whitehead [27] and [28] was developing a theory of extensive abstraction based on the two-place predicate, 'x extends over y\ which is the converse of 'x is a part of y\ This system, according to Russell [22], was to have been the fourth volume of their Pήncipia Mathematica, the never-published volume on geometry. Both Lesniewski [15] and Tarski [25] have recognized the similarities between Whitehead's early work and Lesniewski's Mereology. Between the publication of Whitehead's early work and the publication of Process and Reality [29], Theodore de Laguna [7] published a suggestive alternative basis for Whitehead's theory. This led Whitehead, in Process and Reality, to publish a revised form of his theory based on the two-place predicate, 'x is extensionally connected with y\ It is the purpose of this paper to present a calculus of individuals based on this new Whiteheadian primitive predicate. (shrink)

Dynamic algebras combine the classes of Boolean (B 0) and regular (R ; *) algebras into a single finitely axiomatized variety (B R ) resembling an R-module with scalar multiplication . The basic result is that * is reflexive transitive closure, contrary to the intuition that this concept should require quantifiers for its definition. Using this result we give several examples of dynamic algebras arising naturally in connection with additive functions, binary relations, state trajectories, languages, and flowcharts. The main result (...) is that free dynamic algebras are residually finite (i.e. factor as a subdirect product of finite dynamic algebras), important because finite separable dynamic algebras are isomorphic to Kripke structures. Applications include a new completeness proof for the Segerberg axiomatization of prepositional dynamic logic, and yet another notion of regular algebra. (shrink)

In recent years, there has been renewed interest in the development of formal languages for describing mereological (part-whole) and topological relationships between objects in space. Typically, the non-logical primitives of these languages are properties and relations such as `x is connected' or `x is a part of y', and the entities over which their variables range are, accordingly, not points, but regions: spatial entities other than regions are admitted, if at all, only as logical constructs of regions. This paper considers (...) two first-order mereotopological languages, and investigates their expressive power. It turns out that these languages, notwithstanding the simplicity of their primitives, are surprisingly expressive. In particular, it is shown that infinitary versions of these languages are adequate to express (in a sense made precise below) all topological relations over the domain of polygons in the closed plane. (shrink)

Process and Reality, Whitehead’s magnum opus, is one of the major philosophical works of the modern world, and an extensive body of secondary literature has developed around it. Yet surely no significant philosophical book has appeared in the last two centuries in nearly so deplorable a condition as has this one, with its many hundreds of errors and with over three hundred discrepancies between the American and the English editions, which appeared in different formats with divergent paginations. The work itself (...) is highly technical and far from easy to understand, and in many passages the errors in those editions were such as to compound the difficulties. The need for a corrected edition has been keenly felt for many decades. (shrink)

The logical theory which is called thecalculus of (binary) relations, and which will constitute the subject of this paper, has had a strange and rather capricious line of historical development. Although some scattered remarks regarding the concept of relations are to be found already in the writings of medieval logicians, it is only within the last hundred years that this topic has become the subject of systematic investigation. The first beginnings of the contemporary theory of relations are to be found (...) in the writings of A. De Morgan, who carried out extensive investigations in this domain in the fifties of the Nineteenth Century. De Morgan clearly realized the inadequacy of traditional logic for the expression and justification, not merely of the more intricate arguments of mathematics and the sciences, but even of simple arguments occurring in every-day life; witness his famous aphorism, that all the logic of Aristotle does not permit us, from the fact that a horse is an animal, to conclude that the head of a horse is the head of an animal. In his effort to break the bonds of traditional logic and to expand the limits of logical inquiry, he directed his attention to the general concept of relations and fully recognized its significance. Nevertheless, De Morgan cannot be regarded as the creator of the modern theory of relations, since he did not possess an adequate apparatus for treating the subject in which he was interested, and was apparently unable to create such an apparatus. His investigations on relations show a lack of clarity and rigor which perhaps accounts for the neglect into which they fell in the following years. (shrink)

This paper presents a calculus for mereotopological reasoning in which two-dimensional spatial regions are treated as primitive entities. A first order predicate language ℒ with a distinguished unary predicate c(x), function-symbols +, · and - and constants 0 and 1 is defined. An interpretation ℜ for ℒ is provided in which polygonal open subsets of the real plane serve as elements of the domain. Under this interpretation the predicate c(x) is read as 'region x is connected' and the function-symbols and (...) constants are given their meaning in terms of a Boolean algebra of polygons. We give an alternative interpretation ������ base on the real closed plane which turns out to be isomorphic to ℜ. A set of axioms and a rule of inference are introduced. We prove the soundness and completeness of the calculus with respect to the given interpretation. (shrink)

We shall show that certain natural and interesting intervals in the lattice of varieties of representable relation algebras embed the lattice of all subsets of the natural numbers, and therefore must have a very complicated lattice-theoretic structure.

The purpose of the present paper is to show that modal propositional logics can be interpreted in a logic based on relational calculus. We consider languages with necessity operators [R], where R is an accessibility relation expression representing an element of the algebra of binary relations with operations −,∪,∩, −1 , ◦. The relational logic is based on relational calculus enriched by operations of weakest prespecification and weakest postspecification introduced in Hoare and He Jifeng and investigated in He Jifeng et (...) al . The logic is an extension of the system introduced in Or lowska and investigated in Buszkowski and Or lowska. (shrink)

The standard model for mereotopological structures are Boolean subalgebras of the complete Boolean algebra of regular closed subsets of a nonempty connected regular T 0 topological space with an additional "contact relation" C defined by xCy x ØA (possibly) more general class of models is provided by the Region Connection Calculus (RCC) of Randell et al. We show that the basic operations of the relational calculus on a "contact relation" generate at least 25 relations in any model of the RCC, (...) and hence, in any standard model of mereotopology. It follows that the expressiveness of the RCC in relational logic is much greater than the original 8 RCC base relations might suggest. We also interpret these 25 relations in the the standard model of the collection of regular open sets in the two-dimensional Euclidean plane. (shrink)

In recent years, there has been renewed interest in the development of formal languages for describing mereological (part-whole) and topological relationships between objects in space. Typically, the non-logical primitives of these languages are properties and relations such as ‘xis connected’ or ‘xis a part ofy’, and the entities over which their variables range are, accordingly, notpoints, butregions: spatial entities other than regions are admitted, if at all, only as logical constructs of regions. This paper considers two first-order mereotopological languages, and (...) investigates their expressive power. It turns out that these languages, notwithstanding the simplicity of their primitives, are surprisingly expressive. In particular, it is shown that infinitary versions of these languages are adequate to express (in a sense made precise below) all topological relations over the domain of polygons in the closed plane. (shrink)

Spatial reasoning is essential for many AI applications. In most existing systems the representation is primarily numerical, so the information that can be handled is limited to precise quantitative data. However, for many purposes the ability to manipulate high-level qualitative spatial information in a flexible way would be extremely useful. Such capabilities can be proveded by logical calculi; and indeed 1st-order theories of certain spatial relations have been given [20]. But computing inferences in 1st-order logic is generally intractable unless special (...) methods are known.0-order modal logics provide an alternative representation which is more expressive than classical 0-order logic and yet often more amenable to automated deduction than 1st-order formalisms. These calculi are usually interpreted as propositional logics: non-logical constants are taken as denoting propositions. However, they can also be given a nominal interpretation in which the constants stand for some kind of object. I show how 0-order logics can be given a spatial interpretation: constants denote regions and logical operators correspond to operations on regions which are important for characterising spatial situations.Representing certain spatial concepts requires the introduction of modal operators, interpreted as functions generating regions related in specific ways to those denoted by their arguments. A significant example is the convex-hull operator whose value is the smallest convex region containing its argument. I investigate how this this operator can be captured in a multi-medal logic. (shrink)

Several authors have suggested that a more parsimonious and conceptually elegant treatment of everyday mereological and topological reasoning can be obtained by adopting a spatial ontology in which regions, not points, are the primitive entities. This paper challenges this suggestion for mereotopological reasoning in two-dimensional space. Our strategy is to define a mereotopological language together with a familiar, point-based interpretation. It is proposed that, to be practically useful, any alternative region-based spatial ontology must support the same sentences in our language (...) as this familiar interpretation. This proposal has the merit of transforming a vague, open-ended question about ontologies for practical mereotopological reasoning into a precise question in model theory. We show that (a version of) the familiar interpretation is countable and atomic, and therefore prime. We conclude that useful alternative ontologies of the plane are, if anything, less parsimonious than the one which they are supposed to replace. (shrink)

Vorlesungen über die Algebra der Logik ist ein unveränderter, hochwertiger Nachdruck der Originalausgabe aus dem Jahr 1890. Hansebooks ist Herausgeber von Literatur zu unterschiedlichen Themengebieten wie Forschung und Wissenschaft, Reisen und Expeditionen, Kochen und Ernährung, Medizin und weiteren Genres. Der Schwerpunkt des Verlages liegt auf dem Erhalt historischer Literatur. Viele Werke historischer Schriftsteller und Wissenschaftler sind heute nur noch als Antiquitäten erhältlich. Hansebooks verlegt diese Bücher neu und trägt damit zum Erhalt selten gewordener Literatur und historischem Wissen auch für die (...) Zukunft bei. (shrink)

"We prove that any variety of relation algebras which contains an algebra with infinitely many elements below the identity, or which contains the full group relation algebra on some infinite group (or on arbitrarily large finite groups), must have an undecidable equational theory. Then we construct an embedding of the lattice of all subsets of the natural numbers into the lattice of varieties of relation algebras such that the variety correlated with a set [italic capital]X of natural numbers has a (...) decidable equational theory if and only if [italic capital]X is a decidable (i.e., recursive) set. Finally, we construct an example of an infinite, finitely generated, simple, representable relation algebra that has a decidable equational theory.'' -- Abstract. (shrink)

Originally published in 1966 On the Syllogism and Other Logical Writings assembles for the first time the five celebrated memoirs of Augustus De Morgan on the syllogism. These are collected together with the more condensed accounts of his researches given in his Syllabus of a Proposed System of Logic an article on Logic contributed to the English Cyclopaedia. De Morgan was among the most distinguished of nineteenth century British mathematicians but is chiefly remembered today as one of the founders of (...) modern mathematical logic. His writings on this subject have been little read, however since apart from his Formal Logic, they lie buried for the most part in inaccessible periodicals. De Morgan's own later amendments are inserted in the text and the editorial introduction gives a summary of the whole and traces in some detail the course of the once-famous feud with Sir William Hamilton of Edinburgh. (shrink)