Re: Cantor's definition of set
- From: Jan Burse <janburse@xxxxxxxxxxx>
- Date: Fri, 26 Oct 2007 13:58:32 +0200
G. Frege schrieb:
@JJ: In ZFC (our "standard" set theory) we actually have that everythingYes, but you can easily read the axioms in a many sorted
(in the domain of discourse) *is* a set. (No urelements.)
F.
first order language, and then when it says:
Two sets are the same if they have the same elements
forall x forall y forall z ((z in x <-> z in y) -> x=y)
The corresponding axiom in the many sorted first order
language is then:
forall x (
Set(x) -> forall y(
Set(y) -> forall z((z in x <-> z in y) -> x=y)))
Or assume that your urelements will end up in sets. Like
integeres will be special sets, reals will be special sets,
fritz the cat will be a special set etc..
For integer numbers and reals this goes quite well, and
properties of sets automatically transfer to the properties
of the integeres and reals (dedekind cut etc..).
Also note that urelements can be structured. Nothing
prevents you from having sequences or hierarchies
as urelements, and these urelements being further
decomposable.
So maybe the better name is non-sets than urelements.
http://en.wikipedia.org/wiki/Urelement
http://mathworld.wolfram.com/Urelement.html
Bye
.
- Follow-Ups:
- Re: Cantor's definition of set
- From: G . Frege
- Re: Cantor's definition of set
- From: Chris Menzel
- Re: Cantor's definition of set
- References:
- Cantor's definition of set
- From: John Jones
- Re: Cantor's definition of set
- From: Jan Burse
- Re: Cantor's definition of set
- From: G . Frege
- Cantor's definition of set
- Prev by Date: Re: Model here, model there
- Next by Date: Re: Cantor's definition of set
- Previous by thread: Re: Cantor's definition of set
- Next by thread: Re: Cantor's definition of set
- Index(es):
Relevant Pages
|