Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Casati R., Varzi A.C.: Parts and Places. The MIT Press, Cambridge (1999)
Clay R.E.: Relation of Leśniewski’s mereology to Boolean algebras. Journal of Symbolic Logic 39, 638–648 (1974)
Enderton H.B.: A Mathematical Introduction to Logic. Harcourt Press, San Diego (2001)
Grzegorcyk A.: The systems of Leśniewski in relation to contemporary logical research. Studia Logica 3, 77–97 (1955)
Hodges W.: Model Theory. Cambridge University Press, Cambridge (1993)
Hovda P.: What is classical mereology?. Journal of Philosophical Logic 38, 55–82 (2009)
Leśniewski, S., Foundations of the general theory of sets I’, trans. by D. I. Barnett, in S. Leśniewski (ed.), Collected Works, Volume 1, Kluwer, Dordrecht, 1916 in Polish, 1992 in English.
Monk J.D.: Mathematical Logic. Springer, New York (1976)
Pietruszczak A.: Pieces of Mereology. Logic and Logical Philosophy 14, 211–234 (2005)
Shoenfield J.R.: Mathematical Logic. Addison-Wesley, London (1967)
Simons P.: Parts: A Study in Ontology. Clarendon Press, Oxford (1987)
Taitslin M.A.: Effective inseparability of the set of identically true and the set of finitely refutable formulas of the elementary theory of the lattices. Algebra i logika 1(3), 24–38 (1962)
Tarski A.: Arithmetical classes and types of Boolean algebras. Bulletin of the American Mathematical Society 55, 64 (1949)
Tarski A.: On the foundations of Boolean algebra, in Logic, Semantics, Metamathematics. Oxford University Press, Oxford (1956)
Tarski A., Mostowski A, Robinson R.M.: Undecidable Theories. North-Holland, Amsterdam (1953)
Trachtenbrot B.A.: O recursivno otdelimosti (in Russian). Dokl. Akad. Nauk SSSR 88, 953–955 (1953)
Tsai H.: Decidability of mereological theories. Logic and Logical Philosophy 18, 45–63 (2009)
Tsai H.: More on the decidability of mereological theories. Logic and Logical Philosophy 20, 251–265 (2011)
Tsai, H., Decidability of general extensional mereology, Studia Logica 2012. doi:10.1007/s11225-012-9400-4
Varzi, A.C., Mereology, in Stanford Encyclopedia of Philosophy, 2009.
Author information
Authors and Affiliations
Corresponding author
Additional information
Presented by Richmond Thomason
Rights and permissions
About this article
Cite this article
Tsai, Hc. A Comprehensive Picture of the Decidability of Mereological Theories. Stud Logica 101, 987–1012 (2013). https://doi.org/10.1007/s11225-012-9405-z
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11225-012-9405-z