Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] impredicativity of Prop

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] impredicativity of Prop


Chronological Thread 
  • From: Jonas Oberhauser <s9joober AT gmail.com>
  • To: coq-club AT inria.fr
  • Subject: Re: [Coq-Club] impredicativity of Prop
  • Date: Sun, 09 Feb 2014 15:24:16 +0100

Am 07.02.2014 15:27, schrieb Kirill Taran:
Hello,

Why we need impredicativity of Prop?
Also, is there difference in expressivity between Coq and Agda due difference in predicativity of Prop (in Agda everything is predicative)?

Hi Kirill,

Impredicativity means, informally, that if you create a proposition that talks about all propositions, it also talks about itself.

In Coq this is implemented by the (informal...) typing rule

A : U x : A => B : Prop
-----------------------------------
forall x : A , B : Prop


In particular, if A = Prop (and U = Type_0), you get:

(forall x : Prop , B) : Prop

Thus, you could instantiate x with (forall x : Prop , B).

For types this doesn't work, as the term would automatically have type U (or higher). For the formal typing rules, refer to: http://coq.inria.fr/doc/Reference-Manual006.html#sec167

Kind regards, jonas



Archive powered by MHonArc 2.6.18.

Top of Page