SearcharxivSearch

arXiv · 1901.10442

Distributive Mereotopology: Extended distributive contact lattices

Abstract

Contact algebra is one of the main tools in the region-based theory of space. It is an extension of Boolean algebra with a relation called contact. The elements of the Boolean algebra are considered as formal representations of physical bodies. The contact relation is used also to define some other important mereotopological relations like non-tangential inclusion, dual contact, external contact. Most of these definitions are given by means of the operation of Boolean complementation. There are, however, some problems related to the motivation of this operation. In order to avoid these problems we propose a generalization of the notion of contact algebra by dropping the operation of complement. In this paper we consider as non-definable primitives the relations of contact, nontangential inclusion and dual contact. Part I of the paper is devoted to a suitable axiomatization called extended distributive contact lattice (EDCL) by means of universal first-order axioms true in all contact algebras. EDCL may be considered also as an algebraic tool for certain subarea of mereotopology, called in this paper distributive mereotopology. The main result of Part I of the paper is a representation theorem, stating that each EDCL can be embedded into a contact algebra, showing in this way that the presented axiomatization preserves the meaning of mereotopological relations without considering Boolean complementation. Part II of the paper is devoted to topological representation theory of EDCL, transferring into the distributive case important results from the topological representation theory of contact algebras. It is shown that under minor additional assumptions on distributive lattices as extensionality of the definable relations of overlap or underlap one can preserve the good topological interpretations of regions as regular closed or regular open sets in topological space.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tatyana Ivanova, Dimiter Vakarelov. 2019-01-29. Distributive Mereotopology: Extended distributive contact lattices. https://doi.org/10.1007/s10472-016-9499-5

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO