Finitely Inseparable First-Order Axiomatized Mereotopological Theories

• Authors: Hsing-chien Tsai
• Languages of publication: EN

Abstracts

EN

This paper will first introduce first-order mereotopological ax- ioms and axiomatized theories which can be found in some recent litera- ture and it will also give a survey of decidability, undecidability as well as other relevant notions. Then the main result to be given in this paper will be the finite inseparability of any mereotopological theory up to atomic general mereotopology (AGEMT) or strong atomic general mereotopology (SAGEMT). Besides, a more comprehensive summary will also be given via making observations about other properties stronger than undecidability.

Keywords

EN

mereology; mereotopology; decidability; undecidability; separa- bility; inseparability; finite separability; finite inseparability

• Publisher: Uniwersytet Mikołaja Kopernika (Nicolaus Copernicus University in Toruń)
• Journal: Logic and Logical Philosophy
• Year: 2013
• Volume: 22
• Issue: 3
• Pages: 347-363

Dates

published

2013-09-01

online

2013-07-02

Contributors

author

Hsing-chien Tsai

• Department of Philosophy National Chung-Cheng University 168 University Road, Min-Hsiung Chia-Yi, 62102 Taiwan

References

• [1] Casati, R., and A.C. Varzi., Parts and Places, The MIT Press, 1999.
• [2] Clarke, B. L., “A calculus of individuals based on ‘connection’ ”, NotreDame Journal of Formal Logic, 22 (1981): 204-218.
• [3] Enderton, H. B., A Mathematical Introduction to Logic, San Diego, Academic Press, 2001.
• [4] Hodges, W., Model Theory, Cambridge, Cambridge University Press, 1993.
• [5] Monk, J.D., Mathematical Logic, New York, Springer-Verlag, 1976.
• [6] Pratt-Hartmann, I., “First-order mereotopology”, in Handbook of SpatialLogics, M. Aiello, I. Pratt-Hartmann and J. van Benthem (ed.), Dordrecht, Springer, 2007, pp. 13-97.
• [7] Shoenfield, J.R., Mathematical Logic, London, Addison-Wesley, 1967.
• [8] Simons, P., Parts: A Study in Ontology, Oxford, Clarendon Press, 1987.
• [9] Soare, R., Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Springer-Verlag, 1987.
• [10] Tarski, A., A. Mostowski, and R.M. Robinson, Undecidable Theories, Amsterdam, North-Holland Publishing Company, 1953.
• [11] Tarski, A., “On the foundations of Boolean algebra”, in Logic, Semantics,Metamathematics, Oxford, Oxford University Press, 1956.
• [12] Tsai, Hsing-chien, “Decidability of mereological theories”, Logic and Log-ical Philosophy, 18 (2009): 45-63.
• [13] Tsai, Hsing-chien, “More on the decidability of mereological theories”, Logic and Logical Philosophy, 20 (2011): 251-265.
• [14] Tsai, Hsing-chien, “Decidability of General Extensional Mereology”, Stu-dia Logica, 101 (2013), 3: 619-636. DOI: 10.1007/s11225-012-9400-4.[WoS][Crossref]
• [15] Tsai, Hsing-chien, “A comprehensive picture of the decidability of mereological theories”, Studia Logica, DOI: 10.1007/s11225-012-9405-z (2012).[Crossref][WoS]
• [16] Tsai, Hsing-chien, “On the decidability of axiomatized mereotopological theories”, Notre Dame Journal of Formal Logic (forthcoming 2013).
• [17] Whitehead, A.N., Process and Reality, The MacMillan Company, New York, 1929.

Identifiers

DOI

10.12775/LLP.2013.016