Double extension set theory

From testwiki
Revision as of 15:38, 28 August 2021 by imported>JoeNMLC (top: add tech. notice)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description Template:Technical In mathematics, the Double extension set theory (DEST) is an axiomatic set theory proposed by Andrzej Kisielewicz consisting of two separate membership relations on the universe of sets,[1] denoted here by and ε, and a set of axioms relating the two. The intention behind defining the two membership relations is to avoid the usual paradoxes of set theory, without substantially weakening the axiom of unrestricted comprehension.

Intuitively, in DEST, comprehension is used to define the elements of a set under one membership relation using formulas that involve only the other membership relation. Let ϕ(x) be a first-order formula with free variable x in the language of DEST not involving the membership relation ε. Then, the axioms of DEST posit a set A={x|ϕ(x)} such that xεAϕ(x). For instance, xx is a formula involving only , and thus DEST posits the Russell set R={x|xx}, where xεRxx. Observe that for x=R, we obtain RεRRR. Since the membership relations are different, we thus avoid the Russell's paradox.

The focus in DEST is on regular sets, which are sets whose extensions under the two membership relations coincide, i.e., sets A for which it holds that x.xAxεA. The preceding discussion suggests that the Russell set R={x|xx} cannot be regular, as otherwise it leads to the Russell's paradox.

References

Template:Reflist


Template:Settheory-stub

  1. Cite error: Invalid <ref> tag; no text was provided for refs named stanford