Liste des Groupes | Revenir à s logic |
On 08/17/2024 02:12 PM, Jim Burns wrote:
Lemma 1.
⎛ No set B has both
⎝ finiteᵖᵍˢˢ order ⟨B,<⟩ and infiniteᵖᵍˢˢ order ⟨B,⩹⟩.
>
Definition.
⎛ An order ⟨B,<⟩ of B is finiteᵖᵍˢˢ iff
⎜ each non.empty subset S ⊆ B holds
⎝ both min[<].S and max[<].S
>
A finiteᵖᵍˢˢ set has a finiteᵖᵍˢˢ order.
An infiniteᵖᵍˢˢ set doesn't have a finiteᵖᵍˢˢ order.
>
ℕ ℤ ℚ and ℝ each have infiniteᵖᵍˢˢ orders.
In the standard order,
ℕ ℤ ℚ and ℝ are subsets of ℕ ℤ ℚ and ℝ with
0 or 1 ends.
Thus, the standard order is infiniteᵖᵍˢˢ.
Thus, by lemma 1, no non.standard order is finiteᵖᵍˢˢ.
>
They do not have any finiteᵖᵍˢˢ order.
Whatever non.standard order you propose,
you are proposing an infiniteᵖᵍˢˢ order;
you are proposing an order with
some _subset_ with 0 or 1 ends.
>
One more time:
In a finiteᵖᵍˢˢ order,
_each non.empty subset_ is 2.ended.
Two ends for the set as a whole isn't enough
to make the order finiteᵖᵍˢˢ.
So, with "infinite in the middle", it's justIn the interest of of promoting understanding,
that the natural order
>
0, infinity - 0,
1, infinity - 1,
...
>
has pretty simply two constants "0", "infinity",
then successors,
and it has all the models where infinity equates to
one of 0's successors, and they're finite,
and a model where it doesn't, that it's infinite.
Then, also it happens thatIn the usual order of successors and predecessors,
there's the usual order of sucessors and predecessors
that happens to hold,
naturally enough those are both infinite also.
At any rate, just identifyingThere are two kinds of ordinals,
even if just defining
the "predecessors of a limit ordinal"
as with no other facility than
"the successors of a limit ordinal",
So, ..., "well-order the reals"."An inaccessible ordinal exists" ⇒
Les messages affichés proviennent d'usenet.