Commit 4cff5b16 authored by Pierre Letouzey's avatar Pierre Letouzey
Browse files

Include file zfc.v from Benjamin Werner's ZFC contribution

 (and remove "auto with v62" in this file)

 This will be used to provide a "model" of our ZF theory

 See article :
 http://www.lix.polytechnique.fr/Labo/Benjamin.Werner/publis/tacs97.pdf
parent a74cb723
......@@ -8,7 +8,7 @@
# #
###############################################################################
COQMF_VFILES = AsciiOrder.v StringOrder.v StringUtils.v Utils.v Defs.v Nam.v Mix.v NameProofs.v Subst.v Restrict.v Meta.v Equiv.v Equiv2.v AltSubst.v Countable.v Theories.v PreModels.v Models.v Skolem.v Peano.v ZF.v
COQMF_VFILES = AsciiOrder.v StringOrder.v StringUtils.v Utils.v Defs.v Nam.v Mix.v NameProofs.v Subst.v Restrict.v Meta.v Equiv.v Equiv2.v AltSubst.v Countable.v Theories.v PreModels.v Models.v Peano.v contribs/zfc/zfc.v ZF.v Skolem.v
COQMF_MLIFILES =
COQMF_MLFILES =
COQMF_ML4FILES =
......
......@@ -20,6 +20,7 @@ Theories.v
PreModels.v
Models.v
Peano.v
contribs/zfc/zfc.v
ZF.v
Skolem.v
# parser.v
......
This diff is collapsed.
Contribution Rocq/ZF
====================
This directory contains:
- An encoding of Zermelo-Fraenkel Set Theory in Coq
Author & Date: Benjamin WERNER
INRIA-Rocquencourt
October 1996
Installation procedure:
-----------------------
To get this contribution compiled, type
make
or
make opt
Which will compile the proof file.
Description:
------------
The encoding of Zermelo-Fraenkel Set Theory is largely inspired by
Peter Aczel's work dating back to the eighties. A type Ens is defined,
which represents sets. Two predicates IN and EQ stand for membership
and extensional equality between sets. The axioms of ZFC are then
proved and thus appear as theorems in the development.
A main motivation for this work is the comparison of the respective
expressive power of Coq and ZFC.
A non-computational type-theoretical axiom of choice is necessary to
prove the replacement schemata and the set-theoretical AC.
The main difference between this work and Peter Aczel's, is that
propositions are defined on the impredicative level Prop. Since the
definition of Ens is, however, still unchanged, I also added most of
Peter Aczel's definition. The main advantage of Aczel's approach, is a
more constructive vision of the existential quantifier (which gives
the set-theoretical axiom of choice for free).
Further information on this contribution:
-----------------------------------------
See "The encoding of Zermelo-Fraenkel Set Theory in Coq", in the Proceedings
of TACS'97.
Name: ZFC
Title: An encoding of Zermelo-Fraenkel Set Theory in Coq
Author: Benjamin Werner
Institution: INRIA Rocquencourt
Description:
The encoding of Zermelo-Fraenkel Set Theory is largely inspired by
Peter Aczel's work dating back to the eighties. A type Ens is defined,
which represents sets. Two predicates IN and EQ stand for membership
and extensional equality between sets. The axioms of ZFC are then
proved and thus appear as theorems in the development.
A main motivation for this work is the comparison of the respective
expressive power of Coq and ZFC.
A non-computational type-theoretical axiom of choice is necessary to
prove the replacement schemata and the set-theoretical AC.
The main difference between this work and Peter Aczel's is that
propositions are defined on the impredicative level Prop. Since the
definition of Ens is, however, still unchanged, I also added most of
Peter Aczel's definition. The main advantage of Aczel's approach is a
more constructive vision of the existential quantifier (which gives
the set-theoretical axiom of choice for free).
Keywords: Set Theory, Zermelo-Fraenkel, Calculus of Inductive Constructions
Category: Mathematics/Logic/Set theory
This diff is collapsed.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment