Normalization of IZF with Replacement

  • Wojciech Moczydłowski
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4207)

Abstract

IZF is a well investigated impredicative constructive version of Zermelo-Fraenkel set theory. Using set terms, we axiomatize IZF with Replacement, which we call IZFR, along with its intensional counterpart IZF\(_{R}^{\rm --}\) . We define a typed lambda calculus λZ corresponding to proofs in IZF\(_{R}^{\rm --}\) according to the Curry-Howard isomorphism principle. Using realizability for IZF\(_{R}^{\rm --}\) , we show weak normalization of λZ by employing a reduction-preserving erasure map from lambda terms to realizers. We use normalization to prove disjunction, numerical existence, set existence and term existence properties. An inner extensional model is used to show the properties for full, extensional IZFR.

References

  1. 1.
    Friedman, H., Ščedrov, A.: The lack of definable witnesses and provably recursive functions in intuitionistic set theories. Advances in Mathematics 57, 1–13 (1985)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Beeson, M.: Foundations of Constructive Mathematics. Springer, Heidelberg (1985)MATHGoogle Scholar
  3. 3.
    Ščedrov, A.: Intuitionistic set theory. In: Harvey Friedman’s Research on the Foundations of Mathematics, pp. 257–284. Elsevier, Amsterdam (1985)Google Scholar
  4. 4.
    Aczel, P., Rathjen, M.: Notes on constructive set theory. Technical Report 40, Institut Mittag-Leffler (The Royal Swedish Academy of Sciences) (2000/2001)Google Scholar
  5. 5.
    McCarty, D.: Realizability and Recursive Mathematics. D.Phil. Thesis, University of Oxford (1984)Google Scholar
  6. 6.
    Moczydłowski, W.: Normalization of IZF with Replacement. Technical Report 2006-2024, Computer Science Department, Cornell University (2006)Google Scholar
  7. 7.
    Constable, R., Moczydłowski, W.: Extracting Programs from Constructive HOL Proofs via IZF Set-Theoretic Semantics. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS, vol. 4130, pp. 162–176. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  8. 8.
    Lamport, L., Paulson, L.C.: Should your specification language be typed? ACMTOPLAS: ACM Transactions on Programming Languages and Systems 21 (1999)Google Scholar
  9. 9.
    Myhill, J.: Some properties of intuitionistic Zermelo-Fraenkel set theory. In: Cambridge Summer School in Mathematical Logic, vol. 29, pp. 206–231. Springer, Heidelberg (1973)CrossRefGoogle Scholar
  10. 10.
    Sørensen, M., Urzyczyn, P.: Lectures on the Curry-Howard isomorphism. DIKU rapport 98/14, DIKU (1998)Google Scholar
  11. 11.
    Powell, W.: Extending Gödel’s negative interpretation to ZF. Journal of Symbolic Logic 40, 221–229 (1975)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Friedman, H.: The consistency of classical set theory relative to a set theory with intuitionistic logic. Journal of Symbolic Logic 38, 315–319 (1973)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Moczydłowski, W.: Normalization of IZF with Replacement and Inaccessible Sets (submitted for publication, 2006)Google Scholar
  14. 14.
    Bailin, S.C.: A normalization theorem for set theory. J. Symb. Log. 53(3), 673–695 (1988)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Krivine, J.-L.: Typed lambda-calculus in classical Zermelo-Fraeænkel set theory. Archive for Mathematical Logic 40(3), 189–205 (2001)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Miquel, A.: A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 441–454. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  17. 17.
    Dowek, G., Miquel, A.: Cut elimination for Zermelo’s set theory, available from the web pages of the authors (manuscript, 2006)Google Scholar
  18. 18.
    Rathjen, M.: The disjunction and related properties for constructive Zermelo-Fraenkel set theory. Journal of Symbolic Logic 70, 1233–1254 (2005)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Wojciech Moczydłowski
    • 1
  1. 1.Department of Computer ScienceCornell UniversityIthacaUSA

Personalised recommendations