I am a fresher in COMP+MATH major and feeling so lucky there's someone who really explains things that got me stuck. Thank you Eliott! Surely I will try to watch every video you make as well.

This gives a whole new meaning to being pro-choice☺️

@Dadarotas303

3 жыл бұрын

Pro choice has no meaning, The meaning however has always been in the choice itself.

Hello, I'm writing from Russia, your video is great. I've watched a lot of videos on this topic, but only you have an emphasis on the little things. Thanks! Amazing content!

Thank you very much for your work, your videos are wonderful. Saved a lot of your playlists, I'll finish all of them someday.

This is great. I was struggling understanding these concepts but you explain them very clear. Thank you for your work!

I would watch every single one of your videos if only I had the time.

@Dr.Cassio_Esteves

3 жыл бұрын

I will (eventually) watch every single one of his videos.

Clear and Elegant explanation, thank you! much much appreciated

30:40 Yes, "Russel's Set" defined according to the axioms is equal to N: R=N, correct. Now according to the power set axiom, I can define P(N), of which N is an element. Next, using the axiom of subsets, I can construct {N} as {x e P(N) | x=N }. Since N=R, the first axiom implies {N} = {R}, which therefore also exists. Finally now, using the union axiom, I can construct {R} U N = {R,0,1,2,3,4,...}. So your claim (at 32:02) that this set cannot be constructed is wrong... Notice that the set {R,0,1,2,3,4,...} is NOT R. Call it Q instead: Q={R,0,1,2,3,4,...}. The question whether Q e Q can be answered unambiguously: it is false. So no contradiction. I think what you were trying to do 31:03, was to consider whether a DIFFERENT set, say R', could be defined as R'={R',0,1,2,3,...}. This is indeed impossible, and it would lead again to Russel's paradox.

Self-Referential Consistency Theorem with Constructive Sets For fun I thought let's combine Zermelo-Fraenkel set theory with parts of Russell's paradox and Cantor's paradise theorems to create a completely new theorem. Example: "Self-Referential Consistency Theorem with Constructive Sets" Introduction: In this new theorem, we will explore the relationship between self-reference, consistency, and constructive sets within the framework of Zermelo-Fraenkel set theory. We will consider a set S that contains both its own complement and its power set. Self-Reference and Paradox: The new rules prompt us to examine the self-referential nature of set S. If we include S in itself, we create a potential paradox, as S would contain its own complement and its power set, leading to contradictions similar to Russell's paradox. Constructive Sets: To avoid paradoxes and inconsistencies, the new rules emphasize constructive approaches. We introduce a new set R, which is the set of all sets that do not contain themselves. In symbolic terms, R = {x | x ∉ x}. Resolving Paradox: By considering set R instead of S, we prevent self-reference and paradoxes. Set R contains all constructive sets that are free from contradictions. We also define a new set T, which contains the power set of R. Defining the New Theorem: Using constructive sets and avoiding self-reference, we now state the "Self-Referential Consistency Theorem with Constructive Sets": For any set R that contains all sets not containing themselves, the power set of R, denoted as T, is free from contradictions and inconsistencies arising from self-reference. Implications: The new theorem sheds light on the interplay between self-reference, consistency, and constructive sets within Zermelo-Fraenkel set theory. It provides a framework for defining sets without encountering paradoxes. The theorem opens up new avenues for exploring constructive set theory and its implications for the foundations of mathematics. Applications: The "Self-Referential Consistency Theorem with Constructive Sets" has potential applications in formal logic, set theory, and automated reasoning systems. It can inspire new research on the limitations of self-reference in mathematical systems and the importance of constructive approaches in avoiding paradoxes. In conclusion, by combining Zermelo-Fraenkel set theory with elements from Russell's paradox and Cantor's paradise theorems, we have created the "Self-Referential Consistency Theorem with Constructive Sets." This theorem highlights the significance of constructive sets in ensuring the consistency of self-referential systems and extends our understanding of the boundaries of provability and consistency in mathematical reasoning.

Really excellent video - thanks. Leaves me wanting more... How about those other 3 axioms?

This video truly saved me.

Lovely explanation!

Year man!!!Aweosome video or yours.Really intresting.

Great, thank you!!!

Axiom of choice is only obvious to me if the intersection between the elements of the set is 0, then you can choose any representative for the elements of the set that are inside the set. So axiom of choice basically says you can make {{even}, {odd}} => {0,1}

@MikeRosoftJH

2 жыл бұрын

That's two different (but equivalent) formulations of the axiom of choice. One way is: given any collection of disjoint non-empty sets, there exists a set which contains a single element from each set in the collection. (And here the 'disjoint' condition is important; if the collection were {{1,2}, {2,3}, {1,3}}, then no set can have exactly one element from each set.) The other formulation is: given any collection of non-empty sets, there exists a function which maps each set in the collection to its element. (For collection {{1,2}, {2,3}, {1,3}} the choice function obviously exists; for example: {1,2}->1, {2,3}->2, {1,3}->3. For finite sets the axiom of choice is trivial; it's really relevant when the original collection contains infinitely many sets. (And even axiom of choice for infinitely many finite sets isn't obvious. One mathematician has put it: Axiom of choice isn't needed to pick one of each from infinitely many pairs of shoes - you can always pick the left shoe; but it's needed to pick one of each from infinitely many pairs of socks. That is: it's consistent without axiom of choice that there exists some countably infinite collection of two-element sets, which doesn't have a choice set. It also follows: it's not necessarily the case without axiom of choice that a union of countably many finite sets is countable.)

Thanks !!!

how did you do it can you share with me , thank you

This is awesome

I'm a fan! 🤩

Doesn't contain the axiom of replacement?

Are there more examples of sets like Rusell's?

@manuelocana8074

3 жыл бұрын

Um, and how do you know the axioms in zfc do not leave contradictions?

@guilhermefurquim8179

3 жыл бұрын

@@manuelocana8074 you don't know

@tim40gabby25

3 жыл бұрын

Including 10 could be called "fragmentation set theory", old duffer here, enjoying the ride :)

@manuelocana8074

3 жыл бұрын

@@tim40gabby25 i don't understand what you say

Russell's paradox is fixed in a totally different way, namely by understanding consciousness. To see how this is done, see my paper "The Self-Referential Aspect of Consciousness". And for people that might read my message in the future, check for the paper that I'm currently working on where I go even deeper into the subject, which will be named "How to Build a World". Author: Cosmin Visan.

I CAN'T watch this, the audio ia too low even at maximum volume

@johnandrheyabordo644

2 ай бұрын

I think the issue isn't the video. I can precisely hear the speaker from my end.

Who are you? You seem to know so much about so many fields of knowledge...

Who is the man?

It is not entirely clear to me why one needs the pairing axiom if one already has the empty set axiom and the power set axiom. Don't the two together imply that one can build sets like {Ø, {Ø}} ... I'm not clear on the point.

@jongraham7362

2 жыл бұрын

I suppose it is useful in order to create this: {{{{{ }}}}} as something meaningful. Which leads to this: {{{{ Ø }}}} = 4.

@MikeRosoftJH

2 жыл бұрын

@@jongraham7362 Axiom of pairing says that for any elements (sets) a, b, there exists the set {a,b} (the set P, such that x∈P if and only if x=a or x=b); when a=b, this yields the set {a,a}={a}. Sure, you can build specific sets using axiom of powerset on the empty set; but the axiom says that the common set exists for every pair of sets. (Though I believe that you can derive axiom of pairing from other axioms, such as from the axiom of powerset and axiom of replacement.) Sure, you can define 0 as empty set, 1={0}={{}}, 2={1}={{{}}}, and so on. But it's more convenient to use the von Neumann definition of natural numbers, where every number is a set of all numbers less than itself: 0 is the empty set, 1 is {0}, 2 is {0,1}, 3 is {0,1,2}, and so on. (Observe that any natural number n is a set with exactly n elements; and given natural number n, the number n+1 is obtained by taking the set n, and adding n itself to it as an additional element: n+1=n∪{n}.) This naturally extends to the infinite case (ordinal numbers).

Maths or mathematics? So by taking away free choice you have the zermelo set theory. So as long as there is a perfect restriction mathematics is valid.

0 1st 6th 10th and what about 7th 8th 9th ?

@elliotnicholson5117

3 жыл бұрын

They’re much more difficult.

Axiom 0 is already a philosophical absurd. It's like saying Nothing is something (in this case a set). But, if you consider the semantics of it the preposition is already problematic in the moment you say "Nothing IS"... "Is" is already stating an existence of x (i.e. not nothing).

@user-cd8yi4dk6p

2 жыл бұрын

How would you define nothingness?

@jps17183

2 жыл бұрын

​@@user-cd8yi4dk6p You can't. It's a transcendental idea

@user-cd8yi4dk6p

2 жыл бұрын

@@jps17183 ._. Hmm excuse my ignorance, but would it not be “something” the moment we think about it? I mean the idea already has a name (=nothingness)

@jps17183

2 жыл бұрын

@@user-cd8yi4dk6p Very well observed. Exactly and that's why is transcendental . The name is just that... A name to refer to some intuition we all share, however understanding an idea is different that compreending it. You can understand infinity (otherwise you couldn't know the truth value of the statment: "is allways bigger of that you are thinking now") but you can't compreend it (i.e. you cannot circusncribe/capture it it to concept) . Another example is the term consciousness. We all know what that is because weshare that otherwise you couldn't make sense of that word. It's like trying to explain the redness of red to a blind man. Those names you give to ideas are not relevant, are just symbolic means through witch you can communicate them. The ideas however are transcendental and trying to define them will led to logical paradoxes.

How can you prove that no natural number is red? Indeed (I'm not kidding here), I think there are natural numbers that are red. In fact, I think that is exactly what "red" is, just some (probably) gigantic natural number. So, then, you have asserted a fallacy, from which anything can follow. IMO, non-constructive mathematics is nonsense. Asserting an object exists using pseudo-mathematical notation doesn't make it exist. You have to actually demonstrate an object exists mathematically and non-constructive mathematics cannot do that (it can only assert). Therefore, 20th century (and now, sadly, 21st century) mathematics is on VERY shaky ground. It doesn't matter how clever you try to be, non-constructive set theory ultimately fails. You did a good job at pointing out the controversies around the Axiom of Choice, however, the Axiom of Infinity is also rather controversial in my opinion. At first, it seems rather benign. However, what you ahve actually done is assert an object exists without actually demonstrating its existence. What you have actually demonstrated is that you can construct {0}, {0,1}, {0,1,2}, etc.... Each of those sets will always have the sucessor of the greatest element missing. You can, instead, talk about an equivalence class of sets defined by {0: f(x)} and f(x) is a set generating function such that f({0}) = {0, 1 : f(x)}, for example, or anything else. In some sense, it is the opposite of the Axiom of Restricted Comprehension, however, we are defining an equivalence class and not a set. Note, there is never a complete set {1,2,3,...}. Only the sets {1:f(x)}, {1,2:f(x)}, {1,2,3:f(x)}, etc....

ok so there's this thing called the empty set and it's got nothing in it. And we take that empty set and put another empty set inside it and that's not an empty set anymore...blah blah blah and that's the integers!!! ta da!...... Absolutely absurdly ridiculous nonlogic that has nothing to do with anything. How TF did a label / symbol used to represent no quantity become a "number"? wtf...