Deutsch   English   Français   Italiano  
<871psbudqe.fsf@bsb.me.uk>

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

Path: ...!weretis.net!feeder9.news.weretis.net!news.quux.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: Ben Bacarisse <ben@bsb.me.uk>
Newsgroups: sci.logic
Subject: Re: Simple enough for every reader?
Date: Tue, 27 May 2025 00:57:45 +0100
Organization: A noiseless patient Spider
Lines: 55
Message-ID: <871psbudqe.fsf@bsb.me.uk>
References: <100a8ah$ekoh$1@dont-email.me> <878qmt1qz6.fsf@bsb.me.uk>
	<100fu5r$1oqf5$1@dont-email.me> <87plg4yujh.fsf@bsb.me.uk>
	<100ho1d$272si$1@dont-email.me> <87ecwizrrj.fsf@bsb.me.uk>
	<100kbsj$2q30f$1@dont-email.me> <874ixbxy26.fsf@bsb.me.uk>
	<100s897$lkp7$1@dont-email.me> <87r00dv5s4.fsf@bsb.me.uk>
	<100ukdf$19g96$1@dont-email.me> <87ldqkura6.fsf@bsb.me.uk>
	<1011f3m$1uskr$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8
Content-Transfer-Encoding: 8bit
Injection-Date: Tue, 27 May 2025 01:57:47 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="b18f6d362a2e476261ab905870652a2b";
	logging-data="2377662"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX19fQ9yyU7LEOTQ5o0etrfanMSt1KoMrsf0="
User-Agent: Gnus/5.13 (Gnus v5.13)
Cancel-Lock: sha1:K8C3gL8zELfWyBJDvAzThtL1P9U=
	sha1:rA7yNgvlSOZiZfX0dEt3IZRMY40=
X-BSB-Auth: 1.e50417903eb228f9d469.20250527005745BST.871psbudqe.fsf@bsb.me.uk
Bytes: 3401

WM <wolfgang.mueckenheim@tha.de> writes:

> On 26.05.2025 02:52, Ben Bacarisse wrote:
>> WM <wolfgang.mueckenheim@tha.de> writes:
>
>>> With pleasure:
>>> For every n ∈ ℕ that can be defined, i.e., ∀n ∈ ℕ_def:
>> I can't comment on an argument that is based on a set you have not
>> defined.
>
> Can you understand my proof by induction?

Not without knowing what the set N_def is, since the argument starts
"For all n in N_def".  I can't verify even the simplest statement that
might follow without knowing what N_def is.

> The resulting set is ℕ_def. (According to set theory however it is not a
> set but a potentially infinity collection.)

So you are not asking me to verify a proof at all but rather to accept a
definition?  One that starts from claims about the thing being defined?
And you think this is how maths is done?

>> Your textbook defies N
>
> It defines ℕ_def.

It claims to define N.  It's very poor form to tell students you are
defining N when you are not.

In another reply (please don't split threads -- you may have time to
discuss this stuff endlessly but I don't) you say:

>> Your textbook defies N (incorrectly)
>
> My textbook defines the classical natural numbers, ℕ, meanwhile more
> precisely called ℕ_def, correctly.

So when you write N and N_def you are referring to the same thing?  I
thought you were claiming there was some difference when you use those
symbols.  Please don't use N unless you mean the N that mathematicians
define.

> 1 ∈ M (4.1)
> n ∈ M ⇒ (n + 1) ∈ M (4.2)
> If M satisfies (4.1) and (4.2), then ℕ ⊆ M.

Since you now claim that (contrary to what the textbook states) this is
not intended to be a definition of N (as real mathematicians use the
term) but rather of something you call N_def, I can't really argue with
it.  But is not very useful.  Can you prove that 1 is in N_def using
this definition?

-- 
Ben.