- #1

Avichal

- 295

- 0

You are using an out of date browser. It may not display this or other websites correctly.

You should upgrade or use an alternative browser.

You should upgrade or use an alternative browser.

- Thread starter Avichal
- Start date

- #1

Avichal

- 295

- 0

- #2

grmnsplx

- 38

- 0

"What colour is Wednesday?" for example.

In the case of the barber paradox, though, the assumptions lead to a contradiction. This implies that one or more of the assumtions is false. Essentially, such a town does not exist and cannot exist.

- #3

Avichal

- 295

- 0

- #4

grmnsplx

- 38

- 0

Who is trying to modify set theory?

My understanding was that Cantor's set theory was proven to be inconsistent (by Russel and Zermelo and perhaps others) so a more axiomatic approach was necessary.

The issue is this: a set is defined by it's elements.

So I can come up with all sorts of inconsistent sets eg Russle's paradox.

So maybe a set is not defined by it elements? Or maybe we have to be careful about what elements define a set. I believe that is what other approaches to set theory are about (eg Quinian set theory).

- #5

SteveL27

- 799

- 7

Regarding the set of all sets:

If you allow unrestricted set formation, you get a paradox. So the solution is to disallow unrestricted set formation.

That is: Let P be a predicate. A predicate is just a statement that is either true or false about some particular object. So if P(x) is the statement, "x is an even number" then P(2) is true and P(47) is false.

Now we make a rule: For any predicate P, we can form the set {x : P(x)}. In other words given any predicate, we can form a set made up of exactly those objects for which the predicate is true.

But that rule fails! If we let P(x) mean, "x is not an element of x" and we form the set

R = {x : P(x)}

then R is an element of R if and only if R is NOT an element of R. We have a contradiction. So our "rule" was a disaster. It led to an inconsistent system of set theory. (I'm using R in honor of Russell, of course.)

The solution (or more accurately, ONE possible solution, and the solution in common use today) is to disallow arbitrary set formation. The

So if P is a predicate, and U is a set, then

Z = {x [itex]\in[/itex] U : P(x)}

does not lead to a contradiction. Problem solved! And that's why we don't allow unrestricted set formation: because it immediately leads to a contradiction. From now on, when constructing new sets of objects that satisfy some predicate, we can only test objects that are

That fixes the problem.

[Technical note: It's more accurate to say that Zermelo's idea does not lead to a contradiction

Now, as far as the barber who shaves all those who don't shave themselves: Clearly he is shaved by Occam's razor!

Last edited:

- #6

grmnsplx

- 38

- 0

What he said.

- #7

Avichal

- 295

- 0

Thank you guys!

Share:

- Last Post

- Replies
- 4

- Views
- 272

- Last Post

- Replies
- 10

- Views
- 687

- Replies
- 212

- Views
- 9K

- Last Post

- Replies
- 5

- Views
- 929

- Last Post

- Replies
- 10

- Views
- 1K

- Last Post

- Replies
- 12

- Views
- 2K

- Last Post

- Replies
- 9

- Views
- 1K

- Last Post

- Replies
- 5

- Views
- 3K

- Replies
- 9

- Views
- 768

- Last Post

- Replies
- 6

- Views
- 496