English

Set-theoretic mereology

Logic 2016-04-27 v2

Abstract

We consider a set-theoretic version of mereology based on the inclusion relation \subseteq and analyze how well it might serve as a foundation of mathematics. After establishing the non-definability of \in from \subseteq, we identify the natural axioms for \subseteq-based mereology, which constitute a finitely axiomatizable, complete, decidable theory. Ultimately, for these reasons, we conclude that this form of set-theoretic mereology cannot by itself serve as a foundation of mathematics. Meanwhile, augmented forms of set-theoretic mereology, such as that obtained by adding the singleton operator, are foundationally robust.

Keywords

Cite

@article{arxiv.1601.06593,
  title  = {Set-theoretic mereology},
  author = {Joel David Hamkins and Makoto Kikuchi},
  journal= {arXiv preprint arXiv:1601.06593},
  year   = {2016}
}

Comments

21 pages; questions and commentary can be made at http://jdh.hamkins.org/set-theoretic-mereology. Version 2 makes various minor improvements and corrections

R2 v1 2026-06-22T12:36:01.369Z