##
**The relations of supremum and mereological sum in partially ordered sets.**
*(English)*
Zbl 1436.06006

Calosi, Claudio (ed.) et al., Mereology and the sciences. Parts and wholes in the contemporary scientific context. Cham: Springer. Synth. Libr. 371, 123-140 (2014).

Summary: This paper is devoted to mutual relationship between the relations of mereological sum and least upper bound (supremum) in partially ordered sets. We are mainly interested in the following problem: under what conditions (axioms) put on mereological sum the both relations coincide? The mutual relation between the relations in question is, among others, the object of scientific scrutiny in A. Pietruszczak [Log. Log. Philos. 14, No. 2, 211–234 (2005; Zbl 1117.03018); Metamereologia (in Polish). Toruń: Nicolaus Copernicus University Press (2000)]. There it is shown that in the so called classical mereology, which is the contemporary version of Stanisław Leśniewski’s original system, mereological sum coincides with supremum relation. The first one to prove this property, in original language of Leśniewski’s mereology, was [A. Tarski, in: Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6–8, 1993. Wien: Springer. 24–84 (1998; Zbl 0900.03045)]. The paper starts with some refresher on basic notions from both mereology and ordered sets theory with particular emphasis on supremum relation. We point to some basic properties of supremum which later in the paper we mirror by axioms put on the mereological sum relation and show their consequences. Then we prove that by imposing different requirements on mereological sum we indeed can obtain the equality between sum and supremum. In the final part of the paper we change the perspective and introduce a class of some particular ordered sets that we call mereological posets, in which by a suitable axiom we directly require that sum coincide with supremum. Although we do not give full characterization of such structures we reveal some interesting properties of theirs.

For the entire collection see [Zbl 1327.03002].

For the entire collection see [Zbl 1327.03002].

### MSC:

06A06 | Partial orders, general |

PDFBibTeX
XMLCite

\textit{R. Gruszczyński} and \textit{A. Pietruszczak}, Synth. Libr. 371, 123--140 (2014; Zbl 1436.06006)

Full Text:
DOI

### References:

[1] | Gruszczyński, R., & Pietruszczak, A. (2008). Full development of Tarski’s geometry of solids. Bulletin of Symbolic Logic, 14, 481-540. · Zbl 1156.03011 · doi:10.2178/bsl/1231081462 |

[2] | Gruszczyński, R., & Pietruszczak, A. (2009). Space, points and mereology. On foundations of point-free Euclidean geometry. Logic and Logical Philosophy, 18, 145-188. · Zbl 1186.03019 |

[3] | Gruszczyński, R., & Pietruszczak, A. (2010). How to define a collective (mereological) set. Logic and Logical Philosophy, 19, 309-328. · Zbl 1243.03067 |

[4] | Grzegorczyk, A. (1955). The systems of Leśniewski in relation to contemporaty logical research. Studia Logica, 3, 77-97. · doi:10.1007/BF02067248 |

[5] | Grzegorczyk, A. (1960). Axiomatizability of geometry without points. Synthese, 12(2-3), 228-235. · Zbl 0201.32104 · doi:10.1007/BF00485101 |

[6] | Leśniewski, S. (1930). O podstawach matematyki. Przeglad Filozoficzny, XXXIII, 77-105. |

[7] | Pietruszczak, A. (2000). Metamereologia (in Polish). Toruń: Nicolaus Copernicus University Press. |

[8] | Pietruszczak, A. (2005). Pieces of mereology. Logic and Logical Philosophy, 14(2), 211-234. · Zbl 1117.03018 · doi:10.12775/LLP.2005.014 |

[9] | Simons, P. (1987). Parts: A study in ontology. Oxford: Clarendon. |

[10] | Tarski, A. |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.