On the strength of proof-irrelevant type theories release_uin4mledlzazdia4e76favcgwq

by Benjamin Werner

Released as a article .

2008  

Abstract

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.
In text/plain format

Archived Files and Locations

application/pdf  268.9 kB
file_ifpynfovpzhppp4bewv3hbhu44
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2008-08-28
Version   v1
Language   en ?
arXiv  0808.3928v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: d3b16783-72e0-4806-b8d7-d61eeec9807e
API URL: JSON