Liste des Groupes | Revenir à s logic |
On 08/11/2024 09:44 PM, Jim Burns wrote:On 8/11/2024 7:39 PM, Ross Finlayson wrote:
Starting with a theory _without_
the constant introduced named omega,
i.e., finite sets,
For P(z),
use a description 𝕆ᶠⁱⁿ(z) of a finite ordinal,
and ω := {z:𝕆ᶠⁱⁿ(z)} exists
>
For example, use
𝕆ᶠⁱⁿ(z) ⇔
(z ∋ {} ∧ ∀y ∈ z+1: y≠{} ⇒ ∃x∈z: x+1=y)
∨ (z = {})
>
z+1 = z∪{z}
Then, omega, as you've defined it,>
ω := {z:𝕆ᶠⁱⁿ(z)}
>contains itself,
_Where_ though?>I'm curious, now that you have>
a beginning and an end of
the finite, or 0 and omega in ZF,
ω is the least.upper.bound of the finites.
ω is not a finite.
ω is not the upper.end of the finites.
The upper.end of the finites doesn't exist.
Here though
it's beginning ... ( ... infinitely-many ...) ... end,For ω as I've defined it, no upper.end exists.
where the upper.end of the finites always exists.
Then you claim to haveTo review:
an axiom of restriction of comprehension of the finites
unless Russell grants youAh.
a dispensation of Russell's retro-thesis,
and say it's always so for others, too,
congratulations,
you claim to have invented a mathematics
where you = Russell.
Les messages affichés proviennent d'usenet.