Re: Question about induction
- From: Bill Dubuque <wgd@xxxxxxxxxxxxxxxxxxxx>
- Date: 01 Oct 2009 20:23:37 -0400
Aatu Koskensilta <aatu.koskensi...@xxxxxx> wrote:
Bill Dubuque <w...@xxxxxxxxxxxxxxxxxxxx> writes:
Aatu Koskensilta <aatu.koskensi...@xxxxxx> wrote:
The least number principle and the principle of mathematical
induction are (classically) equivalent.
That's far too informal to make any sense.
Why?
Because this is sci.math, not sci.logic. Most readers here have
not taken a course in mathematical logic. Rather, they practice
their logic - like their set theory - fairly naively. As such
what may seem trivial to you or I may not be so for them.
Can you state a more formal version that is actually true?
Consider the theory T in the second-order language of arithmetic with
(x)(x = 0 \/ (Ey)(x = S(y)))
~(Ex)(S(x) = 0)
(x)(y)(S(x) = S(y) --> x = y)
and the comprehension schema as axioms. The least number principle and
the principle of mathematical induction are provably equivalent in T.
Ok, you've added the axiom that every nonzero element is a successor
(which is not included in Peano's axioms since it is a consequence
of them). When replacing induction with the minimum principle (or
any other such principle that holds for all ordinals) one needs to
adjoin some such axiom that serves to restrict down to omega. That's
the point that I want to emphasize here for the logical layperson.
--Bill Dubuque
.
- References:
- Re: Question about induction
- From: Bill Dubuque
- Re: Question about induction
- From: Aatu Koskensilta
- Re: Question about induction
- Prev by Date: Sorry for bragging, but....... ( or are they plants?).
- Next by Date: Re: Negative time?
- Previous by thread: Re: Question about induction
- Next by thread: patterns asociated with multiples of one digit numbers
- Index(es):
Relevant Pages
|