Mechanizing set theory: Cardinal arithmetic and the axiom of choice (1996)

by Lawrence C. Paulson , Krzysztof Grabczewski
Venue:Journal of Automated Reasoning
Citations:16 - 9 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
78 leanTAP: Lean Tableau-based Deduction – Bernhard Beckert, Joachim Posegga - 1995
77 Co-induction in relational semantics – R Milner, M Tofte - 1991
239 The Formal Semantics of Programming Languages – G Winskel - 1993
44 Set theory for verification: I. From foundations to functions – Lawrence C. Paulson - 1993
38 A generic tableau prover and its integration with Isabelle – Lawrence C. Paulson - 1999
124 Unification under a mixed prefix – Dale Miller - 1992
287 A logic programming language with lambda-abstraction, function variables, and simple unification – Dale Miller - 1990
366 ML for the Working Programmer – L C Paulson - 1991
500 T.: Introduction to HOL: A Theorem Proving Environment for Higher Order Logic: Cambridge – M Melham - 1993
114 A unification algorithm for typed λ-calculus – G Huet - 1975
4 Proof of the equivalence of the operational and denotational semantics of – Heiko Lötzbeyer, Robert Sandner - 1994
293 OTTER3.0 Reference Manual and Guide – William W. McCune - 1995
44 A fixedpoint approach to implementing (co)inductive definitions – Lawrence C Paulson
100 A Prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler – Mark E. Stickel - 1987
14 Obvious inferences – P Rudnicki - 1987
42 Reasoning with inductively defined relations in the HOL theorem prover – Juanito Camilleri, Tom Melham - 1992
26 Generic Automatic Proof Tools – Lawrence C. Paulson - 1997