A Comprehensive Picture of the Decidability of Mereological Theories

Studia Logica 101 (5):987-1012 (2013)
The signature of the formal language of mereology contains only one binary predicate which stands for the relation “being a part of” and it has been strongly suggested that such a predicate must at least define a partial ordering. Mereological theories owe their origin to Leś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
Keywords Mereology  Boolean algebra  Decidability  Undecidability  Separability  Inseparability
Categories (categorize this paper)
DOI 10.1007/s11225-012-9405-z
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 21,496
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Wilfrid Hodges, Model Theory. Stanford Encyclopedia of Philosophy.
Joseph R. Shoenfield (1967). Mathematical Logic. Reading, Mass.,Addison-Wesley Pub. Co..
Paul Hovda (2009). What Is Classical Mereology? Journal of Philosophical Logic 38 (1):55 - 82.

View all 12 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Gabriel Uzquiano (2011). Mereological Harmony. In Karen Bennett & Dean Zimmerman (eds.), Oxford Studies in Metaphysics. Oxford University Press

Monthly downloads

Added to index


Total downloads

29 ( #141,427 of 1,911,838 )

Recent downloads (6 months)

1 ( #458,984 of 1,911,838 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.