On the strength of proof-irrelevant type theories

Details On the strength of proof-irrelevant type theories On the strength of proof-irrelevant type theories

2008-08-28

arxiv.org/abs/0808.3928v2

LMCS 4 (3:13) 2008

Computer Science

Logic in Computer Science

20 pages, Logical Methods in Computer Science, Long version of IJCAR 2006 paper

Scientific paper

10.2168/LMCS-4(3:13)2008

We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is 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. 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. Finally we describe a simple set-theoretic semantics.

Affiliated with

Also associated with

No associations

Rating

On the strength of proof-irrelevant type theories does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the strength of proof-irrelevant type theories, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the strength of proof-irrelevant type theories will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-327510