Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 56, Number 2 (2015), 287-306.
On the Decidability of Axiomatized Mereotopological Theories
The signature of the formal language of mereotopology contains two predicates and , which stand for “being a part of” and “contact,” respectively. This paper will deal with the decidability issue of the mereotopological theories which can be formed by the axioms found in the literature. Three main results to be given are as follows: (1) all axiomatized mereotopological theories are separable; (2) all mereotopological theories up to , , or are finitely inseparable; (3) all axiomatized mereotopological theories except , , or , where is strictly stronger than , are undecidable. Then it can also be easily seen that all axiomatized mereotopological theories proved to be undecidable here are neither essentially undecidable nor strongly undecidable but are hereditarily undecidable. Result (3) will be shown by constructing strongly undecidable mereotopological structures based on two-dimensional Euclidean space, and it will be pointed out that the same construction cannot be carried through if the language is not rich enough.
Notre Dame J. Formal Logic, Volume 56, Number 2 (2015), 287-306.
First available in Project Euclid: 17 April 2015
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Tsai, Hsing-chien. On the Decidability of Axiomatized Mereotopological Theories. Notre Dame J. Formal Logic 56 (2015), no. 2, 287--306. doi:10.1215/00294527-2864307. https://projecteuclid.org/euclid.ndjfl/1429277352