Path: ...!local-3.nntp.ord.giganews.com!local-4.nntp.ord.giganews.com!Xl.tags.giganews.com!local-2.nntp.ord.giganews.com!news.giganews.com.POSTED!not-for-mail
NNTP-Posting-Date: Fri, 21 Jun 2024 01:36:16 +0000
Subject: Re: how
Newsgroups: sci.math
References: <qHqKnNhkFFpow5Tl3Eiz12-8JEI@jntp>
 <3ac8520c-96fd-49e4-85da-620c64c20515@att.net>
 <5fWjlqMjzUHFygAk1yVCvtuDLOM@jntp>
 <067c2a88-553e-4eb5-9ead-efb0e9a39d43@att.net>
 <VIhO2Ae_yrPsVjSsDz1yJZy_E4g@jntp>
 <7792d74c-4ae9-4909-81cc-7d9975e8d510@att.net>
 <xJmCht9ieNLiQMSR57t03IZLuXs@jntp>
 <c178dd0f-4bb0-47d9-b1e2-e8a7c8b851c0@att.net>
 <mpLoi51m0coJyOmPmE1fRwX_DDg@jntp>
 <c4a5b51e-a9c3-4d3f-b7f9-06a53593d836@att.net>
 <8SqWWZhhlVTCtwSAp_E7XuodBl8@jntp>
 <74cb7a4e-39ad-4832-80e8-2855d160af8a@att.net>
From: Ross Finlayson <ross.a.finlayson@gmail.com>
Date: Thu, 20 Jun 2024 18:36:34 -0700
User-Agent: Mozilla/5.0 (X11; Linux x86_64; rv:38.0) Gecko/20100101
 Thunderbird/38.6.0
MIME-Version: 1.0
In-Reply-To: <74cb7a4e-39ad-4832-80e8-2855d160af8a@att.net>
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Message-ID: <jfycna_FF8aNROn7nZ2dnZfqn_qdnZ2d@giganews.com>
Lines: 174
X-Usenet-Provider: http://www.giganews.com
X-Trace: sv3-XpIxNjx5HjdmLAvXnhATPJXM0s2ktXi4NgvcltFBwU4vjV5gMqR9yZ9tJ6lM3wcWpXVhjeH7HCaXkX6!RVV8wQojb2G9KFtJprHm/ww+4SSFfHVH7pPchf1bfCOJcAIsygDh+anFmbHd5jh7l3U9rz/1M+g=
X-Complaints-To: abuse@giganews.com
X-DMCA-Notifications: http://www.giganews.com/info/dmca.html
X-Abuse-and-DMCA-Info: Please be sure to forward a copy of ALL headers
X-Abuse-and-DMCA-Info: Otherwise we will be unable to process your complaint properly
X-Postfilter: 1.3.40
Bytes: 7131

On 06/20/2024 05:18 PM, Jim Burns wrote:
> On 6/19/2024 2:37 PM, WM wrote:
>> Le 18/06/2024 à 23:06, Jim Burns a écrit :
>
>>> For subsets of the minimal inductive meta.set
>>> {i:∀₃Xᴬ⤾⁺¹₀:X∋i}
>>> only the empty set does not hold a first element.
>
>>> If the set of numbers.remaining
>>>   does not hold a first element,
>>> then the set of numbers.remaining
>>>   is the empty set.
>>
>> That is your big mistake!
>
> Xᴬ⤾⁺¹₀ "X is inductive"  ⇔
> ∀₂j∈X: X∋j⁺¹ ∧ X∋0
>
> Under proposal 3
> because predicate ∀₃Xᴬ⤾⁺¹₀:X∋i
> has truth.values for all existing₂ sets,
> meta.set {i:∀₃Xᴬ⤾⁺¹₀:X∋i} exists₃ such that
> j e {i:∀₃Xᴬ⤾⁺¹₀:X∋i}  ⇔  ∀₃Xᴬ⤾⁺¹₀:X∋j
>
> {i:∀₃Xᴬ⤾⁺¹₀:X∋i} is the minimal inductive
> For convenience,
> ⋂{Xᴬ⤾⁺¹₀}  =  {i:∀₃Xᴬ⤾⁺¹₀:X∋i}
>
> The minimal inductive is inductive.
> Each inductive meta.set superset the minimal inductive.
> (⋂{Xᴬ⤾⁺¹₀})ᴬ⤾⁺¹₀
> Yᴬ⤾⁺¹₀  ⇒  Y ⊇ ⋂{Xᴬ⤾⁺¹₀}
>
>
> ⟨0…n⟩ᶠⁱˢᵒⁿ "⟨0…n⟩ is a FISON"  ⇔
> 0 ≤ᴬ∈ ⟨0…n⟩ ∋ᴬ≤ n  ∧
> ∀₃F ⊆ ⟨0…n⟩: ∅ ≠ F ᴬ<ᴬ ⟨0…n⟩\F ≠ ∅  ⇒
>   ∃₂i ≥ᴬ∈ F:
>   ∃₂j ≤ᴬ∈ ⟨0…n⟩\F:
>   i⁺¹ = j
>
> Under proposal 3
> because predicate ∃₃⟨0…n⟩ᶠⁱˢᵒⁿ∋i
> has truth values for all existing₂ sets i
> meta.set {i:∃₃⟨0…n⟩ᶠⁱˢᵒⁿ∋i} exists₃ such that
> j ∈ {i:∃₃⟨0…n⟩ᶠⁱˢᵒⁿ∋i}  ⇔  ∃₃⟨0…n⟩ᶠⁱˢᵒⁿ∋j
>
> {i:∃₃⟨0…n⟩ᶠⁱˢᵒⁿ∋i} is the union of FISONs
> For convenience,
> ⋃{⟨0…n⟩}  =  {i:∃₃⟨0…n⟩ᶠⁱˢᵒⁿ∋i}
>
> ⋃{⟨0…n⟩} is inductive.
> ⋃{⟨0…n⟩} is a superset of ⋂{Xᴬ⤾⁺¹₀}
>
> Therefore,
> minimal inductive ⋂{Xᴬ⤾⁺¹₀} holds only
> FISON.end elements of ⋃{⟨0…n⟩}
>
>>> For subsets of the minimal inductive meta.set
>>> {i:∀₃Xᴬ⤾⁺¹₀:X∋i}
>>> only the empty set does not hold a first element.
>
>>> If the set of numbers.remaining [in ⋂{Xᴬ⤾⁺¹₀}]
>>>   does not hold a first element [in ⋂{Xᴬ⤾⁺¹₀}],
>>> then the set of numbers.remaining [in ⋂{Xᴬ⤾⁺¹₀}]
>>>   is the empty set.
>>
>> That is your big mistake!
>
> For subsets of the union ⋃{⟨0…n⟩} of FISONs
> only the empty set does not hold a first element.
> [1]
>
> Subsets of the minimal inductive ⋂{Xᴬ⤾⁺¹₀} are
> subsets of the union ⋃{⟨0…n⟩} of FISONs of which
> only the empty set does not hold a first element.
>
> [1]
> | Assume S ⊆ ⋃{⟨0…n⟩} is nonempty
> |
> | kₛ is in S
> | and in ⋃{⟨0…n⟩}
> | and in FISON ⟨0…kₛ⟩
> | ⟨0…kₛ⟩∩S ≠ ∅
> |
> | In FISON ⟨0…kₛ⟩
> | exists first jₛ such that
> | ⟨0…jₛ⟩∩S ≠ ∅  &  ⟨0…jₛ⁻¹⟩∩S = ∅
> |
> | jₛ is first in S
>
> Therefore,
> for subsets of the union ⋃{⟨0…n⟩} of FISONs
> only the empty set does not hold a first element,
> and,
> for subsets of minimal inductive ⋂{Xᴬ⤾⁺¹₀}
> only the empty set does not hold a first element.
>
>> Start to count, continue, continue, continue,.. .
>> What you can determine that you can count.
>> The set of not counted numbers remains infinite.
>> But you cannot determine a first element.
>> All your following waffle is worthless,
>> because it violates this fundamental truth.
>> Simply try it instead of "proving"
>> counterfactual nonense.
>
> We do not count infinitely.many.
>
> We do not even count Avogadroᴬᵛᵒᵍᵃᵈʳᵒ.many,
> not in our 13.7×10⁹.year.old universe, and
> Avogadroᴬᵛᵒᵍᵃᵈʳᵒ is barely a start on infinity.
>
> Instead,
> we make or find or learn of
> finite claim.sequences of only not.first.false.
> which we know _can only hold_
> true claims about Avogadroᴬᵛᵒᵍᵃᵈʳᵒ
> which we do not count.to,  and
> true claims about infinity
> which we do not count.to.
>
> Therefore,
> because we can make or find or learn of
> finite claim.sequences of only not.first.false
> which hold the claim
> ⎛ for subsets of minimal inductive ⋂{Xᴬ⤾⁺¹₀}
> ⎝ only the empty set does not hold a first element.
> we know that claim can only be true.
>
> We can learn this in our 13.7×10⁹.year.old universe.
>
>

You know about 30 years about
it was only 13.4, billion years old.

Also, according to NIST CODATA, particles get smaller
every five years.

Also, about 30 years ago, the universe
was about 99 percent red-shift,
and now it's about 51 percent.

The latest data, ....

Some have this as things like
"hey, cheer up, Einstein, the cosmological
constant is a good idea again".

And he might be like "well I still want
to figure out a total field theory".

And you might find him much in your favor
"and I want it to be so that I can shut up
and compute".


Imagine the simplest sort of argument that
deduction immediately solves, yet induction
never does.

"Not ultimately untrue."

If you reject that, then remember that
========== REMAINDER OF ARTICLE TRUNCATED ==========