A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory

Cached

Download Links

by Alexandre Miquel
Citations:3 - 0 self

Documents Related by Co-Citation

4 A normalization theorem for set theory – Sidney C Bailin - 1988
2 Cut elimination for Zermelo’s set theory. 2006. Manuscript, available from the web pages of the authors – Gilles Dowek, Alexandre Miquel
2 and Andre ˆ Sĉedrov. Set existence property for intuitionistic theories with countable choice – Harvey Friedman - 1983
274 Set Theory: An Introduction to Independence Proofs – Kenneth Kunen - 1980
265 Foundations of Constructive Mathematics – M J Beeson - 1985
34 Typed lambda-calculus in classical Zermelo-Fraenkel set theory – Jean-Louis Krivine - 2001
29 Realizability and Recursive Mathematics – D C McCarty - 1984
23 The consistency of classical set theory relative to a set theory with intuitionistic logic – H Friedman - 1973
45 Notes on Constructive Set Theory – Peter Aczel - 1997
1 Andre ˆ Sĉedrov. The lack of definable witnesses and provably recursive functions in intuitionistic set theories – Harvey Friedman - 1985
1 Should your specification language be typed? ACMTOPLAS – Leslie Lamport, Lawrence C Paulson - 1999
4 Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics – Robert Constable
1 Robert Constable and Wojciech Moczyd̷lowski. Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics – NJ Prentice-Hall - 1986
1 and Andre ˆ Sĉedrov. Large sets in intuitionistic set theory – Harvey Friedman - 1984
1 Lambda-Z: Zermelo’s Set Theory as a PTS with 4 Sorts – Alexandre Miquel
5 et al. Proof theory at work: Program development in the Minlog system – H Benl, U Berger, H Schwichtenberg - 1998
56 Constable et al. Implementing Mathematics with the Nuprl Proof Development System – L Robert - 1986
148 LEGO Proof Development System: User’s Manual – Z Luo, R Pollack - 1992
21 On Relating Type Theories and Set Theories – Peter Aczel - 1998