On the Decidability of Axiomatized Mereotopological Theories

Notre Dame Journal of Formal Logic 56 (2):287-306 (2015)
  Copy   BIBTEX

Abstract

The signature of the formal language of mereotopology contains two predicates $P$ and $C$, 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: all axiomatized mereotopological theories are separable; all mereotopological theories up to $\mathbf{ACEMT}$, $\mathbf{SACEMT}$, or $\mathbf{SACEMT}^{\prime}$ are finitely inseparable; all axiomatized mereotopological theories except $\mathbf{SAX}$, $\mathbf{SAX}^{\prime}$, or $\mathbf{S\overline{B}X}^{\prime}$, where $\mathbf{X}$ is strictly stronger than $\mathbf{CEMT}$, 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 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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

More on The Decidability of Mereological Theories.Hsing-Chien Tsai - 2011 - Logic and Logical Philosophy 20 (3):251-265.
Mereotopological Connection.Anthony G. Cohn & Achille C. Varzi - 2003 - Journal of Philosophical Logic 32 (4):357-390.
Decidability of mereological theories.Hsing-Chien Tsai - 2009 - Logic and Logical Philosophy 18 (1):45-63.
Ontologies for Plane, Polygonal Mereotopology.Ian Pratt & Oliver Lemon - 1997 - Notre Dame Journal of Formal Logic 38 (2):225-245.
New Consecution Calculi for R→t.Katalin Bimbó & J. Michael Dunn - 2012 - Notre Dame Journal of Formal Logic 53 (4):491-509.
Degrees joining to 0'. [REVIEW]David B. Posner & Robert W. Robinson - 1981 - Journal of Symbolic Logic 46 (4):714 - 722.
A modal approach to dynamic ontology: modal mereotopology.Dimiter Vakarelov - 2008 - Logic and Logical Philosophy 17 (1-2):163-183.
Interpretability degrees of finitely axiomatized sequential theories.Albert Visser - 2014 - Archive for Mathematical Logic 53 (1-2):23-42.
Hereditary undecidability of some theories of finite structures.Ross Willard - 1994 - Journal of Symbolic Logic 59 (4):1254-1262.
Decidable and undecidable prime theories in infinite-valued logic.Daniele Mundici & Giovanni Panti - 2001 - Annals of Pure and Applied Logic 108 (1-3):269-278.
Decidability of an Xstit Logic.Gillman Payette - 2014 - Studia Logica 102 (3):577-607.

Analytics

Added to PP
2015-04-17

Downloads
48 (#323,919)

6 months
12 (#200,125)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Hsing-Chien Tsai
National Chung Cheng University

Citations of this work

Notes on models of first-order mereological theories.Hsing-Chien Tsai - 2015 - Logic and Logical Philosophy 24 (4).

Add more citations

References found in this work

A calculus of individuals based on "connection".Bowman L. Clarke - 1981 - Notre Dame Journal of Formal Logic 22 (3):204-218.
Decidability of mereological theories.Hsing-Chien Tsai - 2009 - Logic and Logical Philosophy 18 (1):45-63.
Constructive version of Boolean algebra.F. Ciraulo, M. E. Maietti & P. Toto - 2013 - Logic Journal of the IGPL 21 (1):44-62.

View all 6 references / Add more references