From Newsgroup: sci.math

Am 24.03.2026 um 22:44 schrieb Tristan Wibberley:

On 24/03/2026 19:29, WM wrote:

Here is the complete proof of a contradiction in set theory: [qed]

I see (sic!).
.
.
.
--
Diese E-Mail wurde von Avast-Antivirussoftware auf Viren gepr|+ft. www.avast.com
--- Synchronet 3.21f-Linux NewsLink 1.2

From Newsgroup: sci.math

On 04/29/2026 07:43 PM, Moebius wrote:

Am 24.03.2026 um 22:44 schrieb Tristan Wibberley:

On 24/03/2026 19:29, WM wrote:

Here is the complete proof of a contradiction in set theory: [qed]

I see (sic!).

.
.
.

Hm, why do the bot-trolls never either fight each other or aid each other?

One may imagine they're all one stupid sock-puppet of "appropriated"
ignorant dupes.

"Archimedes Plutonium" at least had "the brains of a dishwasher".

Then, I suppose there are "trolls" and "anti-trolls", with those
being slightly less obvious to pick out.



--- Synchronet 3.21f-Linux NewsLink 1.2

From Newsgroup: sci.math

On 30/04/2026 19:10, Ross Finlayson wrote:

On 04/29/2026 07:43 PM, Moebius wrote:

Am 24.03.2026 um 22:44 schrieb Tristan Wibberley:

On 24/03/2026 19:29, WM wrote:

Here is the complete proof of a contradiction in set theory:-a-a [qed]

I see (sic!).

.
.
.

Hm, why do the bot-trolls never either fight each other or aid each other?

They all want more attention than the others. Fighting with or aiding
another would direct a part of the attention to a competitor.
--
Mikko
--- Synchronet 3.21f-Linux NewsLink 1.2

From Newsgroup: sci.math

Am 30.04.2026 um 18:10 schrieb Ross Finlayson:

On 04/29/2026 07:43 PM, Moebius wrote:

Am 24.03.2026 um 22:44 schrieb Tristan Wibberley:

On 24/03/2026 19:29, WM wrote:

Here is the complete proof of a contradiction in set theory:-a-a [qed]

Hm, why do the bot-trolls never either fight each other or aid each other?

One may imagine they're all one stupid sock-puppet of "appropriated"
ignorant dupes.

"Archimedes Plutonium" at least had "the brains of a dishwasher".

Even a brain of a dishwasher should suffice to understand the following argument:
The Binary Tree has countably many nodes and, according to Cantor,
uncountably many paths.

But the basic element of the Binary Tree is the node
|
o
/ \
which splits an incoming sheaf of paths into two sheaves of paths, i.e.,
it makes one more sheaf distinguishable from the already separated sheaves.

Therefore only countably many sheaves of paths (including those carrying
only one path - if they are existing at all) can get separated.

Regards WM



--- Synchronet 3.21f-Linux NewsLink 1.2

From Newsgroup: sci.math

On 05/01/2026 01:55 AM, Mikko wrote:

On 30/04/2026 19:10, Ross Finlayson wrote:

On 04/29/2026 07:43 PM, Moebius wrote:

Am 24.03.2026 um 22:44 schrieb Tristan Wibberley:

On 24/03/2026 19:29, WM wrote:

Here is the complete proof of a contradiction in set theory: [qed]

I see (sic!).

.
.
.

Hm, why do the bot-trolls never either fight each other or aid each
other?

They all want more attention than the others. Fighting with or aiding
another would direct a part of the attention to a competitor.

Hm. Also the absence of learning besides the invincible ignorance,
may seem to help identify qualities and competencies of reasoners,
about what analytical bridges are made lit or for "Zeno crossing".

Burns if you recall or J. Burns was an exemplary sort of reasoner,
or Virgil H., for examples. I'd like to imagine they aren't bots,
since bots have infested Usenet for decades, besides that the actual
sorts of corporate concerns on their platforms have commoditized
"Instant Audiences" to make for fake friends ever since record
companies spent most their budget on buying their own albums.


--- Synchronet 3.21f-Linux NewsLink 1.2