Chapter

Automated Reasoning

Volume 4130 of the series Lecture Notes in Computer Science pp 604-618

On the Strength of Proof-Irrelevant Type Theories

  • Benjamin WernerAffiliated withCarnegie Mellon UniversityINRIA-Futurs and LIX, Ecole Polytechnique

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is particularly useful when type theory is used as the logical formalism underlying a theorem prover. We also show a close relation with the subset types of the theory of PVS. Finally we show that in these theories, because of the additional extentionality, the axiom of choice implies the decidability of equality, that is, almost classical logic.