Experiments with ZF Set Theory in HOL and Isabelle (1995)
| Venue: | IN PROCEEDINGS OF THE 8TH INTERNATIONAL WORKSHOP ON HIGHER ORDER LOGIC THEOREM PROVING AND ITS APPLICATIONS, LNCS |
| Citations: | 13 - 1 self |
BibTeX
@INPROCEEDINGS{Agerholm95experimentswith,
author = {Sten Agerholm and Mike Gordon},
title = {Experiments with ZF Set Theory in HOL and Isabelle},
booktitle = {IN PROCEEDINGS OF THE 8TH INTERNATIONAL WORKSHOP ON HIGHER ORDER LOGIC THEOREM PROVING AND ITS APPLICATIONS, LNCS},
year = {1995},
pages = {32--45},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 specification notation. This paper
