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

by Lawrence C. Paulson
Venue:J. Auto. Reas
Citations:44 - 16 self

Documents Related by Co-Citation

41 Set Theory for Verification: II - Induction and Recursion – Lawrence C. Paulson - 2000
420 The Foundation of a Generic Theorem Prover – Lawrence C. Paulson - 1989
44 A fixedpoint approach to implementing (co)inductive definitions – Lawrence C Paulson
14 Experimenting with Isabelle in ZF set theory – Philippe No»el - 1993
500 T.: Introduction to HOL: A Theorem Proving Environment for Higher Order Logic: Cambridge – M Melham - 1993
35 Automated deduction in von Neumann–Bernays–Gödel set theory – A Quaife - 1992
78 IMPS: An Interactive Mathematical Proof System – William M. Farmer, Joshua D. Guttman, F. Javier Thayer - 1993
126 Naive Set Theory – P Halmos - 1960
274 Set Theory - An Introduction to Independence Proofs – K Kunen - 1980
165 Logic and Computation: Interactive Proof with Cambridge LCF – L Paulson - 1987
16 A Concrete Final Coalgebra Theorem for ZF Set Theory – Lawrence C. Paulson - 1994
77 Co-induction in relational semantics – R Milner, M Tofte - 1991
21 Set theory in first-order logic: Clauses for Gödel’s axioms – R Boyer, E Lusk, W McCune, R Overbeek, M Stickel, L Wos - 1986
81 Axiomatic Set Theory – P Suppes - 1960
42 Reasoning with inductively defined relations in the HOL theorem prover – Juanito Camilleri, Tom Melham - 1992
74 Automating Recursive Type Definitions in Higher Order Logic – Thomas Melham - 1988
1065 Introduction to Lattices and Order – B A Davey, H A Priestley - 2002
395 A Computational Logic Handbook – R S Boyer, J S Moore - 1988
16 Mechanizing set theory: Cardinal arithmetic and the axiom of choice – Lawrence C. Paulson, Krzysztof Grabczewski - 1996