Liste des Groupes | Revenir à s math |
On 11/23/2024 3:45 PM, WM wrote:
Not at all!for every interval (0,n]All the hats for which
the relative covering is 1/10,
independent of how the hats are shifted.
This cannot be remedied in the infinite limit
because
outside of all finite intervals (0, n]
there are no further hats available.
if there are G.many then there are G^G^G.many
are enough to "remedy" the 1/10.relative.covering
If each G can match G^G^GThat is a false assumption.
Matching.a.proper.subset isI accept logic. Exchange of two elements never leads to loss of one of them. You do not.
the sort of behavior which permits Bob to disappear
with enough room.swapping _inside_ the Hotel.
You (WM) treat that behavior as proof that
we are wrong and you (WM) are right.
What it is is proof thatNonsense. Logic is also prevailing in infinite sets.
not all sets behave like finite sets.
If there are enough hats for G natural numbers,There is no such number because the set of definable hats is potentially infinite.
then there are also enough for G^G^G natural numbers.
The number G^G^G is not.first for which
there are NOT enough hats.
Therefore,We do not disagree. Therefore you need not prove a difference for G and G^G^G.
the number G^G^G is not.first for which
there are NOT enough hats.
A similar argument can be made forNo, it can be made for each definable natural number, i.e., for a number belonging to a tiny finite initial segment which is followed bay almost all numbers.
each natural number.
That is a definable number.It is not dark what we mean by 'natural number'.Consider the set of natural numbers for which>
there are NOT enough hats.
It is dark.
A natural number is countable.to from.0
The natural numbers "fail" atIf they are infinitely many but complete, then they and their number don't vary. |ℕ| - 1 < |ℕ| < |ℕ| + 1.
being finitely.many.
It is nothing more than that.
Les messages affichés proviennent d'usenet.