Talk:Code (set theory)

From Wikipedia, the free encyclopedia

Mathematics Portal This article is within the scope of WikiProject Mathematics, which collaborates on articles related to mathematics.
Mathematics rating:	Stub Class	Low Priority	Field: Foundations, logic, and set theory
Please update this rating as the article progresses, or if the rating is inaccurate. Click to show/hide comments. Please add to or update the comments to suggest improvements to the article. Please add useful comments here--Cronholm144 07:58, 24 May 2007 (UTC)

[edit] A definition easier to follow

There is probably nothing wrong in the article as it stands, but I want to change the beginning of it anyway. The reason is that I don't like when (for most people) nontrivial concepts are introduced in a single sentence and, in addition, the notation is introduced in nested "where-clauses" and "such-that-clauses"

I'll replace

In set theory, a code for a set

x

the notation standing for the hereditarily countable sets,

is a set

E ω×ω

such that there is an isomorphism between (ω,E) and (X,) where X is the transitive closure of {x}.

with this

In set theory a code of a set is defined as follows. Let x be a hereditarily countable set, and let X be the transitive closure of {x}. Let as usual ω denote the set of natural numbers and let be the first uncountable cardinal number. In this notation we have . Also recall that denotes the relation of belonging in X.

A code for x is any set E satisfying the following two properties:

1.) E ω×ω

2.) There is an isomorphism between (ω,E) and .

if there are no objections.

YohanN7 (talk) 23:13, 6 June 2008 (UTC)