Deutsch   English   Français   Italiano  
<1016h9p$35it9$1@dont-email.me>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: Mikko <mikko.levanto@iki.fi>
Newsgroups: sci.logic
Subject: Re: Simple enough for every reader?
Date: Wed, 28 May 2025 11:25:29 +0300
Organization: -
Lines: 61
Message-ID: <1016h9p$35it9$1@dont-email.me>
References: <100a8ah$ekoh$1@dont-email.me> <100ccrl$upk6$1@dont-email.me> <100cjat$vtec$1@dont-email.me> <100fdbr$1laaq$1@dont-email.me> <100funo$1ous9$1@dont-email.me> <100haco$24mti$1@dont-email.me> <100hocb$2768i$1@dont-email.me> <100mpm7$3csuv$1@dont-email.me> <100much$3drk8$1@dont-email.me> <100p8v7$k2$1@dont-email.me> <100pbot$dmi$1@dont-email.me> <100rv2t$jpca$1@dont-email.me> <100sajh$lkp7$2@dont-email.me> <100us6p$1b4q2$1@dont-email.me> <100uvfe$1b4dh$3@dont-email.me> <1011fkf$1v4kb$1@dont-email.me> <1011qrn$20v83$1@dont-email.me> <10149ic$2jtva$1@dont-email.me> <1014kja$2l9jj$4@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 28 May 2025 10:25:30 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="4d65ac626a85e0b2f5d51ba1a2ed3e15";
	logging-data="3328937"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19BcOe/DoR3/FpboaQ4OVQh"
User-Agent: Unison/2.2
Cancel-Lock: sha1:qkSVEgF1txMKqO5Dq0EeBu0i0oI=

On 2025-05-27 15:09:30 +0000, WM said:

> On 27.05.2025 14:01, Mikko wrote:
>> On 2025-05-26 13:38:00 +0000, WM said:
>> 
>> No alternative view is known to be better.
> 
> That does not make this view good.

It does. Perhaps not good enough for all purposes but certainly good
enough to be called good.

>>> But even pure mathematics proves that most natural numbers will never 
>>> be definable:
>>> 
>>> {1} has infinitely many (ℵo) successors.
>> 
>> (2) there are infinitely many (ℵo) possible definitions.
> 
> No. All natural numbers can be manipulated collectively, for instance 
> subtracted: ℕ \ {1, 2, 3, ...} = { }. Here all have disappeared.
> 
> Could all natural numbers be distinguished by individually defining 
> each one, then this subtraction could also happen but, caused by the 
> well-order, a last number would disappear.
> 
>>> If {1, 2, 3, ..., n} has infinitely many (ℵo) successors, then {1, 2, 
>>> 3, ..., n, n+1} has infinitely many (ℵo) successors, for every n that 
>>> can be defined.
>> 
>> You can't formulate that as a logically or mathematically valid proof.
>> 
> It is a valid proof by induction. Claim it for all natural numbers. Get 
> a contradiction. But perhaps you prefer geometry?

No, it is not. In order to use an inductive proof you must first specify
the theory you are using, and that theory must have an induction axiom.
There is no induction in plain logic.

An induction proof must prove P[0] and P[n] -> P[n+1] before it can infer
that for all x P[x]. You have not even identified what P you are talking
about.

For discussion of natural numbers a good basis is Peano axioms. Another
good basis is Cantor's construction, perhaps in ZF set theory.

> The set of finite initial segments of natural numbers is potentially 
> infinite but not actually infinite.

There is nothing potential in a set. If there are infinitely many members
in a set then the set is infinite, otherwise it is finite.

>  (Actual infinity is a fixed number greater than all natural numbers.)

Infinity is not a number but a feature some sets have and some don't.
If a set has that feature then all bigger sets have that feature,
too. Typical set theories have infinite sets of different sizes.

-- 
Mikko