Re: Simple enough for every reader?

On 09.06.2025 02:38, Ben Bacarisse wrote:

WM <wolfgang.mueckenheim@tha.de> writes:

You cannot disprove any of my results.

 You have admitted that in WMaths you can't (yet?) define set membership,

Potentially infinite sets are not fixed. Therefore membership is not fixed.

Is this still the state of WMaths

When accepting Cantor's actually infinite set, then membership is fixed. But the subset of definable members is also not fixed.

Have you something substantial to say about dark numbers?

 Have you nothing substantial to say about why the exam questions you
posed and challenged me to answer was wrong?  I posted a function b : N
-> Q+ and you won't say whether it is not injective and/or surjective.

It is neither injective not surjective. The reason is what you refuse to answer:
(...(((ℕ \ {1}) \ {2}) \ {3}) ...) = { }
is wrong for all singletons of definable numbers.

You "know" what is wrong without being able to disprove it.

Try the above task. Fail.

I know how to prove that b is both injective and surjective.

Try the above task. Fail.
Regards, WM