This article introduces finitist set theory (FST) and shows how it can be applied in modeling finite nested structures. Mereology is a straightforward foundation for transitive chains of part-whole relations between individuals but is incapable of modeling antitransitive chains. Traditional set theories are capable of modeling transitive and antitransitive chains of relations, but due to their function as foundations of mathematics they come with features that make them unnecessarily difficult in modeling finite structures. FST has been designed to function as (...) a practical tool in modeling transitive and antitransitive chains of relations without suffering from difficulties of traditional set theories, and a major portion of the functionality of discrete mereology can be incorporated in FST. This makes FST a viable collection theory in ontological modeling. (shrink)

The transitivity of the relation of part to whole is often questioned. But it is among the most basic principles of mereology. In this paper we present a general solution to the problem of transitivity of parthood which may be satisfactory for both its advocates and its opponents. We will show that even without the transitivity of parthood one can define—basic in mereology—the notion of being a mereological sum of some objects. We formulate several proposals of general approaches to the (...) concept of being a part of a whole, none of which contains any existential assumptions. By adding the transitivity of parthood we obtain an axiomatization of “existentially neutral” mereology. (shrink)

An overview of contemporary part-whole theories, with reference to both their axiomatic developments and their philosophical underpinnings.

In 2013, Bennett proposed a mereological theory in which the parthood relation is defined on the basis of two primitive relations: a is a part of b iff a fills a slot owned by b. However, this theory has issues counting how many parts an entity has. We explore the various counting problems and propose a new theory to solve them. Keeping the core idea of Bennett’s slots, this theory introduces mereological relations between slots. This theory enables us to solve (...) all known counting problems and to go beyond the limits of Bennett’s theory by theorising expected features of mereological theories: supplementation principles and mereological sum and fusion. The theory is illustrated on ontological issues on the nature of structural universals and informational entities. (shrink)