Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] unprovable propositions in Coq

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] unprovable propositions in Coq


Chronological Thread 
  • From: Altenkirch Thorsten <psztxa AT exmail.nottingham.ac.uk>
  • To: "coq-club AT inria.fr" <coq-club AT inria.fr>
  • Subject: Re: [Coq-Club] unprovable propositions in Coq
  • Date: Fri, 18 Apr 2014 21:39:40 +0100
  • Accept-language: en-US, en-GB
  • Acceptlanguage: en-US, en-GB

I use this example in
http://www.cs.nott.ac.uk/~txa/talks/nbe09.pdf

which also explains the relationship to normalisation.

T.

On 18/04/2014 12:02, "Matej Kosik"
<5764c029b688c1c0d24a2e97cd764f AT gmail.com>
wrote:

>Hi all,
>
>I am slowly going through the CoqArt book.
>In Section 3.7.2 it is claimed that Peirce's formula
>
> ((P -> Q) -> P) -> P
>
>is not provable (in Coq).
>
>I am curious, how does the proof (of Pierce's formula unprovability in
>Coq) look like?
>(up to that point, all concepts and exercises seem clear).
>
>Thanks in advance for whatever help.

This message and any attachment are intended solely for the addressee and may
contain confidential information. If you have received this message in error,
please send it back to me, and immediately delete it. Please do not use,
copy or disclose the information contained in this message or in any
attachment. Any views or opinions expressed by the author of this email do
not necessarily reflect the views of the University of Nottingham.

This message has been checked for viruses but the contents of an attachment
may still contain software viruses which could damage your computer system,
you are advised to perform your own checks. Email communications with the
University of Nottingham may be monitored as permitted by UK legislation.







Archive powered by MHonArc 2.6.18.

Top of Page