Liste des Groupes | Revenir à s logic |
On 19.06.2025 09:16, Mikko wrote:No, it does not. That implication is not acceptable without a proof.On 2025-06-18 13:48:13 +0000, WM said:But removing all in their natural or any given order (that does not allow two or more to take the same place) implies a last removed one.
On 18.06.2025 11:39, Mikko wrote:It is also possible to order them differently. Removing all leavesOn 2025-06-17 10:57:01 +0000, WM said:But the order exists for all defined natural numbers. We know of each one its predecessor and its successor, if those are existing.
On 17.06.2025 12:16, Mikko wrote:True.On 2025-06-16 10:50:58 +0000, WM said:If all natnumbers are subtracted, none remains.
The error above is that the expression "the last one" is used without
proving that there is a last one.
If all natnumbers are subtracted in their order, one after the other, none remains.The order does not matter,
nothing, whther you remove in some order or another or all at the
same time.
Euclid's postulates say nothing about that.The radius is a length that allows to construct every point of the circumference. Further compasses are in use for constructions.Euclid did not specify how to draw a circle. He merely postulated thatthe result is the same anyway.That means that none remains. I case of known order we know the last one subtracted.But that does not prove that your "the last one" denotes anything.How can an ordered set be completely subtracted in its given order without a last one?
for any given centre and radius it can be done.
Cantor originally did. The ZF, which is the most commonly used formalLikewise a set theoryBut it postulates or accepts that an order exists.
does not specify how one set can subtracted from another.
It merely postulates that it can be done.It is outside of the scope of the theory. In a particular interpretation
I ask how it can be done. Am I the first? Is it forbidden?
Les messages affichés proviennent d'usenet.