Full-text resources of CEJSH and other databases are now available in the new Library of Science.
Visit https://bibliotekanauki.pl

PL EN


2011 | 20 | 3 | 251-265

Article title

More on The Decidability of Mereological Theories

Title variants

Languages of publication

EN

Abstracts

EN
Quite a few results concerning the decidability of mereological theories have been given in my previous paper. But many mereological theories are still left unaccounted for. In this paper I will refine a general method for proving the undecidability of a theory and then by making use of it, I will show that most mereological theories that are strictly weaker than CEM are finitely inseparable and hence undecidable. The same results might be carried over to some extensions of those weak theories by adding the fusion axiom schema. Most of the proofs to be presented in this paper take finite lattices as the base models when applying the refined method. However, I shall also point out the limitation of this kind of reduction and make some observations and conjectures concerning the decidability of stronger mereological theories.

Year

Volume

20

Issue

3

Pages

251-265

Physical description

Dates

published
2011-09-01
online
2013-07-02

Contributors

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

References

  • Casati, R., and A.C. Varzi 1999, Parts and Places, The MIT Press.
  • Clay, R.E., 1974, “Relation of Leśniewski’s Mereology to Boolean Algebras’, Journal of Symbolic Logic 39: 638-648.
  • Enderton, H.B., 1972, A Mathematical Introduction to Logic, San Diego: Aca- demic Press.
  • Grzegorcyk, A., 1955, “The systems of Leśniewski in relation to contemporary logical research”, Studia Logica 3: 77-95.
  • Monk, J.D., 1976, Mathematical Logic, New York: Springer-Verlag.
  • Simons, P., 1987, Parts: A Study in Ontology, Oxford: Clarendon Press.
  • Tarski, A., 1949, “Arithmetical classes and types of Boolean algebras”, Bull. Amer. Math. Soc 55: 64.
  • Tarski, A., 1956, “On the foundations of Boolean algebra’, pages 320-341 in: Logic, Semantics, Metamathematics, Clarendon Press, Oxford.
  • Tsai, Hsing-chien, 2009, “Decidability of mereological theoreis”, Logic and Log-ical Philosophy 18: 45-63.

Document Type

Publication order reference

Identifiers

YADDA identifier

bwmeta1.element.doi-10_2478_llc-2011-0015
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.