Set-theoretic mereology
Journal Title: Logic and Logical Philosophy - Year 2016, Vol 25, Issue 3
Abstract
We consider a set-theoretic version of mereology based on the inclusion relation ⊆ and analyze how well it might serve as a foundation of mathematics. After establishing the non-definability of ∈ from ⊆, we identify the natural axioms for ⊆-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.
Authors and Affiliations
Joel David Hamkins, Makoto Kikuchi
Keywords
Related Articles
- EP ID EP202147
- DOI 10.12775/LLP.2016.007
- Views 54
- Downloads 0
A Theory of Propositions
In this paper I present a new theory of propositions, according to which propositions are abstract mathematical objects: well-formed formulas together with models. I distinguish the theory from a number of existing views...
Sweet SIXTEEN: Automation via Embedding into Classical Higher-Order Logic
An embedding of many-valued logics based on SIXTEEN in classical higher-order logic is presented. SIXTEEN generalizes the four-valued set of truth degrees of Dunn/Belnap’s system to a lattice of sixteen truth degrees wit...
Rational Agency from a Truth-Functional Perspective
The aim of the present paper is to introduce a system, where the epistemic state of an agent is represented truth-functionally. In order to obtain this system, we propose a four-valued logic, that we call the logic of ra...
Refutation Systems for a System of Nonsense-Logic
In the paper rejection systems for a system of nonsense-logic are investigated. The first rejection system consists of four rejected axioms and only one rejection rule - the rule of rejection by detachment. The second o...
Set-theoretic mereology
We consider a set-theoretic version of mereology based on the inclusion relation ⊆ and analyze how well it might serve as a foundation of mathematics. After establishing the non-definability of ∈ from ⊆, we identify the...