ISF Logo   IS Forum
Forum Index Register Members List Events Mark Forums Read Help

Go Back   International Skeptics Forum » General Topics » Religion and Philosophy
 


Welcome to the International Skeptics Forum, where we discuss skepticism, critical thinking, the paranormal and science in a friendly but lively way. You are currently viewing the forum as a guest, which means you are missing out on discussing matters that are of interest to you. Please consider registering so you can gain full use of the forum features and interact with other Members. Registration is simple, fast and free! Click here to register today.
Reply
Old 24th September 2020, 05:30 AM   #561
doronshadmi
Penultimate Amazing
 
doronshadmi's Avatar
 
Join Date: Mar 2008
Posts: 13,265
Originally Posted by jsfisher View Post
I skipped any treatment of the natural numbers because I don't need any. You are the one insisting it be there, I have shown it isn't required.



Yes, that is what I wrote and what you already quoted. Repeating it was unnecessary.



No, N is defined by the previous expression.



Restating it again does not add value. And you made an error in the process. Be that as it may, though, I am confident you have no idea how the expression actually achieves the goal. You recognize the individual "words" by you don't comprehend their collective meaning.



Yep, proof you don't comprehend their collective meaning.





Oh? Are you unfamiliar with the phrase, vacuously true? F : ∅ → X is an injective map from the empty set to any set X. A function F is an injective map from the not necessarily distinct sets A to B iff:
∀a∈A (∃b∈B (F(a) = b ∧ ∀c∈A (F(a) = F(c) ⇒ a = c)))
Nothing there forbids A or B from being empty.
You have missed my correction in http://www.internationalskeptics.com...&postcount=559 and replied to an irrelevant post.
__________________
That is also over the matrix, is aware of the matrix.

That is under the matrix, is unaware of the matrix.

For more details, please carefully observe Prof. Edward Frenkel's video from https://youtu.be/PFkZGpN4wmM?t=697 until the end of the video.
doronshadmi is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 24th September 2020, 05:56 AM   #562
jsfisher
ETcorngods survivor
Moderator
 
jsfisher's Avatar
 
Join Date: Dec 2005
Posts: 22,964
Originally Posted by doronshadmi View Post
You have missed my correction in http://www.internationalskeptics.com...&postcount=559 and replied to an irrelevant post.

If you need to make extensive corrections to a post (i.e., other than slight typos), then make a new post. Also, be kind enough to highlight the important corrections you think you are making.
__________________
A proud member of the Simpson 15+7, named in the suit, Simpson v. Zwinge, et al., and founder of the ET Corn Gods Survivors Group.

"He's the greatest mod that never was!" -- Monketey Ghost
jsfisher is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 24th September 2020, 06:05 AM   #563
doronshadmi
Penultimate Amazing
 
doronshadmi's Avatar
 
Join Date: Mar 2008
Posts: 13,265
Originally Posted by jsfisher View Post
If you need to make extensive corrections to a post (i.e., other than slight typos), then make a new post. Also, be kind enough to highlight the important corrections you think you are making.
http://www.internationalskeptics.com...&postcount=559 is a new post, where you replied to the older one.
__________________
That is also over the matrix, is aware of the matrix.

That is under the matrix, is unaware of the matrix.

For more details, please carefully observe Prof. Edward Frenkel's video from https://youtu.be/PFkZGpN4wmM?t=697 until the end of the video.

Last edited by doronshadmi; 24th September 2020 at 06:11 AM.
doronshadmi is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 24th September 2020, 06:15 AM   #564
jsfisher
ETcorngods survivor
Moderator
 
jsfisher's Avatar
 
Join Date: Dec 2005
Posts: 22,964
Originally Posted by doronshadmi View Post
It is a new post, where you replied to the older one.
No, it was not a new post. It was an substantial edit to an existing post.

And I replied to the version of the post in place at the time I hit the Quote button. It is rude for you to dismiss my post in its entirety, too. If it comments on mistakes of yours that have been corrected, point out in response to my post how your mistakes were corrected. If it comments on things you thought were correct in the first place, comment on that.

I await the mitigation to your rudeness.
__________________
A proud member of the Simpson 15+7, named in the suit, Simpson v. Zwinge, et al., and founder of the ET Corn Gods Survivors Group.

"He's the greatest mod that never was!" -- Monketey Ghost
jsfisher is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 24th September 2020, 06:30 AM   #565
doronshadmi
Penultimate Amazing
 
doronshadmi's Avatar
 
Join Date: Mar 2008
Posts: 13,265
Originally Posted by jsfisher View Post
No, it was not a new post. It was an substantial edit to an existing post.

And I replied to the version of the post in place at the time I hit the Quote button. It is rude for you to dismiss my post in its entirety, too. If it comments on mistakes of yours that have been corrected, point out in response to my post how your mistakes were corrected. If it comments on things you thought were correct in the first place, comment on that.

I await the mitigation to your rudeness.
jsfisher your post was created almost two hours after my new post was created.

So next time please refresh your screen before you reply.

Please reply to http://www.internationalskeptics.com...&postcount=559.
__________________
That is also over the matrix, is aware of the matrix.

That is under the matrix, is unaware of the matrix.

For more details, please carefully observe Prof. Edward Frenkel's video from https://youtu.be/PFkZGpN4wmM?t=697 until the end of the video.

Last edited by doronshadmi; 24th September 2020 at 06:32 AM.
doronshadmi is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 24th September 2020, 06:44 AM   #566
doronshadmi
Penultimate Amazing
 
doronshadmi's Avatar
 
Join Date: Mar 2008
Posts: 13,265
Originally Posted by jsfisher
I skipped any treatment of the natural numbers because I don't need any.
You can't skip on these sets, as shown in http://www.internationalskeptics.com...&postcount=559.
__________________
That is also over the matrix, is aware of the matrix.

That is under the matrix, is unaware of the matrix.

For more details, please carefully observe Prof. Edward Frenkel's video from https://youtu.be/PFkZGpN4wmM?t=697 until the end of the video.

Last edited by doronshadmi; 24th September 2020 at 06:45 AM.
doronshadmi is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 24th September 2020, 07:33 AM   #567
doronshadmi
Penultimate Amazing
 
doronshadmi's Avatar
 
Join Date: Mar 2008
Posts: 13,265
The relevant details are as follows:

jsfisher, in order to establish the minimal set satisfying the requirements of the Axiom of Infinity, one first has to show that all the natural numbers (which are defined by von Neumann's treatment of the natural numbers in terms of sets) are actually establish a set that satisfying the requirements of the Axiom of Infinity.

So at the first stage the following definitions are restricted only to all the members of this minimal set, such that the initial member is the empty set (v=∅) and the rest of the members are defined as v⋃{v}, which are all finite sets:

Definition 1: |v| = |v| iff there is bijection from v to v.

Definition 2: |v| < |v⋃{v}| iff (there is an injective non-surjective function from v to v⋃{v}) OR (injective function from v to v⋃{v} that is based on empty function) (in case that v=)

Definitions 1 and 2 look trivial at first glance, but these are the functions among the finite sets, which define all the natural numbers by von Neumann's treatment.

Since v ∈ V(v∪{v} ∈ V ∧ |v∪{v}| can't be but < |V|) |V| is not established, simply because it can't be defined as the cardinality of all V members, which are all the finite sets by von Neumann's treatment of all the natural numbers.
__________________
That is also over the matrix, is aware of the matrix.

That is under the matrix, is unaware of the matrix.

For more details, please carefully observe Prof. Edward Frenkel's video from https://youtu.be/PFkZGpN4wmM?t=697 until the end of the video.

Last edited by doronshadmi; 24th September 2020 at 07:43 AM.
doronshadmi is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 24th September 2020, 08:11 AM   #568
jsfisher
ETcorngods survivor
Moderator
 
jsfisher's Avatar
 
Join Date: Dec 2005
Posts: 22,964
Just a reminder:

Originally Posted by jsfisher View Post
No, it was not a new post. It was an substantial edit to an existing post.

And I replied to the version of the post in place at the time I hit the Quote button. It is rude for you to dismiss my post in its entirety, too. If it comments on mistakes of yours that have been corrected, point out in response to my post how your mistakes were corrected. If it comments on things you thought were correct in the first place, comment on that.

I await the mitigation to your rudeness.
__________________
A proud member of the Simpson 15+7, named in the suit, Simpson v. Zwinge, et al., and founder of the ET Corn Gods Survivors Group.

"He's the greatest mod that never was!" -- Monketey Ghost
jsfisher is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 24th September 2020, 09:08 PM   #569
Little 10 Toes
Master Poster
 
Little 10 Toes's Avatar
 
Join Date: Nov 2006
Posts: 2,240
I'm starting this message at 9:13pm local time according to my tablet. I am purposely waiting and stalling a few minutes to have the forum clock to change.

Edit: the system clock is 7-8 minutes behind. This would confirm that the time on the post is not when you start writing it, but when you submit/save/post it.

Edit 2: trying to see what the edit time is based off. Waiting about 30mins. Looks like it's based off the save button.

Last edited by Little 10 Toes; 24th September 2020 at 09:25 PM.
Little 10 Toes is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 25th September 2020, 06:52 PM   #570
Little 10 Toes
Master Poster
 
Little 10 Toes's Avatar
 
Join Date: Nov 2006
Posts: 2,240
And what the deal about waiting almost two hours before posting the final "edit"?
Little 10 Toes is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 25th September 2020, 07:16 PM   #571
jsfisher
ETcorngods survivor
Moderator
 
jsfisher's Avatar
 
Join Date: Dec 2005
Posts: 22,964
Originally Posted by Little 10 Toes View Post
And what the deal about waiting almost two hours before posting the final "edit"?
From my point of view, I don't care. I responded to an actual post. It matters not that I was interrupted by something more important in real life that delayed my complete response. I responded to an actual post.

For Doronshadmi to then claim I hadn't responded to a post he had edited to become something else and therefore I had to start all over is unacceptable rudeness, especially since my observations about the post I responded to were still valid after all of Doronshadmi's editing.

If Doronshadmi chooses to dismiss my post out of hand, so be it, we are done. The only other option is to address it as is and respond to the comments directly or how he has (yet again) changed is argument in a way that my remarks aren't about what he currently believes.
__________________
A proud member of the Simpson 15+7, named in the suit, Simpson v. Zwinge, et al., and founder of the ET Corn Gods Survivors Group.

"He's the greatest mod that never was!" -- Monketey Ghost
jsfisher is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 27th September 2020, 08:38 AM   #572
doronshadmi
Penultimate Amazing
 
doronshadmi's Avatar
 
Join Date: Mar 2008
Posts: 13,265
Originally Posted by jsfisher View Post
... especially since my observations about the post I responded to were still valid after all of Doronshadmi's editing.
Let's see.

1) He ignores the minimal set that satisfies the requirements of the Axiom of Infinity.

2) This minimal set is exactly the von Neumann's treatment of the natural numbers in terms of sets (let's call this set V (which, of course, can be replaced by any other chosen name)).

3) All the members of set V are finite sets.

4) There are four functions, divided into two types, among V members, as follows:

a) 2 functions from a given member to itself:

a.1) Empty function from to itself.

a.2) Bijective function from v (where v≠) to itself.

a.3) Bijective function from v⋃{v} to itself.

b) 2 functions from a given member to a different member:

b.1) Injective non-surjective function from v to v⋃{v} (in case that v≠).

b.2) Injective function from v to v⋃{v} (in case that v=, where all v⋃{v} in V are finite sets, according to von Neumann's treatment of the natural numbers in terms of sets).

Originally Posted by jsfisher
Every element of v ⋃ {v} is an element of V. The identity function is a perfectly adequate injection from v ⋃ {v} to V.

Therefore (under my definition): |v ⋃ {v}| ≤ |V|
But by (1) to (4) there can't be injection from v⋃{v} to V, which means that:

v ∈ V(v∪{v} ∈ V) ∧ (|v∪{v}| < |V|).

No wonder that jsfisher ignores "weak limit cardinal" as seen in http://www.internationalskeptics.com...&postcount=451.

Quote:
( https://en.wikipedia.org/wiki/Limit_cardinal )
In mathematics, limit cardinals are certain cardinal numbers. A cardinal number λ is a weak limit cardinal if λ is neither a successor cardinal nor zero. This means that one cannot "reach" λ from another cardinal by repeated successor operations.
λ is an ad hoc invention out of nowhere, that all of its purpose is to establish the Cantorian transfinite system by hook or by crook.
__________________
That is also over the matrix, is aware of the matrix.

That is under the matrix, is unaware of the matrix.

For more details, please carefully observe Prof. Edward Frenkel's video from https://youtu.be/PFkZGpN4wmM?t=697 until the end of the video.

Last edited by doronshadmi; 27th September 2020 at 09:14 AM.
doronshadmi is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 29th September 2020, 02:45 AM   #573
doronshadmi
Penultimate Amazing
 
doronshadmi's Avatar
 
Join Date: Mar 2008
Posts: 13,265
The foundations of mathematics

Please look at http://www.internationalskeptics.com...&postcount=478 in order to understand better why ZF(C) is not the actual foundations of mathematics.
__________________
That is also over the matrix, is aware of the matrix.

That is under the matrix, is unaware of the matrix.

For more details, please carefully observe Prof. Edward Frenkel's video from https://youtu.be/PFkZGpN4wmM?t=697 until the end of the video.
doronshadmi is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 29th September 2020, 08:08 AM   #574
doronshadmi
Penultimate Amazing
 
doronshadmi's Avatar
 
Join Date: Mar 2008
Posts: 13,265
Originally Posted by jsfisher
Not all closed curves are circles, but all circles are closed curves. Not all injections are bijections, but all bijections are injections.
closed curves = one-to-one functions
circles = one-to-one AND onto functions

So, according to you, not all one-to-one functions are one-to-one AND onto functions (in this case we have |A| < |B|) , but all one-to-one AND onto functions are one-to-one functions (in this case we have |A| = |B|).

Originally Posted by jsfisher
You can, in fact, use those meanings to show that the expression |A| <= |B| is identical to (|A| < |B|) OR (|A| = |B|)
By using your analogy:

(not all one-to-one functions are one-to-one AND onto functions)

OR

(all one-to-one AND onto functions are one-to-one functions)

Since all the members of the von Neumann's treatment of the natural numbers in terms of sets are finite sets, only the following part of his analogy holds:

(not all one-to-one functions are one-to-one AND onto functions)

which means that only all one-to-one functions that are not one-to-one AND onto functions, are used in case of |v∪{v}| < |V|, exactly because v∪{v} can't be but a finite set, the von Neumann's treatment of the natural numbers in terms of sets.
__________________
That is also over the matrix, is aware of the matrix.

That is under the matrix, is unaware of the matrix.

For more details, please carefully observe Prof. Edward Frenkel's video from https://youtu.be/PFkZGpN4wmM?t=697 until the end of the video.

Last edited by doronshadmi; 29th September 2020 at 08:18 AM.
doronshadmi is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 30th September 2020, 05:20 PM   #575
jsfisher
ETcorngods survivor
Moderator
 
jsfisher's Avatar
 
Join Date: Dec 2005
Posts: 22,964
On two previous occasions, I posted some cryptic hieroglyphics suggesting they may be useful sometime later. Now that the thread's star celeb is working on his monologue, re-presenting past nonsense, I will close out my participation in this arc of the thread explaining those two posts for anyone who really cares.

First, a reminder. This latest "infinity bad" arc had at its start "proof" based in the cardinality of infinite sets. Since seemingly standard terms and phrases have been used in such novel ways in this thread, it was only reasonable to demand my interlocutor define what he meant by cardinality. This proved impossible, but did show the need to build the desired conclusion on cardinality into the definition of cardinality, creating a natural loop.

Ok, set theory has the Axiom of Infinity. It is necessary in an axiomatic set theory; otherwise you cannot construct an infinite set. Here is the axiom expressed in first order predicate calculus:
∃I (∈I ∧ ∀x (x∈I ⇒ x ⋃ {x} ∈ I))
Looks ugly, but it expresses a simple idea: There exists a set we will call I (∃I) which contains the empty set as a member (∈I) and (∧) for any set x (∀x) if x is a member of I (x∈I) then (⇒) the "successor" of x is also a member of I (x ⋃ {x} ∈ I).

The Axiom of Infinity guarantees some set, I, exists that has two properties:
∈ I
∀a (a∈I ⇒ a ⋃ {a} ∈ I)
We can even give it a name. Any set that has these two properties is an "inductive set." Notice, by the way, that the two properties tell us somethings about what must be in the set, but say nothing about what cannot be in the set. The Axiom of Infinity guarantees one such set, but there could be many.

One way to look at inductive sets is that they all must contain and they must contain an infinite sequence of successors arising from as the starting point. Such a set could also contain other starting points, other than , and the infinite sequence of successors arising from those other starting points.

So many, many inductive sets could exist in set theory, the Axiom of Infinity guarantees there is at least one, but is there a "minimum" such set, one that has only and its sequence of successors and not others? Formally, is there a set which I will call N with this property:
∀a (a∈N ⇒ (a = ∨ ∃b (b∈N ∧ (a = b ⋃ {b}))))
What these chicken-scratches express is that every member of N is either the empty set or the successor of some other member of N. I'll leave that as an exercise for the reader to decipher.

So, how can we show that such a set must exist? Well, more chicken-scratches:
N = {x∈I : ∀y ((∈y ∧ ∀z ((z∈y ⇒ z ⋃ {z} ∈ y))) ⇒ x∈y)}
It certainly doesn't look like it, but all this is stating is that N (my minimal set) is the intersection of all the inductive sets. Obvious, now, right?

Well, the intersection of two sets, A ∩ B, is simply all the members that are common to both sets. More formally,
A ∩ B = {x∈A : x∈B}
The gibberish, N = {x∈I : ∀y ((∈y ∧ ∀z ((z∈y ⇒ z ⋃ {z} ∈ y))) ⇒ x∈y)}, is just a generalized version of that. The ∀y ((∈y ∧ ∀z ((z∈y ⇒ z ⋃ {z} ∈ y))) part is simply identifying all the inductive sets and intersecting them with the set I.

For completeness, we'd need to prove this set N has that additional property. I won't bore you further, but I will outline the proof: N is the intersection of all inductive sets. If N doesn't satisfy the additional property, then there must be some member besides the empty set in N that isn't the successor of some other member. We can then define a set N' that is N without that other member. N' must be an inductive set, and N ∩ N' = N'. Since N ≠ N', we have a contradiction of N being the intersection of all inductive sets, so N must satisfy the additional property.

Whew.
__________________
A proud member of the Simpson 15+7, named in the suit, Simpson v. Zwinge, et al., and founder of the ET Corn Gods Survivors Group.

"He's the greatest mod that never was!" -- Monketey Ghost

Last edited by jsfisher; 30th September 2020 at 05:48 PM. Reason: many typos
jsfisher is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 2nd October 2020, 01:51 PM   #576
doronshadmi
Penultimate Amazing
 
doronshadmi's Avatar
 
Join Date: Mar 2008
Posts: 13,265
Originally Posted by jsfisher View Post
On two previous occasions, I posted some cryptic hieroglyphics suggesting they may be useful sometime later. Now that the thread's star celeb is working on his monologue, re-presenting past nonsense, I will close out my participation in this arc of the thread explaining those two posts for anyone who really cares.
You close your participation in this arc by a monologue that does not satisfy fundamental things for anyone who really cares:

1) You have proved that N exists, such that is its one and only one member that is not a successor of the rest of N members, where all the members of set N are themselves sets, such that for all x (where x is any arbitrary member of N), x⋃{x} is also a member of N.

2) All along the way you ignored the existence of all the finite sets that are definitely members of N.

3) Whether you like it or not, all these finite sets that are members of set N, satisfying the requirements of the Axiom of Infinity.

4) If you disagree with (3), you actually disagree with the existence of all the natural numbers in terms of sets (as defined by the von Neumann's treatment of the natural numbers, where their initial set is , as written in (1)).

5) By not ignoring all the finite sets of N, one can easily understand http://www.internationalskeptics.com...&postcount=567, which very simply addresses the fact that no x⋃{x} has the cardinality of N.

6) Your entire framework is based on injective function (≤), which according to it x⋃{x} (which is a finite member of N, if N is indeed the minimal set that satisfying the requirements of the Axiom of Infinity) has the cardinality of N, but http://www.internationalskeptics.com...&postcount=572 very simply shows why |x⋃{x}| = |N| is not established.

7) You take injection as some generalization, which somehow enables bijection to sneak in order to establish |x⋃{x}| = |N|, but http://www.internationalskeptics.com...&postcount=574 shows why this generalization has no basis.

8) No wonder that you ignores "weak limit cardinal" as seen in http://www.internationalskeptics.com...&postcount=451.

Quote:
( https://en.wikipedia.org/wiki/Limit_cardinal )
In mathematics, limit cardinals are certain cardinal numbers. A cardinal number λ is a weak limit cardinal if λ is neither a successor cardinal nor zero. This means that one cannot "reach" λ from another cardinal by repeated successor operations.
λ is an ad hoc invention out of nowhere, that all of its purpose is to establish the Cantorian transfinite system by hook or by crook.

====================================

Is there any alternative to jsfisher's framework?

The answer is yes, as can be seen, for example, in https://en.wikipedia.org/wiki/Alternative_set_theory.
__________________
That is also over the matrix, is aware of the matrix.

That is under the matrix, is unaware of the matrix.

For more details, please carefully observe Prof. Edward Frenkel's video from https://youtu.be/PFkZGpN4wmM?t=697 until the end of the video.

Last edited by doronshadmi; 2nd October 2020 at 01:57 PM.
doronshadmi is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 14th October 2020, 07:35 AM   #577
doronshadmi
Penultimate Amazing
 
doronshadmi's Avatar
 
Join Date: Mar 2008
Posts: 13,265
|A| ≤ |B| is identical to (|A| < |B|) OR (|A| = |B|).

p="|A| < |B|"

q="|A| = |B|"

Code:
p OR q
--------
F    F --> F
T    F --> T
F    T --> T
T    T --> T

Logically < can be replaced by ≤, but ≤ can't be replaced by <.

Some example:

1) 1<2 and 1≤2 are both true (T OR F --> T of the truth table above).

2) 1≤1 is true, but it's not true that 1<1 (F OR T --> T of the truth table above).

--------------------

3) T OR T --> T is possible only if |A| is a variable for values that are < or = |B|.

--------------------

Since all the members of the von Neumann's treatment of the natural numbers in terms of sets, satisfying the requirements of the Axiom of Infinity, they can't be ignored by any one that works under ZF(C).

Option (3) above is impossible, since given any arbitrary x (where x is some set by the von Neumann's treatment of the natural numbers in terms of sets) |x⋃{x}| can't be but < |N| (T OR F --> T of the truth table above) if N is claimed to be a set with infinitely many members.

--------------------

One claims: "You can't pick parts from a truth table in order to support your argument, since the whole truth table must be taken".

Well, in this case how, for example, 1<2 and 1≤2 are both true by the whole OR truth table?


--------------------

Maybe I am mixing things up, so please correct my mistakes.
__________________
That is also over the matrix, is aware of the matrix.

That is under the matrix, is unaware of the matrix.

For more details, please carefully observe Prof. Edward Frenkel's video from https://youtu.be/PFkZGpN4wmM?t=697 until the end of the video.

Last edited by doronshadmi; 14th October 2020 at 07:57 AM.
doronshadmi is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Old 25th October 2020, 03:51 AM   #578
doronshadmi
Penultimate Amazing
 
doronshadmi's Avatar
 
Join Date: Mar 2008
Posts: 13,265
By ZFC, the minimal set satisfying the requirements of the axiom of infinity, is the intersection of all inductive sets.

In case that the axiom of infinity is expressed as

∃I ( ∈ I ∧ ∀x (x ∈ I ⇒ x ⋃ {x} ∈ I))

the intersection of all inductive sets (let's call it K) is defined as

set K = {x∈I : ∀y (( ∈ y ∧ ∀z ((z ∈ y ⇒ z ⋃ {z} ∈ y))) ⇒ x ∈ y)}.

The members of set K can be defined by von Neumann's construction of the natural numbers in terms of sets (https://en.wikipedia.org/wiki/Natura..._on_set_theory).

So K satisfying the requirements of the axiom of infinity, where all of its members are finite sets, such that only is not a successor of the rest of K's members.

In that case ∀k ∈ K (k ∪ {k} ∈ K), where |k ∪ {k}| can't be but < |K|, if |K| = λ = weak limit cardinal (such that λ is neither a successor cardinal nor zero).

In that case how λ is formally defined as the cardinality of all k in K ?
__________________
That is also over the matrix, is aware of the matrix.

That is under the matrix, is unaware of the matrix.

For more details, please carefully observe Prof. Edward Frenkel's video from https://youtu.be/PFkZGpN4wmM?t=697 until the end of the video.

Last edited by doronshadmi; 25th October 2020 at 03:54 AM.
doronshadmi is offline   Quote this post in a PM   Nominate this post for this month's language award Copy a direct link to this post Reply With Quote Back to Top
Reply

International Skeptics Forum » General Topics » Religion and Philosophy

Bookmarks

Thread Tools

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Forum Jump


All times are GMT -7. The time now is 03:53 AM.
Powered by vBulletin. Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum began as part of the James Randi Education Foundation (JREF). However, the forum now exists as
an independent entity with no affiliation with or endorsement by the JREF, including the section in reference to "JREF" topics.

Disclaimer: Messages posted in the Forum are solely the opinion of their authors.