Re: Constructive Math query.
- From: Torkel Franzen <torkel@xxxxxxxxxx>
- Date: 28 Aug 2005 06:22:04 +0200
pa@xxxxxxxxxxxxxxxxxxxxx (Pierre Asselin) writes:
> Are there statements known to be undecidable in constructive
> mathematics ? There isn't a formal system to corral the
> possible proofs anymore...
There's no difference between classical and constructive mathematics
as regards formalizability.
.
- Follow-Ups:
- Re: Constructive Math query.
- From: Pierre Asselin
- Re: Constructive Math query.
- References:
- Constructive Math query.
- From: Bill Taylor
- Re: Constructive Math query.
- From: Daryl McCullough
- Re: Constructive Math query.
- From: Pierre Asselin
- Constructive Math query.
- Prev by Date: Re: reductio ad falsum versus reductio ad absurdum
- Next by Date: Re: Constructive Math query.
- Previous by thread: Re: Constructive Math query.
- Next by thread: Re: Constructive Math query.
- Index(es):
Relevant Pages
|