The Reflection Theorem: A Study in Meta-theoretic Reasoning
暂无分享,去创建一个
[1] Lawrence C. Paulson,et al. Set theory for verification: I. From foundations to functions , 1993, Journal of Automated Reasoning.
[2] Lawrence C. Paulson,et al. Mechanizing set theory , 1996, Journal of Automated Reasoning.
[3] Florian Kammüller,et al. Locales - A Sectioning Concept for Isabelle , 1999, TPHOLs.
[4] Andrzhei︠a︡ Mostowski. Constructible sets with applications , 1969 .
[5] Markus Wenzel,et al. Isar - A Generic Interpretative Approach to Readable Formal Proof Documents , 1999, TPHOLs.
[6] Richard J. Boulton,et al. Theorem Proving in Higher Order Logics , 2003, Lecture Notes in Computer Science.
[7] Johan G. F. Belinfante,et al. Computer Proofs in Gödel’s Class Theory with Equational Definitions for Composite and Cross , 1999, Journal of Automated Reasoning.
[8] A. Wiles. Modular Elliptic Curves and Fermat′s Last Theorem(抜粋) (フェルマ-予想がついに解けた!?) , 1995 .
[9] F. R. Drake,et al. Set theory : an introduction to large cardinals , 1974 .
[10] Krzysztof Grabczewski,et al. Mechanizing Set Theory: Cardinal Arithmetic and the Axiom of Choice , 2001, ArXiv.
[11] C. Torrance. Review: Kurt Gödel, The Consistency of the Axiom of Choice and of the Generalized Continuum-Hypothesis with the Axioms of Set Theory , 1941 .
[12] G. Bancerek. The Reflection Theorem , 1990 .
[13] Markus Wenzel,et al. Type Classes and Overloading in Higher-Order Logic , 1997, TPHOLs.
[14] Kenneth Kunen,et al. Set Theory: An Introduction to Independence Proofs , 2010 .
[15] Lawrence C. Paulson,et al. Set theory for verification. II: Induction and recursion , 1995, Journal of Automated Reasoning.
[16] Art Quaife,et al. Automated deduction in von Neumann-Bernays-Gödel set theory , 1992, Journal of Automated Reasoning.