Automated search for Gödel's proofs

Annals of Pure and Applied Logic

Volumn 133, Issue 1-3 SPEC. ISS., 2005, Pages 319-338

  Sieg, Wilfried ^a   Field, Clinton ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 14644393715     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2004.10.014     Document Type: Article

References (23)

1. K. Ammon An automatic proof of Gödel's incompleteness theorem Artificial Intelligence 61 1993 291-306
2. G. Boolos The Logic of Provability 1993 Cambridge University Press
3. S. Brüning M. Thielscher W. Bibel Letter to the editor Artificial Intelligence 61 1993 353-354
4. A. Bundy, D. Basin, D. Hutter, A. Ireland, Rippling: Meta-level guidance for mathematical reasoning, Book manuscript, 2003
5. A. Bundy, F. Giunchiglia, A. Villafiorita, T. Walsh, An incompleteness theorem via abstraction, Technical Report #9302-15, Istituto per la ricerca scientifica e tecnologica, Trento, 1996
6. J. Byrnes, Proof search and normal forms in natural deduction, Ph.D. Thesis, Department of Philosophy, Carnegie Mellon University, 1999
7. P.J. Cohen Set Theory and the Continuum Hypothesis 1966 Benjamin Reading, MA
8. R. Dedekind Über die Einführung neuer Funktionen in der Mathematik Habilitationsrede 1854 428-438
9. Fricke, Noether, Ore (Eds.), Gesammelte mathematische Werke, vol. 3, Vieweg, 1933.
10. D. Fearnley-Sander Review of Quaife 1992 http://psyche.cs.monash.edu.au/
11. S. Feferman Inductively presented systems and the formalization of meta-mathematics in: Van Dalen Lascar Smiley (Eds.) Logic Colloquium '80 1982 North-Holland Publishing Company 95-128
12. S. Feferman Finitary inductively presented logics in: Ferro et al. (Eds.) Logic Colloquium '88 1988 North-Holland Publishing Company 191-220
13. F. Fitch Symbolic Logic 1952 The Ronald Press Company New York
14. K. Gödel Über formal unentscheidbare Sätze der Principia mathematica und verwandter Systeme I Monatshefte für Mathematik und Physik 38 1931 173-198
15. M. Löb Solution of a problem of Leon Henkin The Journal of Symbolic Logic 20 1955 115-118
16. A. Quaife Automated proofs of Löb's theorem and Gödel's two incompleteness theorems Journal of Automated Reasoning 4 1988 219-231
17. A. Quaife Automated Development of Fundamental Mathematical Theories 1992 Kluwer Academic Publishers
18. N. Shankar Metamathematics, Machines, and Gödel's Proof Cambridge Tracts in Theoretical Computer Science vol. 38 1994 Cambridge University Press
19. W. Sieg, Elementary proof theory, Technical Report 297, Institute for Mathematical Studies in the Social Sciences, Stanford, 1978, p. 104
20. W. Sieg, Mechanisms and Search (Aspects of Proof Theory), AILA Preprint, 1992
21. W. Sieg J. Byrnes Normal natural deduction proofs (in classical logic) Studia Logica 60 1998 67-106
22. W. Sieg, S. Cittadini, Normal natural deduction proofs (in non-classical logics), Technical Report No. CMU-PHIL-130, 2002, p. 29
23. W. Sieg I. Lindstrom S. Lindstrom Gödel's incompleteness theorems - a computer-based course in elementary proof theory in: P. Suppes (Ed.) University-Level Computer-Assisted Instruction at Stanford 1968-80 1981 Stanford 183-193