• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Isabelle’s isabelle’s logics: FOL and ZF (2003)

Cached

  • Download as a PDF

Download Links

  • [www.cl.cam.ac.uk]
  • [www.cl.cam.ac.uk]
  • [isabelle.in.tum.de]
  • [www.cl.cam.ac.uk]
  • [www.cl.cam.ac.uk]
  • [isabelle.in.tum.de]
  • [www.cl.cam.ac.uk]
  • [www.cl.cam.ac.uk]
  • [www.cl.cam.ac.uk]
  • [www.cl.cam.ac.uk]
  • [isabelle.in.tum.de]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Lawrence C. Paulson , Tobias Nipkow , Markus Wenzel
Citations:4 - 3 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@TECHREPORT{Paulson03isabelle’sisabelle’s,
    author = {Lawrence C. Paulson and Tobias Nipkow and Markus Wenzel},
    title = {Isabelle’s isabelle’s logics: FOL and ZF},
    institution = {},
    year = {2003}
}

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

This manual describes Isabelle’s formalizations of many-sorted first-order logic (FOL) and Zermelo-Fraenkel set theory (ZF). See the Reference Manual for general Isabelle commands, and Introduction to Isabelle for an overall tutorial. This manual is part of the earlier Isabelle documentation, which is somewhat superseded by the Isabelle/HOL Tutorial [11]. However, the present document is the only available documentation for Isabelle’s versions of firstorder

Citations

586 Isabelle/HOL: A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS - Nipkow, Paulson, et al. - 2002
227 Set Theory: An Introduction to Independence Proofs - Kunen - 1983
157 Logic and Computation: Interactive proof with Cambridge LCF - Paulson - 1987
143 Inductive definitions in the system Coq: Rules and properties - Paulin-Mohring - 1993
118 Elements of Intuitionism - Dummett - 1977
114 Naive Set Theory - Halmos - 1960
87 Principia Mathematica - Whitehead, Russell - 1962
44 A fixedpoint approach to implementing (co)inductive definitions - Paulson - 1994
41 Set theory for verification: I. From foundations to functions - Paulson - 1993
40 Reasoning with inductively defined relations in the HOL theorem prover - Camilleri, Melham - 1992
40 Set theory for verification: II. Induction and recursion - Paulson - 1995
33 Automated deduction in von Neumann-Bernays-Gödel set theory - Quaife - 1992
24 Generic automatic proof tools - Paulson - 1997
23 The Boyer-Moore prover and Nuprl: An experimental comparison - Basin, Kaufmann - 1991
20 Set theory in first-order logic: Clauses for Gödel’s axioms - Boyer, Lusk, et al. - 1986
19 A fixedpoint approach to (co)inductive and (co)datatype definitions - Paulson - 2000
12 Fundamentals of Contemporary Set Theory - Devlin - 1979
10 Towards the mechanization of the proofs of some classical theorems of set theory - Abrial, Laffitte - 1993
5 Suppes. Axiomatic Set Theory - Patrick - 1972
2 Final coalgebras as greatest fixed points - Paulson - 1999
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University