Set theory for verification: I. From foundations to functions

Set theory for verification: I. From foundations to functions (1993)

by Lawrence C. Paulson

Venue:	J. Auto. Reas
Citations:	41 - 16 self

Datum	Value	Source
TITLE	Set theory for verification: I. From foundations to functions	INFERENCE
AUTHOR NAME	Lawrence C. Paulson	SVM HeaderParse 0.2
AUTHOR AFFIL	Computer Laboratory; University of Cambridge	SVM HeaderParse 0.2
ABSTRACT	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 [9], and Ramsey’s Theorem [5]. A generic proof assistant can stand up against provers dedicated to particular logics. Key words. Isabelle, set theory, generic theorem proving, Ramsey’s Theorem,	SVM HeaderParse 0.2
YEAR	1993	INFERENCE
VENUE	J. Auto. Reas	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	353--389	INFERENCE
CITATIONS	51 found	ParsCit 1.0