Deeper than primes - Continuation

Status
Not open for further replies.
doronshadmi said:
I do not redefine the word "identical".

What I show in http://www.internationalskeptics.com/forums/showpost.php?p=9821061&postcount=3534 that in the case of sets with unbounded amount of members, their size is not well-defined, and this property is one of the aspects of of the identity of sets with unbounded amount of members.
Click to expand...

Nope, the logic in that thread does not follow. You *have* redefined the word, and by doing so, the integrity of the logic fails.

You admit as much in your "explanation".
 
Little 10 Toes said:
Then either you do not understand what |N| means, what || means, or what the set N is.

Besides, you used it in your example, so why can't I?
Click to expand...
Since Traditional Mathematics does not use a function without an inverse, it is tuned to get only |N|=|N|.

For better understanding of visual_spatial AND verbal_symbolic reasoning, let us use a common ground for our abstract mathematical reasoning, as follows:

The common ground is an unbounded grid (the terms domain and codiman are not used in that framework) where horizontal observation is used for distinction and vertical observation is used for comparison (distinction and comparison are possible in the first place exactly because they are non-local (they are at AND beyond a given locality)), as follows:

An example of a set with unbounded amount of members, that is compared with itself on the common ground:

Code: 
        The common ground                    |N|=|N|            OR          |N| ¬= |N|          
               ...                             ...                             ...              
                                                                                                
                                                                                                
       |  |  |  |  |  |  |             |  |  |  |  |  |  |             |  |  |  |  |  |  |      
      _____________________           _____________________           _____________________     
                                                                                                
       |  |  |  |  |  |  |             |  |  |  |  |  |  |             |  |  |  |  |  |  |      
      _____________________           ____1__2__3__4__5__6_           ____1__2__3__4__5__6_     
                                                                                                
  ...  |  |  |  |  |  |  |  ...   ...  |  ↕  ↕  ↕  ↕  ↕  ↕  ...   ...  |  ↓  ↕  ↕  ↕  ↕  ↕  ... 
      _____________________           ____1__2__3__4__5__6_           _______1__2__3__4__5_     
                                                                                                
       |  |  |  |  |  |  |             |  |  |  |  |  |  |             |  |  |  |  |  |  |      
      _____________________           _____________________           _____________________     
                                                                                                
       |  |  |  |  |  |  |             |  |  |  |  |  |  |             |  |  |  |  |  |  |      
                                                                                                
                                                                                                
               ...                             ...                             ...

An example of a proper subset with unbounded amount of members that is compared with its set on the common ground:

Code: 
        The common ground                    |P|=|N|            OR          |P| > |N|          
               ...                             ...                             ...              
                                                                                                
                                                                                                
       |  |  |  |  |  |  |             |  |  |  |  |  |  |             |  |  |  |  |  |  |      
      _____________________           _____________________           _____________________     
                                                                                                
       |  |  |  |  |  |  |             |  |  |  |  |  |  |             |  |  |  |  |  |  |      
      _____________________           ____2__4__6__8_10_12_           ____2__4__6__8_10_12_     
                                                                                                
  ...  |  |  |  |  |  |  |  ...   ...  |  ↕  ↕  ↕  ↕  ↕  ↕  ...   ...  |  ↓  ↕  ↕  ↕  ↕  ↕  ... 
      _____________________           ____1__2__3__4__5__6_           _______1__2__3__4__5_     
                                                                                                
       |  |  |  |  |  |  |             |  |  |  |  |  |  |             |  |  |  |  |  |  |      
      _____________________           _____________________           _____________________     
                                                                                                
       |  |  |  |  |  |  |             |  |  |  |  |  |  |             |  |  |  |  |  |  |      
                                                                                                
                                                                                                
               ...                             ...                             ...

By using the common ground, ↕ is a function with an inverse on the common ground, where ↓ (or ↑) is a function without an inverse on the common ground.

By using the common ground we immediately realize that Traditional Mathematics uses only functions with an inverse on the common ground, and us a result it can't handle with the other possible comparisons on the common ground (as done by Organic Mathematics, which uses the non-locality of the common ground (which enables the use of functions without inverse) for finer understanding of the localities and their possible relations on it).

In other words, the notion of domain and codomain is no more than the particular case of functions with an inverse on the common ground, which prevent finer understanding of the localities and their possible relations on the common ground.

The common ground is the non-local cross-context foundation of Organic Mathematics, which enables finer and richer understanding of the context-dependent localities and their possible relations on it.
 
Last edited:
Kid Eager said:
Nope, the logic in that thread does not follow. You *have* redefined the word, and by doing so, the integrity of the logic fails.

You admit as much in your "explanation".
Click to expand...
Please think about fog.

The not well-defined size of set with unbounded amount of members, is straightforward exactly as the identity of the fog is being unclear.
 
doronshadmi said:
Since Traditional Mathematics does not use a function without an inverse, it is tuned to get only |N|=|N|.
Click to expand...

I'm getting tired of your assertions without any proof. Please provide direct proof that "traditional Mathematics does not use a function without an inverse".

<snip garbage>

I always love how you say something about a set isn't equal to itself, start doing some sort of table or graphic and yet never start the set at the same starting point.

I've pointed it out to you before. Yet you continue to make the same mistake.
 
Little 10 Toes said:
I'm getting tired of your assertions without any proof.
Click to expand...
EDIT:

The non-locality of ____ w.r.t . (___ is at AND beyond the one and only one position of . along it) or the locality of . w.r.t ____ (. is at one and only one given position along ____) is an axiom, which means it does not need any proof.

As long as you get things only in terms of locality you are unable to understand why a collection with unbounded amount of . does not have an accurate cardinality.

As long as you are using only verbal_symbolic reasoning that is focused only on the symbols of the numbers (which are localities along the non-local common ground, as shown in http://www.internationalskeptics.com/forums/showpost.php?p=9823863&postcount=3563) you simply have no way to understand why |N| = OR not= |N|.

In order to get it at list visual_spatial AND verbal_symbolic reasoning has to be used, where by this reasoning there is a mapping (a function) without an inverse on the non-local common ground among localities w.r.t their selves or w.r.t other localities, such that the non-local common ground does not domain and range (codomain) among functions.
 
Last edited:
realpaladin said:
Doron will fail, because y=x^2 is a function without an inverse.[/url]
Click to expand...
Please demonstrate how this function is used as a mapping between members of sets.

Please be aware that I am using a function as a mapping between members of sets, where instead of domain and codomain a non-local common ground is used among the member, as explained in http://www.internationalskeptics.com/forums/showpost.php?p=9823863&postcount=3563 and http://www.internationalskeptics.com/forums/showpost.php?p=9824985&postcount=3569.
 
Last edited:
doronshadmi said:
Please demonstrate how this function is used as a mapping between members of sets.
Click to expand...

And there you have it, ladies and gents. Doron has no clue what a function is, yet he claims to have improved on all things maths! Ridiculous.

doron, the only person your inane gibberish appeals to is... wait for it... YOU! Doesn't that tell you something? With all the skills you claim to have that nobody else does, you can't see that you're spouting useless, retarded gibberish?
 
EDIT:

Little 10 Toes said:
Your last post does not match anything to what I said.
Click to expand...
You have asked about proofs, but axioms do not need proofs.

Little 10 Toes said:
You have decided to invent yet another term that you don't need to use.
Click to expand...
It is not used by verbal_symbolic-only reasoning that understands thing only in terms of locality.

This is not the case with verbal_symbolic AND visual_spatial reasoning which enables to deal with the relations among locality and non-locality, and I did not invent it in this page so this is not another term, but it is an improved explanation of the relations among locality and non-locality, which can be understood only by posters that think in terms of abstract verbal_symbolic AND visual_spatial reasoning.

Little 10 Toes said:
When you are comparing two sets why aren't you starting with the first element of the sets?
Click to expand...
Take, for example, the following mapping among sets with bounded amount of members:

Code: 
{1,2,3,4,5}
 ↓ ↕ ↕ ↕ ↕ 
  {1,2,3,4}

As you can see, I can start from any place (the first,not the first,last) and get the same result, exactly because the size of sets with bounded amount of members is well-defined.

The same approach (the first, not the first) is used among sets with unbounded amount of members, but since they have no last members, the result is |N| = OR not= |N|, or in other words, unlike in the case of sets with bounded amount of members, in the case of sets with unbounded amount of member (whether it is one and only one set, or not) I do not get the same results by using the first or not the first. In other words the size of sets with unbounded amount of members is not well-defined, for example:

Code: 
{1,2,3,4,5,...}
 ↓ ↕ ↕ ↕ ↕ 
  {1,2,3,4,...}

OR

Code: 
{1,2,3,4...}
 ↕ ↕ ↕ ↕ 
{1,2,3,4,...}
 
Last edited:
doronshadmi said:
You have asked about proofs, but axioms do not need proofs.
Click to expand...

Wow, you got one right! OK, axioms do not need proof, indeed. They do need to be useful, however, not to mention consistent. Care to show some useful result arrived at by starting from your axioms? Didn't think so... We all know you got exactly nothing, doron, and you keep on reasserting the same.
 
doronshadmi said:
Please demonstrate how this function is used as a mapping between members of sets.
Click to expand...

That is just a plain silly statement; the function speaks for itself. It is the most simple function possible. Even grade-school kids understand this one.

Besides having proven you wrong, I have also proven you a liar, Doron Shadmi.

It was you who claimed traditional mathematics had no functions without an inverse.

And now you need to drag everything-and-the-kitchensink in to make it stick. And even then you fail.

Failure hath a name; it is Doron Shadmi.
 
laca said:
Wow, you got one right! OK, axioms do not need proof, indeed. They do need to be useful, however, not to mention consistent. Care to show some useful result arrived at by starting from your axioms? Didn't think so... We all know you got exactly nothing, doron, and you keep on reasserting the same.
Click to expand...

I will add the whole Island A/Island B debacle to Doron Shadmi's list of errors, as well as his hilarious attempt to backpedal on "Traditional mathematics has no functions without an inverse" and of course the classic "Show that y=x^2 can be used as a mapping between two sets".

The new 'common ground' blahblah that Doron tries to introduce is something the rest of the world already knows as a grid (for ages). This is also why I used the x and y in the example; if he really had spatial_visual reasoning he would immediately have recognized that function.

But he hasn't, so he didn't :)
 
Little 10 Toes said:
When you are comparing two sets why aren't you starting with the first element of the sets?
Click to expand...

In addition to my previous post (http://www.internationalskeptics.com/forums/showpost.php?p=9825141&postcount=3574), please look at this comparison, that is done among one and only one set, which is the set of all natural numbers.

Code: 
            |{1,2,3,4,...}|
      ↑ ↑ ↑ ↑ ↕ ↕ ↕ ↕ 
|{...,7,5,3,1,2,4,6,8,...}|

As you can see the set of all natural numbers does not necessarily have a first member (in addition to not having last member), so in this case there are members that have functions without an inverse, which prevent the bijection from N into itself.

Here is an example of a set with unbounded amount of members, that is compared with itself on the common ground (no domain and codomain are used here):

Code: 
        The common ground                  |N| ¬= |N|           
               ...                             ...              
                                                                
                                                                
       |  |  |  |  |  |  |             |  |  |  |  |  |  |      
      _____________________           _____________________     
                                                                
       |  |  |  |  |  |  |             |  |  |  |  |  |  |      
      _____________________           __________1__2__3__4_     
                                                                
  ...  |  |  |  |  |  |  |  ...   ...  ↑  ↑  ↑  ↕  ↕  ↕  ↕  ... 
      _____________________           _5__3__1__2__4__6__8_     
                                                                
       |  |  |  |  |  |  |             |  |  |  |  |  |  |      
      _____________________           _____________________     
                                                                
       |  |  |  |  |  |  |             |  |  |  |  |  |  |      
                                                                
                                                                
               ...                             ...

By using the common ground (which its horizontal aspect is distinction, and its vertical aspect is comparison among distinct objects, where both distinction and comparison are non-local w.r.t the given objects) we do not use domain and codomain, because the common ground is the one and only one domain for all comparisons among all the distinct objects.

This common ground is not the Cartesian X/Y grid, as used, for example, by realpaladin in its y=x^2 expression, but it is the common ground of the relations among locality and non-locality (which is not restricted to Geometry or Metric space).

More details about the common ground are given in http://www.internationalskeptics.com/forums/showpost.php?p=9823863&postcount=3563.
 
Last edited:
realpaladin said:
It was you who claimed traditional mathematics had no functions without an inverse.
Click to expand...
This is exactly the case among functions that are used to compare given sets in order to find if their sizes are the same or not the same.

Again, please show how y=x^2 (which has no inverse function) is used in order to determine if two given sets have or do not have the same size (where also the case of set's self comparison is included).

I am waiting for you detailed demonstration.
 
Last edited:
doronshadmi said:
This is exactly the case among functions that are used to compare given sets in order to find if their sizes are the same or not the same.[...]
Click to expand...
Consider sets A = {1} and B = {3,4}. Using the traditional definition of cardinality, we compare them using this function

f:A->B, f(1) = 3. This function is an injection, which by the traditional definition of cardinality means |A|≤|B|. This function also has no inverse.
 
doronshadmi said:
This is exactly the case among functions that are used to compare given sets in order to find if their sizes are the same or not the same.

Again, please show how y=x^2 (which has no inverse function) is used in order to determine if two given sets have or do not have the same size (where also the case of set's self comparison is included).

I am waiting for you detailed demonstration.
Click to expand...

HAHAHAHAHAHAHA!

EDIT:
Because it suddenly dawns upon me that Doron Shadmi *really* can not do mathematics and he will not see the triviality of that proof:

We have set x and we have set y. The equality operator shows that for each y we have exactly one x. The equality operator *mandates* that x and y are of the same size.

Doron Shadmi, you can not do even grade-school mathematics.

And Doron, all the other constraints you are adding are just to get your lying butt out of a fix; you claimed that traditional mathematics has no functions without inverse. You did *not* claim that traditional mathematics, when put through the wringer of OM, has no function without inverse.

You are a cheating, lying person who simply can not concede a point. Bah!
 
Last edited:
BenjaminTR said:
Consider sets A = {1} and B = {3,4}. Using the traditional definition of cardinality, we compare them using this function

f:A->B, f(1) = 3. This function is an injection, which by the traditional definition of cardinality means |A|≤|B|. This function also has no inverse.
Click to expand...

|A|≤|B| is actually |A| < OR = |B|, where only < holds in this case.

Please correct me if I'm wrong.

According to the tradinitonal f:A->B, f(1) = 3 we actually have

Code: 
{1}
 ↓
{3,4}

Am I right?
 
Current status of Doron's Misconceptions (as of post 3583):



Handwaving consequences of his notation
Let's start with the handwaving after the ellipsis. Since Doron never bothered to do this, I did it for him:

1 → 1
2 →
3 → 2
4 → 3
5 → 4
...
n → n-1

If you do not write it out correctly one might surmise all manner of unicorn and pixie magic to happen after the ellipsis.

The right side has the 'no result' as a member of the set and is therefore *not* the set of natural numbers.
It is in fact the set of natural numbers + 'no result'.

Doron simply adds a member to the set, but does not count it. I would not want to do business with him...



Not seeing logic errors in his constructed constraints:

After a long and arduous back and forth with JSFisher Doron comes up with the following to show that you can have equality and non-equality at the same time:

Given two sets, A and B, if there is function from A to B such that (for each a in A there is at most one b in B) AND (for each b in B there is exactly one a in A) AND (there is at least one a in A that does not have any b in B) then |A| > |B|
Click to expand...
But this can be shown invalid by using a single set (Doron's set of all natural numbers, for example):
Given a set, A, if there is function from A to A such that (for each a in A there is at most one a in A) AND (for each a in A there is exactly one a in A) AND (there is at least one a in A that does not have any a in A) then |A| > |A|
Click to expand...




Removing all relations with the operands:

Doron now writes his concoction as:

1 ↔ 1
2 →
3 ↔ 2
4 ↔ 3
5 ↔ 4

Where the arrows are arbitrarily enabled/disabled functions.

It shows that in fact, we have three sets!

The set on the left (which may or may not be the natural numbers or the collection of toes Doron has on his left foot, since we never know as he can not complete his notation) then we have the set of switches that enable the 'function' and then on the right we have a set which might be the collection of numbers that Doron can count to without using his fingers.

The 'magical middle' set is what makes any of Doron's proof so utterly worthless; it has no relation to either the set on the left nor to the set on the right. It is an arbitrary set of boolean switches which is not defined.

Because this 'magical middle' is not defined no conclusion can be made about any of Doron's claims. The functions might be defined, but the set that toggles them is not.


Failure to show and/or predict results (therefore disqualifying it as science):

When confronted with the following thought experiment:
Ok, Doron, I understand your argument. So, let's do a thought experiment then. I know you are able to do those, so here it is:
Let's say we have two completely separated islands (no contact is ever made), with two separate colonies (they never know about each other).
On one island (call it island A) live only people that understand Doronetics/OM
On the other island (let's call it island B) live people who will never see or be aware of anything that Doronetics/OM can bring
Let's leave these islands to develop a culture for a while (100 years? 1000 years?)
After that time of complete separation, a discoverer (like Columbus, or Darwin) visits these islands. He is unaware of Doronetics/OM and can not get it.

What is the difference he will see? How will island A differ from island B?

Doron first tries to weasel out by ignoring parts. Then he claims to disagree. And finally he smugly announces that the discoverer does see a difference.
Doron gets annoyed because it is pointed out to him that even though the discoverer can not do OM, he still sees results, so why can't Doron show results?


Redefining his claims about traditional mathematics

With a lot of hubris and huffing and puffing Doron kept shouting and claiming that traditional mathematics was inferior to OM because it did not have functions without an inverse.

When confronted by the simple example of y=x^2 he suddenly starts adding attributes of Doronetics to it to make it incorrect. But his claims where about traditional mathematics, not OM functions.

And of course, he thinks he has something when asking for a detailed explanation on how we can determine the size of sets with that function... hilarious.


And some Doron classics:
doronshadmi said:
Please think about fog.

The not well-defined size of set with unbounded amount of members, is straightforward exactly as the identity of the fog is being unclear.
Click to expand...

and
doronshadmi said:
You are still missing my it.

|N| = OR not= |N|, or in other words, |N| is not well-defined.
Click to expand...
 
realpaladin said:
HAHAHAHAHAHAHA!

EDIT:
Because it suddenly dawns upon me that Doron Shadmi *really* can not do mathematics and he will not see the triviality of that proof:

We have set x and we have set y. The equality operator shows that for each y we have exactly one x. The equality operator *mandates* that x and y are of the same size.
Click to expand...
You are absolutely right, and since this is the case, there is bijection between set x and y.

In terms of comparison if there is a function from a given y member to a given x member, than there is also the inverse function from this given x member to this given y member, so this is not the case that there is no inverse function in y = x^2 expression (as you wrongly claim in http://www.internationalskeptics.com/forums/showpost.php?p=9824635&postcount=3568).
 
Last edited:
realpaladin said:
The 'magical middle' set is what makes any of Doron's proof so utterly worthless; it has no relation to either the set on the left nor to the set on the right. It is an arbitrary set of boolean switches which is not defined.
Click to expand...
It is perfectly defined as a function with no inverse, or as a function that has an input without an output.

Such a function is very useful in order to distinguished between the objective level of non-locality and the subjective level of localities.

Moreover, one enables to understand the difference between actual-infinity (which is beyond collections) and potential-infinity (which is at the level of collections).

Furthermore, the relations among non-locality and locality are non-entropic exactly because no amount of localities can be non-locality, and non-entropic environment is exactly the needed conditions for further (abstract or non-abstract) development of complexity (localities) out of one simplicity (non-locality), where we are some forms of this linkage among the non-local (simple) and the local (complex).

Such linkage is exactly the comprehensive frame that enables to actually unify ethics (in terms of evolutionary scale, which is not restricted to any particular religion, culture, political or economical systems, etc.) with logic\technology, where its users are both observers AND participators which are fully responsible to the results of their actions in any given (abstract or non-abstract) scales of life.
 
Last edited:
realpaladin said:
The right side has the 'no result' as a member of the set and is therefore *not* the set of natural numbers.
It is in fact the set of natural numbers + 'no result'.
Click to expand...
realpaladin does not have the needed abstract abilities in order to distinguish between 'no result' and
 
doronshadmi said:
You are absolutely right, and since this is the case, there is bijection between set x and y.

In terms of comparison if there is a function from a given y member to a given x member, than there is also the inverse function from this given x member to this given y member, so this is not the case that there is no inverse function in y = x^2 expression (as you wrongly claim in http://www.internationalskeptics.com/forums/showpost.php?p=9824635&postcount=3568).
Click to expand...

The above answer was made possible by Doron Shadmi's continuous redefinition of terms.
 
Doron, could we inquire about your latest definition of cardinality? Thanks.
 
I don't think Doron will continue with this nonsense; the book 'Nothing' that I posted the link of already states that the things Doron thinks are novel, regular scientists already knew for ages.

He first needs to refute the regular/traditional notion of nothing before *any* of his work can even get the inkling of 'value'.
 
One never knows, but he's still rambling on about sets and sizes, so I thought I might as well ask for the latest word salad with a side dish of gibberish.
 
laca said:
One never knows, but he's still rambling on about sets and sizes, so I thought I might as well ask for the latest word salad with a side dish of gibberish.
Click to expand...

It is gibberish only if you do not use your verbal AND visual-spatial skills.
 
laca said:
One never knows, but he's still rambling on about sets and sizes, so I thought I might as well ask for the latest word salad with a side dish of gibberish.
Click to expand...

Yes, I am still wondering about that. How to get from a different 'view' on sets, sizes, cardinality, logic etc, to his vison of peace and understanding.

The 'framework' never gets anywhere. I tried conceding, agreeing, but all he seems to want is to dicker and bicker.
It seems it does not matter if someone agrees; he just won't move forward.

Also, his UMES 'paper' is hysterical in that it starts rambling from the get-go. How that will turn into a novel before he sheds his mortal coil I am not sure.

But it gets boring if he keeps on adding stuff to make |N|>|N| a truth in his system.

Many have asked him 'ok, and then what?', but he keeps banging on about it as proud as a baby of his poo-filled diaper.
 
realpaladin said:
For some odd reason I am of the conviction that the generated papers make more sense than OM; both are devoid of meaning, but the generated papers have structure and definitions.
Click to expand...

Yes, I think that doron is subconsciously avoiding definitions, because he knows deep down that once he starts getting more precise, he starts getting shot down way more easily. So he stays in his comfort zone, mindlessly spouting random stuff about visual_spatial and verbal_symbolic, randomly capitalizing and parenthesizing and so on. What he doesn't realize is that this makes him even more of a joke.
 
realpaladin said:
By the way Doron, you are too late with your NoThing NonSense!

http://www.newscientist.com/article/dn24442-nothing--the-new-book-from-new-scientist.html

I have read a few chapters (I got a copy, yes) and it absolutely shreds *your* conceptions of NoThing.
Click to expand...

EDIT:

Not at all.

Please look at this question?
"What happens in our brains when we try to think about nothing?"
Click to expand...
The answer: Any thought, no matter what subject is considered, is not the actual

There is an essential difference between "think about nothing" and "think nothing"(= beyond thoughts).

By analogy ,any vocal expression about silence, is not actually silence.
 
Last edited:
realpaladin said:
The above answer was made possible by Doron Shadmi's continuous redefinition of terms.
Click to expand...
You are wrong once again, exactly because you force the notion of Cartesian X/Y framework of (x,y) pairs on the notion of common ground of the non-local aspects of Distinction and Comparison grid, which are in relations with the localities on that common ground.

The notion of common ground as a comprehensive one and only one domain for the relations among non-locality and locality, which is not restricted to the notion of domain and codomain.

By using the common ground as a comprehensive one and only one domain for the relations among non-locality and locality, one actually works in terms of multiverse of all possibilities, where one of the possibilities is to compare between two copies of sets (which means that they have the same members) in more than one way.

So let's refine what I wrote about this subject, according to the notion of multiverse.

By using the notion of the common ground in terms of multiverse, we immediately understand that

Code: 
{1,2,3,4,5,...}
 ↓ ↕ ↕ ↕ ↕ 
  {1,2,3,4,...}

OR

Code: 
{1,2,3,4,...}
 ↕ ↕ ↕ ↕ 
{1,2,3,4,...}

are simply two possibilities of comparisons in that multiverse.

Traditional Mathematics is simply some part of the mutiverse, which is focused only on the particular comparison of the form

Code: 
{1,2,3,4,...}
 ↕ ↕ ↕ ↕ 
{1,2,3,4,...}

http://en.wikipedia.org/wiki/The_Hidden_Reality:_Parallel_Universes_and_the_Deep_Laws_of_the_Cosmos can be vary helpful in order to grasp the notion multiverse.

I take a further step by using the notion of the common ground multiverse, which enables the relations among non-locality (the objective) and locality (the subjective(s)).

The beautiful thing about the the common ground multiverse, is that it is naturally non-entropic, and this is exactly the optimal conditions for further development of creatures like us.

We also are able to understand that Reductionism is derived from a school of thought that is focused on some particular properties of the common ground multiverse.

At this point I wish to say "big thank you BenjaminTR" without your excellent criticism in http://www.internationalskeptics.com/forums/showpost.php?p=9814916&postcount=3488 I was possibly missing the notion of the common ground multiverse.

More details are given in http://www.internationalskeptics.com/forums/showpost.php?p=9826156&postcount=3579.
 
Last edited:
Status
Not open for further replies.

Back
Top Bottom