International Joint Conference on Automated Reasoning

IJCAR 2006: Automated Reasoning pp 604-618

On the Strength of Proof-Irrelevant Type Theories

  • Benjamin Werner
Conference paper

DOI: 10.1007/11814771_49

Volume 4130 of the book series Lecture Notes in Computer Science (LNCS)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Benjamin Werner
    • 1
  1. 1.INRIA-Futurs and LIX, Ecole PolytechniqueFrance