科研之友
微信
新浪微博
Facebook
分享链接
摘要
The signature of the formal language of mereology contains only one binary predicate which stands for the relation %26quot;being a part of%26quot; and it has been strongly suggested that such a predicate must at least define a partial ordering. Mereological theories owe their origin to LeA %26gt; niewski. However, some more recent authors, such as Simons as well as Casati and Varzi, have reformulated mereology in a way most logicians today are familiar with. It turns out that any theory which can be formed by using the reformulated mereological axioms or axiom schemas is in a sense a subtheory of the elementary theory of Boolean algebras or of the theory of infinite atomic Boolean algebras. It is known that the theory of partial orderings is undecidable while the elementary theory of Boolean algebras and the theory of infinite atomic Boolean algebras are decidable. In this paper, I will look into the behaviors in terms of decidability of those mereological theories located in between. More precisely, I will give a comprehensive picture of the said issue by offering solutions to the open problems which I have raised in some of my papers published previously.
- 出版日期2013-10
