Finitist set theory

Finitist set theory (FST)[1] is a collection theory designed for modeling finite nested structures of individuals and a variety of transitive and antitransitive chains of relations between individuals. Unlike classical set theories such as ZFC and KPU, FST is not intended to function as a foundation for mathematics, but only as a tool in ontological modeling. FST functions as the logical foundation of the classical layer-cake interpretation,[2] and manages to incorporate a large portion of the functionality of discrete mereology. FST models are of type {Uα,Sβ,∈}, which is abbreviated as ℳα,β. Uα is the collection of ur-elements of model ℳα,β. Ur-elements (urs) are indivisible primitives. By assigning a finite integer such as 2 as the value of α, it is determined that Uα contains exactly 2 urs. Sβ is a collection whose elements will be called sets. β≥0 is a finite integer which denotes the maximum rank (nesting level) of sets in Sβ. Every set in Sβ has one or more sets or urs or both as members. The assigned α and β and the applied axioms fix the contents of Uα and Sβ. To facilitate the use of language, expressions such as "sets that are elements of Sβ of model ℳα,β and urs that are elements of Uα of model ℳα,β" are abbreviated as "sets and urs that are elements of ℳα,β".

FST’s formal development conforms to its intended function as a tool in ontological modeling. The goal of an engineer who applies FST is to select axioms which yield a model that is one to one correlated with a target domain that is to be modeled by FST, such as a range of chemical compounds or social constructions that are found in nature. The target domain gives the engineer an intuition about the contents of the FST model that ought to be one-one correlated with it. FST provides a framework that facilitates selecting specific axioms that yield the one to one correlation. The axioms of extensionality and restriction are postulated in all versions of FST, but set construction axioms (nesting- axioms and union-axioms) vary; the assignment of finite integer values to α and β is implicit in the selected set construction axioms.

FST is thereby not a single theory, but a name for a family of theories or versions of FST, where each version has its own set construction axioms and a unique model ℳα,β, which has a finite cardinality and all its sets have a finite rank and cardinality. FST axioms are formulated by first-order logic complemented by the member of relation ∈. All versions of FST are first-order theories. In the axioms and definitions, symbols x,y,z,v,w are variables for sets, r,s,t are variables for both sets and urs, u is a variable for urs, and a,b,c,d denote individual urs of a model. The symbols for urs may appear only on the left side of ∈. The symbols for sets may appear on both u∈y.

An applied FST model is always the minimal model which satisfies the applied axioms. This guarantees that those and only those elements exist in the applied model which are explicitly constructed by the selected axioms: only those urs exist which are stated to exist by assigning their number, and only those sets exist which are constructed by the selected axioms; no other elements exist in addition to these. This interpretation is needed, for typical FST axioms which generate e.g. exactly one set {a} do not otherwise exclude sets such as {{a}},{{{a}}},….

## Contents

* 1 Complete FST models
* 2 FST definitions
* 3 Definitions that incorporate the functionality of discrete mereology
* 4 Notes

## Complete FST models

Complete FST models contain all permutations of sets and urs within the limits of α and β. The axioms for complete FST models are extensionality, restriction, singleton sets and union of sets. Extensionality and restriction are axioms of all versions of FST, whereas the axiom for singleton sets is a provisional nesting-axiom (Γ-axiom) and the axiom of union of sets is a provisional union-axiom (∪-axiom).

* Ax. Extensionality: ∀r(r∈x↔r∈y)↔x=y. Set x is identical to set y iff (if and only if) x and y have the identical members, may these be sets, urs or both.
* Ax. Restriction: ∀x∃r(r∈x). Every set has either a set or an ur as a member. The empty set {} has no members, and therefore there exists no such thing as {} in FST. Urs are the only ∈-minimal elements in FST. Every FST set contains at least one ur as the ∈-minimal member on the bottom.
* Ax. Singleton Sets: ∀r<β∃x∀s(s=r↔s∈x). For every ur and set r that has a rank smaller than β, there exists the singleton set x={r}. The rank restriction (r<β) in the axiom does the job of the axiom of foundation of traditional set theories: constraining the rank of sets to an assigned finite β entails that there are no non-wellfounded sets, for such sets would have a transfinite rank. Given urs a and b in ℳ2,1, the axiom of singleton sets generates only sets {a} and {b}, whereas the axiom of pairing of traditional set theories generates {a}, {b} and {a,b}.
* Ax. Union of Sets: ∀x∀y∃z∀r((r∈x∨r∈y)↔r∈z). For all sets x and y, there exists set z which contains as members all those and only those sets and urs that are members of x, members of y, or members of both x and y. For instance, if sets {a} and {b} exist, the axiom of union of sets states that the set {a,b} exists. If sets {a,b} and {b,c} exist, the axiom states that {a,b,c} exists. If {a} and {{b}} exist, the axiom states that {a,{b}} exists. This axiom is different from the axiom of union of traditional set theories.[3]

Complete FST models ℳα,β contain all permutations of sets and urs within limits of the assigned α and β. The cardinality of ℳα,β is its number of sets and urs sets(α,β)+α. Consider some examples.

ℳ1,0: One ur a exists. card(ℳ1,0)=sets(1,0)+1=0+1=1
ℳ2,0: Two urs a,b exist. card(ℳ2,0)=sets(2,0)+2=0+2=2.
ℳ1,1: One ur a and the set {a} exist. card(ℳ1,0)=sets(α,β)+α=sets(1,1)+1=1+1=2.
ℳ2,1: Two urs a,b and sets {a}, {b}, {a,b} exist. card(ℳ2,1)=sets(2,1)+2=3+2=5.
ℳ1,2: One ur a and sets {a}, {{a}}, {a,{a}} exist. card(ℳ1,2)=sets(1,2)+1=3+1=4.

The recursive formula sets(α,β) gives the number of sets in ℳα,β:

sets(α,0)=0.
sets(α,1)=2α−1.
sets(α,β)=2α+sets(α,β−1)−1.

In ℳ2,2 there are sets(2,2)=22+sets(2,1)−1=22+3−1=31 sets.

In ℳ2,3 there are sets(2,3)=22+31−1=233−1 sets.

## FST definitions

FST definitions should be understood as practical naming conventions which are used in stating that the elements of an applied FST model are or are not interrelated in specific ways. The definitions ought not be seen as axioms: only axioms entail existence of elements of an FST model, not definitions. In order to avoid conflicts (especially with axioms for incomplete FST models), the definitions must be subjugated to the applied axioms with the given α and β. To illustrate a seeming conflict, suppose that {a,b} and {b,c} are the only sets of the applied model. The definition of intersection states that {a,b}∩{b,c}={b}. As {b} does not exist in the applied model, the definition of intersection may appear to be an axiom. However, this is only apparent, for {b} does not have to exist in order to state that the only common element of {a,b} and {b,c} is b, which is the function of the definition of intersection. Similarly with all definitions.

* Def. Rank. The rank of a set is the formal analog of the level of an individual. That the rank of set x is n, is written as rank(x)=n, and abbreviated as xβ in some nesting-axioms. As a convention, the rank of an ur-element is 0. As there is no empty set in FST, the smallest possible rank of a FST set is 1, whereas in traditional set theories the rank of \\{\\} is 0. The rank of set z is defined as the greatest nesting level of all ∈-minimal elements of z. The rank of {a} is 1, as the nesting level of a in {a} is 1. The rank of {{a}} is 2, as a is nested by two concentric sets. The rank of {{a},a} is 2, as 2 is the greatest nesting level of all ∈-minimal elements of {{a},a}. The rank of {{{a}}} is 3, the rank of {{{{a}}}} is 4, and so on. Formally:

rank(s)=0↔s is an ur-element.
rank(s)≥n, where n≥1, is defined as: ∃s1,s2,…,sn(s1∈s2∈…∈sn∈s).
rank(s)=n, where n≥1, is defined as: rank(s)≥n∧¬(rank(s)≥n+1).

By applying the definition of n-member (below) rank can be defined as:
rank(s)=0↔s is an ur-element.
rank(r)=n, is defined as ∃a(a∈nx)∧∃a(a∈n+1x).

* Def. Subset: ∀r(r∈x->r∈y), is denoted as x⊆y. x is a subset of y iff every member of x is a member of y. Examples: {a}⊆{a}; {a,b}⊆{a,b,c}. That x is not a subset of y is written as x⊈y. Examples: {a}⊈{b}; {a,b}⊈{b,c}. Due to the exclusion of the empty set {}, in FST x⊆y means that all members of x are members of y, and there exists at least one member in x and at least one member in y. In traditional set theories where {} exist, x⊆y means that x does not have any members that are {\it not} members of y. Therefore in traditional set theories, {}⊆y holds for every y.

* Def. Proper Subset: x⊆y∧y⊈x, is denoted as x⊂y. x is a proper subset of y iff x is a subset of y and y is not a subset of x. Examples: {a}⊂{a,b}; {a,b}⊂{a,b,c}. That x is not a proper subset of y is written as x⊄y. Examples: {a}⊄{a}; {a,b,c}⊄{a,b}. In FST, x⊂y means that all members of x are members of y, there exists at least one member in x, at least two members in y, and at least one member of y is not a member of x. In traditional set theories, x⊂y means that x does not have any members that are {\it not} members of y, and y has at least one member that is not a member of x. Therefore in traditional set theories, {}⊂y holds for every y where y≠{}.

* Def. Disjointness: ∃r(r∈x∧r∈y), is denoted as x≀y. x and y are disjoint iff they do not have any common members. Examples: {a}≀{b} (when a≠b); {a}≀{{a}}.

* Def. Overlap: ∃r(r∈x∧r∈y), is denoted as x∘y. x and y overlap iff they have one or more common members. Examples: {a}∘{a}; {a,b}∘{b,c}. Disjointness is the contrary of overlap: x∘y↔¬(x≀y); ¬(x∘y)↔x≀y.

* Def. Intersection: ∀r((r∈x∧r∈y)↔r∈z), is denoted as z=x∩y. The intersection of x and y, z=x∩y, contains those and only those sets and ur-elements that are members of both x and y. Examples: {a}∩{a}={a}; {a,b,c}∩{b,c,d}={b,c}. As the empty set does not exist in FST, the intersection of two disjoint sets does not exist. When r≠s, {r}∩{s}=y is not true for any y. In this case, the disjointness relation ≀ can be used: {r}≀{s}. In traditional set theories the intersection of two disjoint sets {\it is} the empty set: {a}∩{b}={}. If the axiom of restriction were deleted and the existence of the empty set were postulated, this would still not imply that the empty set {\it is} the intersection of two disjoint sets.

* Def. Union: ∀r((r∈x∨r∈y)↔r∈z), is denoted as z=x∪y. Set z contains as members all those sets and ur-elements that are members of x, members of y, or members of both x and y. Examples: {a}∪{a}={a}; {a,b}∪{b,c}={a,b,c}; {a}∪{{b}}={a,{b}}.

* Theorem of Weak Supplementation: x⊂y->∃z(z⊂y∧z≀x). [4] Weak supplementation (WS) expresses that a proper subset x of y is not the whole y, but must be supplemented by another subset z to compose y, where z and x are disjoint. In FST, when x is a proper subset of y, then y has another subset z that is disjoint with x. For instance, {a}⊂{a,b}->({b}⊂{a,b}∧{b}≀{a}) is true in all FST models which contain the set {a,b}.

* Def. Difference: ∀r(r∈z↔(r∈x∧r∉y)), is denoted as z=x∖y. The difference z of x and y contains every member of x that is not a member of y. Examples: {a}∖{b}={a}; {a,b,c}∖{a,b}={c}. As the empty set does not exist, it cannot be stated that {x}∖{x}={}. If x is a subset of y, there does not exist z such that z=x∖y: ∀x,y(x⊆y↔∃z(z=x∖y)).

* Def. Cardinality. Cardinality denotes the number of members of a set. Cardinality is defined only for sets: ur-elements do not have a cardinality. The cardinality of {r} is 1, disregarding whether r is a set or an ur-element. The lowest possible cardinality of an FST set is 1, whereas in traditional set theories the cardinality of {} is 0. card(x)=n means that the cardinality of set x is n. E.g. card({y,z})=2, card({x,y,{z}})=3, card({x,{x},{{x}}})=3, and card({x,y,z,w})=4.

card(x)=1 is defined as: ∃s(s∈x∧∀r(r∈x↔r=s)).

card(x)≥n, where n≥2, is defined as: ∃s1,s2,…,sn((⋀k=1nsk∈x)∧⋀a=1n−1⋀b=a+1nsa≠sb).

card(x)=n, where n≥2 is defined as: card(x)≥n∧¬(card(x)≥n+1).

* Def. Power Set: ∀z(z∈y↔z⊆x), denoted as y=P(x). Examples: P({r})={{r}}; P({r,s})={{r},{s},{r,s}}. Power sets in FST do not contain the empty set, and thus card(P(x))=2card(x)−1. In FST power set is not required in building sets, whereas e.g. in ZF set theory the axiom of power set is essential in building the hierarchy transfinite sets. In ZF power sets contain the empty set, e.g. as in P({y,x})={{},{y},{z},{y,z}}, which makes card(P(x))=2card(x).

* Def. n-Member and Partition Level:

r∈1x is defined as r∈x.

r∈2x is defined as ∃y(r∈y∈x).

r∈nx, where n≥2, is defined as ∃y(r∈n−1y∈x).

That r∈1x holds can be stated by saying that r exists in the first partition level of x. That r∈2x holds can be stated by saying that r exists in the second partition level of x. And so forth. [5]

* Def. [nm] Members.

r∈[nm]x, where n≤m, is defined as: r∈nx∨r∈n+1x∨r∈n+2x∨…∨r∈mx.

r is an n-to-m member of x when r is an n-member of x or an n+1-member of x or \ldots or an m-member of x.

* Def. Partition Set. A partition set that contains all n-members of a set is defined as:

partition1(x)=x.

partition2(x)=y is defined as: ∀r(r∈2x↔r∈y).

partitionn(x)=y is defined as: ∀r(r∈nx↔r∈y).

* Def. Transitive Closure: ∀r(r∈[1rank(x)]x↔r∈y), denoted as y=Tc(x). y=Tc(x) means that set y is the transitive closure of set x. y contains all sets and ur-elements of the input set x, i.e., the whole inner structure of x. Examples:

Tc({{a,b}})={a,b,{a,b}}.

Tc({{{a}}})={a,{a},{{a}}}.

Tc({a,{a}})={a,{a}}.

## Definitions that incorporate the functionality of discrete mereology

As transitive theories, Mereology and Boolean algebra are incapable of modeling nested structures. It is therefore intelligible to take FST or another intransitive theory as primary in modeling nested structures. However, also the functionality of transitive theories finds application in modeling nested structures. A large portion of the functionality of discrete mereology (DM) can be incorporated in FST, in terms of relations which mimic DM's relations.

DM operates with structureless aggregates such as ab that consists of urs a,b, and abcd that consists of urs a,b,c,d. DM's ⪯ and other relations defined in terms of ⪯ characterize relations between aggregates such as in ab⪯abcd and ad⪯abcd. An axiomatization of DM and some definitions are given; some definitions are prefixed by m to distinguish them from FST's definitions with the same names.

* ax. extensionality x=y↔∀w(w⪯x↔w⪯y).
* ax. reflexivity ∀x(x⪯x).
* ax. transitivity: ∀x,y,z(x⪯y⪯z->x⪯z).
* def. proper part: x⪯y∧y⪯̸x, denoted as x≺y.
* def. ur-element: ∃x(x≺y), denoted as ur(y).
* ax. discreteness: ∀x∃y(ur(y)∧y⪯x).
* def. m-overlap: ∃z(z⪯x∧z⪯y), denoted as x⊙y.
* def. m-disjointness: ∃z(z⪯x∧z⪯y), denoted as x Ø y.
* def. m-intersection: ∀w((w⪯x∧w⪯y)↔w⪯z), denoted as z=x⊗y.
* def. m-union: y⪯z∧x⪯z∧∀w((y⪯w∧x⪯w)->z⪯w), denoted as z=x⊕y.
* def. m-difference: ∀w(w⪯z↔(w⪯x∧w⪯̸y)), denoted as z=x⊖y.

A large portion of the functionality of DM can be incorporated in FST by defining a relation analogous to DM's primitive ⪯ in terms of FST's membership. Although the identical symbol '⪯' is used with DM and the goal is to mimic DM functionality, FST's ⪯ may hold only between elements of a FST model, i.e., nothing is added to the applied FST models. As always, variables x,y,z,w denote FST sets and u denotes an ur-element.

The basic idea is that membership and FST's basic relations defined in terms of membership are structural, whereas FST's ⪯ and relations defined in terms of ⪯ are structure-independent or structure-neutral. That ∈ and ⊂ are structural means that they are sensitive to nested structures of sets: when it is known that u∈y holds it is known that u is a member of y and exists in the first partition level of y, and when it is known that x⊆y holds it is known that all members of x are members of y and exists in the first partition level of y. In contrast, when it is known e.g. that u⪯y holds, it is not known on which specific level of y does u exist. ⪯ is characterized as structure-neutral because it allows u existing in whatever partition level of y. ⪯ is applied in talking about structural FST sets in a structure-neutral way. Similarly as with ∈, symbols for urs may appear only the left side of ⪯. Consider the definitions:

* def. ur part: u∈[1rank(y)]y, denoted as u⪯y.
* def. part: ∀u(u∈[1rank(x)]x->u∈[1rank(y)]y), denoted as x⪯y.
* def. proper part: x⪯y∧y⪯̸x, denoted as x≺y.

When u⪯y holds, u exists in some level of set y. For instance, a⪯{b,{a,b}} holds. When x⪯y holds, every ur in any level of x exists in some level of y. For instance, {a,b}⪯{b,{a,b}} holds. Accordingly, y⪯̸x means that there is an ur in some level of y that is not in any level of x. By the definition of proper part, e.g. {a,b}≺{{a,b},{c,d}} and {c,d}≺{{a,b},{c,d}} hold. Given any kind of a membership hierarchy whatsoever, such as a∈x∈y, also a⪯x⪯y holds; given any kind of a subset hierarchy such as x⊂y⊂z, also x⪯y⪯z holds; given any kind of a hierarchy which is a combination of membership and subset relations such as a∈x⊂y, also a⪯x⪯y holds. Note that x⊂y->x⪯y holds whereas x⊂y->x≺y does not hold in all FST models, such as in the case where x={a,b} and y={a,b,{a}}. Fine (2010, p. 579) notes that also chains of relations such as r∈v⊂y≺w may be used; such chains have now been given an axiomatic base.

The following translations of DM axioms into the terminology of FST show that FST's ⪯ is congenial with DM's axioms of reflexivity, transitivity and discreteness, but that DM extensionality must be modified by changing one of its equivalence relations into an implication. This reminds that FST sets are structural whereas DM aggregates are structureless.

* Extensionality: x=y↔∀w(w⪯x↔w⪯y). This axiom does not hold, for x and y may be unidentical sets even if every ur in any level of x is found in some level of y and vice versa, such as when x={{a,b},{c,d}} and y={{a,c},{b,d}}. However, x=y->∀w(w⪯x↔w⪯y) holds, for the identity of x and y implies that every ur that is found in some level of x is found in some level of y and vice versa.
* reflexivity: ∀x(x⪯x). Every ur that is found in some level of x is found in some level of x.
* transitivity: ∀x,y,z(x⪯y⪯z->x⪯z). If every ur that is found in some level of x is found in some level of y and every ur that is found in some level of y is found in some level of z, then every ur that is found in some level of x is found in some level of z.
* discreteness: ∀x∃u(u⪯x). Every set contains at least one ur in some level.

To illustrate how FST's ⪯ can be applied as a structure-neutral relation in talking about structural sets, consider translations of examples (1-2) where only mereology is applied, into (1'-2') where FST's ⪯ is be applied together with membership.

1\. A handle is a part of a door; a door is a part of a house; but the handle is not a part of the house.:
1'. A handle is a part of a door and a member of a door: handle ⪯ door; handle ∈ door. The door is a part of a house and a member of the house: door ⪯ house; door ∈ house. The handle is a part of the house but not a member of the house: handle ⪯ house; handle ∉ house.:
door={handle,…}.:
house={door,…}={{handle,…},…}.

2\. A platoon is part of a company; a company is part of a battalion; but a platoon is not a part of a battalion.:
2'. A platoon is part of a company and a member of a company; a company is a part of a battalion and a member of the battalion; a platoon is a part of a battalion but not a member of a battalion.:

As ⪯ has been defined, all DM relations that are defined in terms of ⪯ can be considered as FST definitions, including m-overlap, m-disjointness, m-intersection, m-union and m-difference.

* Def. m-overlap: ∃r(r⪯x∧r⪯y), denoted as x⊙y. At least one ur in some level of x is found in some level of y.
* Def. m-disjointness: ∃r(r⪯x∧r⪯y), denoted as x Ø y. No ur in any level of x is found in any level of y.
* Def. m-intersection: ∀w((w⪯x∧w⪯y)↔w⪯z), denoted as z=x⊗y. z is the set of all urs that are found in some levels of both x and y.
* Def. m-union: y⪯z∧x⪯z∧∀w((y⪯w∧x⪯w)->z⪯w), denoted as z=x⊕y. z is the set of all urs in any level of x or y or both.
* Def. m-difference: ∀w(w⪯z↔(w⪯x∧w⪯̸y)), denoted as z=x⊖y. z is the set of all urs that are in some level of x but not in any level of y.

Regarding the definitions of m-intersection, m-union and m-difference, in complete FST models all sets z exist. In some incomplete FST models some z do not exist. For instance, when {a,b} and {b,c} are the only sets in the applied model, the definition of m-intersection states that {a,b}⊗{b,c}={b}, which makes the definition appear as an axiom. As indicated above, the definition is not interpreted as an axiom, but only as a formula which states that b is found in some level of both {a,b} and {b,c}.

## Notes

1. ↑ Avril Styrman and Aapo Halko (2018) "Finitist set theory in ontological modeling." Applied Ontology, vol. 13, no. 2, pp. 107-133, 2018. doi:10.3233/AO-180196.
2. ↑ Wimsatt, W.C. (2006). The ontology of complex systems: Levels of organization, perspectives, and causal thickets. Canadian Journal of Philosophy, Supplementary, 20, 207–274. Fine, K. (2010). Towards a theory of part. The Journal of Philosophy, 107(11), 559–589. doi:10.5840/jphil20101071139.
3. ↑ For instance, KPU's axiom of union gives the set that contains all members of members of a set, i.e, the existence of {a,b,c} is implied by e.g. by the existence of {{a,b},{c}}, as the members of members of {{a,b},{c}} are members of {a,b,c}. Although such features are applied generating ordinal numbers, they are not needed in modelling finite nested structures.
4. ↑ Varzi, A.C. (2016). Mereology. In E.N. Zalta (Ed.), The Stanford Encyclopedia of Philosophy.
5. ↑ The term 'partition level' and the recursive definition of n-member are adapted from: Seibt, J. (2015) Non-transitive parthood, leveled mereology, and the representation of emergent parts of processes. Grazer Philosophische Studien, 91(1), 165–190, pp. 178-80. Seibt, J. (2009). Forms of emergent interaction in general process theory. Synthese, 166(3), 479–512, \S{3.2}. doi:10.1007/s11229-008-9373-z.

0.00

(0 votes)

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Finitist_set_theory&oldid=206044"