Department of Computer Science and Technology

Technical reports

Set theory as a computational logic: I. from foundations to functions

Lawrence C. Paulson

November 1992, 28 pages

DOI: 10.48456/tr-271


A logic for specification and verification is derived from the axioms of Zermelo-Fraenkel set theory. The proofs are performed using the proof assistant Isabelle. Isabelle is generic, supporting several different logics. Isabelle has the flexibility to adapt to variants of set theory. Its higher-order syntax supports the definition of new binding operators. Unknowns in subgoals can be instantiated incrementally. The paper describes the derivation of rules for descriptions, relations and functions, and discusses interactive proofs of Cantor’s Theorem, the Composition of Homomorphisms challenge, and Ramsey’s Theorem. A generic proof assistant can stand up against provers dedicated to particular logics.

Full text

PDF (0.3 MB)
DVI (0.0 MB)

BibTeX record

  author =	 {Paulson, Lawrence C.},
  title = 	 {{Set theory as a computational logic: I. from foundations
         	   to functions}},
  year = 	 1992,
  month = 	 nov,
  url = 	 {},
  institution =  {University of Cambridge, Computer Laboratory},
  doi = 	 {10.48456/tr-271},
  number = 	 {UCAM-CL-TR-271}