A Normalizing Intuitionistic Set Theory with Inaccessible Sets
We propose a set theory strong enough to interpret powerful type theories underlying proof assistants such as LEGO and also possibly Coq, which at the same time enables program extraction from its constructive proofs. For this purpose, we axiomatize an impredicative constructive version of Zermelo-F...
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Artikel |
| Språk: | English |
| Publicerad: |
Logical Methods in Computer Science e.V.
2007-08-01
|
| Serie: | Logical Methods in Computer Science |
| Ämnen: | |
| Länkar: | https://lmcs.episciences.org/837/pdf |