• Re: Replacement of Cardinality (defining numbers as half finite, half i

    From Jim Burns@21:1/5 to Ross Finlayson on Tue Aug 6 07:57:20 2024
    XPost: sci.math

    On 8/5/2024 11:05 PM, Ross Finlayson wrote:
    On 08/05/2024 03:19 PM, Jim Burns wrote:
    On 8/5/2024 3:04 PM, WM wrote:

    For every number of unit fractions
    NUF(x) gives the smallest interval (0, x).

    For  each real x > 0
    for each finite cardinal k > 0
    there is a finite.unit.fraction uₖ such that
    |⅟ℕᵈᵉᶠ∩[uₖ,x)| = k
    uₖ = ⅟⌊k+⅟x⌋

    For  each x > 0
    for each finite cardinal k > 0
    there is a finite.unit.fraction uₖ such that
    |⅟ℕᵈᵉᶠ∩[uₖ,x)| = k
    ⅟(1+⅟uₖ) ∈ ⅟ℕᵈᵉᶠ∩(0,uₖ)
    k < |⅟ℕᵈᵉᶠ∩(0,x)|

    For  each x > 0
    for each finite number k
    k ≠ |⅟ℕᵈᵉᶠ∩(0,x)|

    For  each x > 0
    ⅟ℕᵈᵉᶠ∩(0,x) is not finite.

    Not.finite what?

    Not finite set, not finite number?

    Not.finite set ⅟ℕᵈᵉᶠ∩(0,x) of
    not.infinite.and.not.infinitesimal unit.fractions.

    ----
    Definition.

    A finite order is a total order in which
    each non.{}.subset is 2.ended ==
    each non.{}.subset holds its max and its min.

    An infinite order is a total order which
    is not finite.

    ⎛ Lemma:
    ⎝ No set has both a finite and an infinite order.

    A set with a finite order is finite.

    A set with an infinite order is infinite.

    ----
    Definition.

    Each non.{} S ⊆ ℕᵈᵉᶠ has min.S ∈ S.

    Each j ∈ ℕᵈᵉᶠ has successor j+1 ∈ ℕᵈᵉᶠ

    0 = min.ℕᵈᵉᶠ
    Each non.0 k ∈ ℕᵈᵉᶠ has predecessor k-1 ∈ ℕᵈᵉᶠ

    ----
    Consequences.

    Each bounded subset of ℕᵈᵉᶠ is finite.
    ℕᵈᵉᶠ and each of its unbounded subsets is infinite.

    Each element of infinite ℕᵈᵉᶠ is
    finitely.preceded and infinitely.succeeded.

    Each is finite, all are infinite.

    Similarly,
    for each u ∈ ⅟ℕᵈᵉᶠ
    ⅟ℕᵈᵉᶠ∩[u,1] is finite
    ⅟ℕᵈᵉᶠ∩(0,u] is infinite

    Sometimes it's hard to convey intended inflection

    Very true.

    I depend upon others to point out those times to me.
    Of course 𝐼 know what I mean.
    That won't tell me that others know. Or don't.

    And, perhaps I merely have room for improvement in
    how I express my ideas.

    But perhaps I didn't carry the 2. https://www.gocomics.com/bloomcounty/1988/07/10

    It's a significant help to me.

    What I would ask,
    is that you surpass,
    the inductive impasse,
    with the infinite super-task.

    Induction is a finite task of
    reasoning about infinitely.many.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Jim Burns@21:1/5 to Ross Finlayson on Tue Aug 6 20:27:30 2024
    XPost: sci.math

    On 8/6/2024 3:58 PM, Ross Finlayson wrote:
    On 08/06/2024 04:57 AM, Jim Burns wrote:
    On 8/5/2024 11:05 PM, Ross Finlayson wrote:

    What I would ask,
    is that you surpass,
    the inductive impasse,
    with the infinite super-task.

    Induction is a finite task of
    reasoning about infinitely.many.

    Thus deductive inference, ..., or, is it?

    Inductive inference is one kind of
    deductive inference:
    a deductive inference from properties we know
    finite.ordinals have because they are finite.ordinals.

    ⎛ What Mathematics calls "induction" is deduction.
    ⎜ What Physics calls "induction", for example,
    ⎜ our conclusion that the sun will rise tomorrow
    ⎜ because we know of many yesterdays it rose,
    ⎝ is a different kettle of fish.

    The super-task or Thomson's Lamp has helped
    to establish the infinitary as within reason.

    If
    ⎛ making finite.length claims which
    ⎜ we know are true of infinitely.many
    ⎜ by making a claim about an indefinite one
    ⎝ which we know has no exceptions
    is something you (RF) consider a supertask,
    then
    we -- although finite -- perform super.tasksᴿꟳ,
    because (making...) is something we do.

    I prefer not to consider that a super.task,
    primarily because we are finite, which
    seems to contradict our performing super.tasks.

    However, my point is that we
    ⎛ make claims we know are true of infinitely.many
    ⎜ by making a claim about an indefinite one
    ⎝ which we know has no exceptions,
    and therefore,
    however things stand with supertasks,
    we can, by (making...), learn about infinitely.many.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Aug 7 02:38:50 2024
    XPost: sci.math

    Am 07.08.2024 um 02:27 schrieb Jim Burns:

    however things stand with supertasks, [...]

    Here my 2 cents: Some "supertasks" (thought experiments) DO lead*) to a specific "final result" (from a "logical" point of view), some NOT.

    Thomson's Lamp is of the latter type.

    It's final state is simply not "determined" by all it's "earlier" states.

    _____________________

    *) in a certain sense; usually considering some additional assumptions.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Aug 7 02:37:47 2024
    XPost: sci.math

    Am 07.08.2024 um 02:27 schrieb Jim Burns:

    however things stand with supertasks, [...]

    Here my 2 cents: Some "supertasks" (thought experiment) DO lead*) to a
    specific "final result" (from a "logical" point of view), some NOT.

    Thomson's Lamp is of the latter type.

    It's final state is simply not "determined" by all it's "earlier" states.

    _____________________

    *) in a certain sense; usually considering some additional assumptions.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Moebius@21:1/5 to All on Wed Aug 7 02:45:11 2024
    XPost: sci.math

    Am 07.08.2024 um 02:38 schrieb Moebius:
    Am 07.08.2024 um 02:27 schrieb Jim Burns:

    however things stand with supertasks, [...]

    Here my 2 cents: Some "supertasks" (thought experiments) DO lead*) to a specific "final result" (from a "logical" point of view), some NOT.

    Thomson's Lamp is of the latter type.

    It's final state is simply not "determined" by all it's "earlier" states.

    In contrast, the "vase-marbles problem" can be completely "analyzed" as
    a supertask. Not "paradoxical" at all!

    _____________________

    *) in a certain sense; usually considering some additional assumptions.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)
  • From Python@21:1/5 to All on Tue Aug 13 05:10:44 2024
    XPost: sci.math

    Le 13/08/2024 à 05:07, Ross Finlayson a écrit :
    On 08/06/2024 07:30 PM, Ross Finlayson wrote:
    On 08/06/2024 05:37 PM, Moebius wrote:
    Am 07.08.2024 um 02:27 schrieb Jim Burns:

    however things stand with supertasks, [...]

    Here my 2 cents: Some "supertasks" (thought experiment) DO lead*) to a
    specific "final result" (from a "logical" point of view), some NOT.

    Thomson's Lamp is of the latter type.

    It's final state is simply not "determined" by all it's "earlier"
    states.

    _____________________

    *) in a certain sense; usually considering some additional assumptions.

    In nature, in the very heart of the nucleus of the atom,
    where according to plain mathematics the most concentrated
    force of the strong nuclear force that holds the atom's
    nucleus together would be, is: "asymptotic freedom".

    As a supertask, according to induction, in the concentric
    model of the force that is the binding energy that holds
    together the very substance of matter itself, in the theory,
    is "asymptotic freedom".

    This is as was theorized by Salam and Weinberg in the 1970's,
    and within a few years for which prizes in physics were awarded.

    The geometric series, Zeno's, adds up to one. Of course, in
    nature, in the mesoscale or the classical, that's always
    perfectly true.


    The idea that there are anti-inductive results in the
    infinitary, is even a bit stronger than the usual apeiron
    or non-results in the infinitary, though, the most usual
    combined inductive and deductive results, about the
    infinitely-divisible in a space, are most strong.

    That is to say, calculus is imperfect and only at best
    a close approximation and always with a non-zero error term,
    except in the infinite limit, where it is perfect, and,
    it not only goes to that once, it must be that it goes to
    that all the many times, because we don't merely have a
    fundamental theorem of differentiation, yet a fundamental
    theorem of integration, which sums no less than infinitely
    many areas to be correct in the usual sense, and no less.


    These days some peopls don't even know that various
    conjectures of Goldbach in the number-theoretic, or
    about the lengths of arithmetic progressions or Szemeredi,
    are rather formally undecide-able and with models of
    standard and non-standard integers, both fragments
    and extensions, both so and not so.


    Then, induction, alone, does not suffice, and,
    deduction, together with properties of the space
    like constancy in measure and proportion in relation,
    make so that the geometric series has a sum.

    Calculus is only correct in the _infinite_ limit.


    Then, for mathematical platonists, that must be real
    somehow, just like there's no perfect circle, yet there
    is, an object of mathematics, there's infinity,
    an object of mathematics.


    Then, results in the non-standard like summing the
    geometric series or Zeno's, or everyone's favorite
    first non-standard not-a-real-function Dirac's delta,
    which you can notice on the Wiki is called a "function",
    again, continue.




    Ross, could you reach friends? Family? Any kind of social
    service professionals? Neighborhoods? Whatever. You are not
    going well AT ALL.

    --- SoupGate-Win32 v1.05
    * Origin: fsxNet Usenet Gateway (21:1/5)