On the Strength of Proof-Irrelevant Type Theories
- Cite this paper as:
- Werner B. (2006) On the Strength of Proof-Irrelevant Type Theories. In: Furbach U., Shankar N. (eds) Automated Reasoning. IJCAR 2006. Lecture Notes in Computer Science, vol 4130. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.