The reflection theorem: A study in meta-theoretic reasoning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2392, Issue , 2002, Pages 377-391

  Paulson, Lawrence C ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION;

ISABELLE; META LEVEL REASONING; META LEVELS;

THEOREM PROVING;

EID: 84948969695     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45620-1_31     Document Type: Conference Paper

References (17)

1. Grzegorz Bancerek. The reflection theorem. Journal of Formalized Mathematics, 2, 1990. http://megrez.mizar.org/mirror/JFM/Vol2/zfrefle.html.
2. Johan G. F. Belinfante. Computer proofs in Gödel’s class theory with equational definitions for composite and cross. Journal of Automated Reasoning, 22(3):311–339, March 1999.
3. Yves Bertot, Gilles Dowek, André Hirschowitz, Christine Paulin, and Laurent Théry, editors. Theorem Proving in Higher Order Logics: TPHOLs’99, LNCS 1690. Springer, 1999.
4. Frank R. Drake. Set Theory: An Introduction to Large Cardinals. North-Holland, 1974.
5. Kurt Gödel. The consistency of the axiom of choice and of the generalized continuum hypothesis with the axioms of set theory. In S. Feferman et al., editors, Kurt Gödel: Collected Works, volume 2. Oxford University Press, 1990. First published in 1940.
6. G. P. Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1:27–57, 1975.
7. Florian Kammüller, Markus Wenzel, and Lawrence C. Paulson. Locales: A sectioning concept for Isabelle. In Bertot et al. [3], pages 149–165.
8. Kenneth Kunen. Set Theory: An Introduction to Independence Proofs. North- Holland, 1980.
9. Andrzej Mostowski. Constructible Sets with Applications. North-Holland, 1969.
10. Lawrence C. Paulson. Set theory for verification: I. From foundations to functions. Journal of Automated Reasoning, 11(3):353–389, 1993.
11. Lawrence C. Paulson. Set theory for verification: II. Induction and recursion. Journal of Automated Reasoning, 15(2):167–215, 1995.
12. Lawrence C. Paulson and Krzysztof Grąbczewski. Mechanizing set theory: Cardinal arithmetic and the axiom of choice. Journal of Automated Reasoning, 17(3):291–323, December 1996.
13. The QED manifesto. http://www-unix.mcs.anl.gov/qed/, 1995.
14. Art Quaife. Automated deduction in von Neumann-Bernays-Gödel set theory. Journal of Automated Reasoning, 8(1):91–147, 1992.
15. Markus Wenzel. Type classes and overloading in higher-order logic. In Elsa L. Gunter and Amy Felty, editors, Theorem Proving in Higher Order Logics: TPHOLs’97, LNCS 1275, pages 307–322. Springer, 1997.
16. Markus Wenzel. Isar: A generic interpretative approach to readable formal proof documents. In Bertot et al. [3], pages 167–183.
17. Andrew J. Wiles. Modular elliptic curves and Fermat’s Last Theorem. Annals of Mathematics, 141(3):443–551, 1995.