Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] Coq proof of Puiseux's theorem completed

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] Coq proof of Puiseux's theorem completed


Chronological Thread 
  • From: Alan Schmitt <alan.schmitt AT polytechnique.org>
  • To: Daniel de Rauglaudre <daniel.de_rauglaudre AT inria.fr>
  • Cc: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] Coq proof of Puiseux's theorem completed
  • Date: Thu, 18 Sep 2014 14:05:49 +0200

Hello Daniel,

My courses on logic are very far, so I have a question about one of your
axioms.

On 2014-09-15 17:55, Daniel de Rauglaudre
<daniel.de_rauglaudre AT inria.fr>
writes:

> 5/ ∀ P : nat → Prop, { ∃ n, P n } + { ∀ n, ¬P n }.

Isn't it too strong? If I take "P k" to be "function F terminate when
given input k", doesn't this mean you can decide termination?

Thanks,

Alan

--
OpenPGP Key ID : 040D0A3B4ED2E5C7

Attachment: signature.asc
Description: PGP signature




Archive powered by MHonArc 2.6.18.

Top of Page