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: Gérard Huet <Gerard.Huet AT inria.fr>
  • To: coq-club AT inria.fr
  • Cc: Gérard Huet <Gerard.Huet AT inria.fr>
  • Subject: Re: [Coq-Club] unprovable propositions in Coq
  • Date: Fri, 18 Apr 2014 18:26:23 +0200


Le 18 avr. 2014 à 16:54, Daniel Schepler <dschepler AT gmail.com> a écrit :

In this particular case, Peirce's law is easily equivalent to classic
(forall P:Prop, P \/ ~P).  


Actually, it is equivalent only in classical logic. 

In the Skolem cube below, it appears as point aPb, intermediate between 1 (True) and A->B.
Note also Sheffer's stroke A|B between A&B and A+B.
The cube is the implicational algebra obtained as quotient by isomorphism of the objects of the free CCC generated by objects A and B, 
and whose arrows Hom(A,B) may be thought of as the deductions of B from A.
We get hypercubes with more propositional letters, but the structure stays finite, as shown by N. de Bruijn.
GH

image/jpg




Archive powered by MHonArc 2.6.18.

Top of Page