Description

• Title:
  Decidability of mereological theories
• Creator:
  Tsai, Hsing-chien
• Description:
  Mereological theories are theories based on a binary predicate ‘being a part of’. It is believed that such a predicate must at least define a partial ordering. A mereological theory can be obtained by adding on top of the basic axioms of partial orderings some of the other axioms posited based on pertinent philosophical insights. Though mereological theories have aroused quite a few philosophers’ interest recently, not much has been said about their meta-logical properties. In this paper, I will look into whether those theories are decidable or not. Besides, since theories of Boolean algebras are in some sense upper bounds of mereological theories which can be found in the literature, I shall also make some observations about the possibility of getting mereological theories beyond Boolean algebras.
• Object availability:
  free access
• Rights:
  Prawa autorskie (c) 2017 Logic and Logical Philosophy
• Date:
  2009.08.15
• Type:
  info:eu-repo/semantics/article;
  info:eu-repo/semantics/publishedVersion
• Language:
  English
• Source:
  Logic and Logical Philosophy; Vol. 18 No. 1 (2009); 45-63;
  Logic and Logical Philosophy; Tom 18 Nr 1 (2009); 45-63;
  2300-9802;
  1425-3305
• Format:
  application/pdf
• Publisher:
  Uniwersytet Mikołaja Kopernika w Toruniu
• Relation: https://apcz.umk.pl/LLP/article/view/LLP.2009.004/985
• Subject:
  mereology;
  mereological theories;
  part-whole relation;
  decidability;
  undecidability
• Identifier: https://apcz.umk.pl/LLP/article/view/LLP.2009.004
• Data provider:
  Akademicka Platforma Czasopism
• Can I use it?:
  seek permission
• Type:
  text