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 (D∞) and the semantics of parts of the Z specification notation. This paper… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS


Publications referenced by this paper.
Showing 1-10 of 26 references

Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science

  • L. C. Paulson
  • Springer-Verlag,
  • 1994
2 Excerpts

Merging HOL with set theory: preliminary experiments

  • M.J.C. Gordon
  • Technical Report 353, University of Cambridge…
  • 1994
2 Excerpts

L2 – The LAMBDA Logic

  • S. Finn, M. P. Fourman
  • Abstract Hardware Limited, September
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…