Computer Science – Logic in Computer Science
Scientific paper
2007-11-16
Computer Science
Logic in Computer Science
Scientific paper
ZF 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 \iizfr. We define a typed lambda calculus $\li$ corresponding to proofs in \iizfr according to the Curry-Howard isomorphism principle. Using realizability for \iizfr, we show weak normalization of $\li$. We use normalization to prove the disjunction, numerical existence and term existence properties. An inner extensional model is used to show these properties, along with the set existence property, for full, extensional \izfr.
No associations
LandOfFree
Normalization of IZF with Replacement 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 Normalization of IZF with Replacement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Normalization of IZF with Replacement will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-3416