Re: Constructive Math query.
- From: "david petry" <david_lawrence_petry@xxxxxxxxx>
- Date: 20 Aug 2005 15:29:19 -0700
Keith Ramsay wrote:
> david petry wrote:
> |Bill Taylor wrote:
> |
> |>It is a trivial theorem of orthodox math that
> |> "any sequence which is a permutation of the harmonic sequence,
> |> tends to zero".
> |
> |>Is this still provable in constructive math? The proof seems
> |>to require looking at unbounded distances down the sequence,
> |>so I'm not sure.
> |Of course, you must be talking about permutations which can
> |be constructively proven to be permutations. Then, the answer
> |is "yes".
> There's no need to add an assumption that the permutation has
> been proven to be a permutation. Just the fact that it is one
> is sufficient.
Yes, but "the fact that it is one" can only be established by proof.
> This may seem like a picky point, [...]
I would be surprised if Bill Taylor thinks your point clarifies
anything.
But I could be wrong.
.
- Follow-Ups:
- Re: Constructive Math query.
- From: Keith Ramsay
- Re: Constructive Math query.
- From: Torkel Franzen
- Re: Constructive Math query.
- References:
- Constructive Math query.
- From: Bill Taylor
- Re: Constructive Math query.
- From: david petry
- Re: Constructive Math query.
- From: Keith Ramsay
- Constructive Math query.
- Prev by Date: Re: "Friendly Premises"
- Next by Date: Re: "Friendly Premises"
- Previous by thread: Re: Constructive Math query.
- Next by thread: Re: Constructive Math query.
- Index(es):
Relevant Pages
|