Experiments with ZF Set Theory in HOL and Isabelle

  title={Experiments with ZF Set Theory in HOL and Isabelle},
  author={Sten Agerholm and Michael J. C. Gordon},
Most general purpose proof assistants support versions of typed higher order logic. Experience has shown that these logics are capable of representing most of the mathematical models needed in Computer Science. However, perhaps there exist applications where ZF-style set theory is more natural, or even necessary. Examples may include Scott's classical inverse-limit construction of a model of the untyped-calculus (D1) and the semantics of parts of the Z speciication notation. This paper compares… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS