The aProS project: Strategic thinking & computational logic

Logic Journal of the IGPL

Volumn 15, Issue 4, 2007, Pages 359-368

  Sieg, Wilfried ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Automated proof search; Carnegie Proof Lab; Dynamic proof tutor; Intercalation calculus; Introduction to logic; Natural deduction proof; Open Learning Initiative (OLI); Strategic thinking

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; COMPUTER AIDED INSTRUCTION; COMPUTER CIRCUITS; LABORATORIES; TEACHING;

AUTOMATED PROOF SEARCH; AUTOMATED PROOFS; CARNEGIE PROOF LAB; DYNAMIC PROOF TUTOR; INTERCALATION CALCULUS; INTRODUCTION TO LOGIC; LEARNING INITIATIVES; NATURAL DEDUCTION PROOFS; OPEN LEARNING; OPEN LEARNING INITIATIVE; PROOF SEARCH; STRATEGIC THINKING;

LOGIC PROGRAMMING;

EID: 34948833276     PISSN: 13670751     EISSN: 13689894     Source Type: Journal    
DOI: 10.1093/jigpal/jzm026     Document Type: Article

References (29)

1. V. Aleven and K. Koedinger: An effective metacognitive strategy: learning by doing and explaining with a computer-based Cognitive Tutor; Cognitive Science 26, 2002, 147 179.
2. J. Anderson: Human symbol manipulation within an integrated cognitive architecture; Cognitive Science 29 (2005), 313 341.
3. A. Bundy: Planning and patching proof; in: B. Buchberger and J.A. Campbell (eds.), Artificial Intelligence and Symbolic Computation, Springer-Verlag, 2004, 26 37.
4. M. Burke: Logic and Proofs (Web-based course); Teaching Philosophy 29 (2006), 255 260.
5. J. Byrnes: Proof Search and Normal Forms in Natural Deduction; Ph.D. Dissertation, Carnegie Mellon, 1999.
6. M. Davis: Computability and Unsolvability; New York, 1958.
7. R. Dedekind: Was sind und was sollen die Zahlen? (1888); its translation is found in: W. Ewald (ed.), From Kant to Hilbert, Oxford University Press, 1996, 790-833.
8. K. Devlin: Sets, functions, and logic an introduction to abstract mathematics; Chapman & Hall, 2004.
9. M. Fitting: First-order logic and automated theorem proving; Springer-Verlag, 1990.
10. G. Gentzen: The collected papers of Gerhard Gentzen, edited and translated by M.E. Szabo; North-Holland, 1969.
11. T. Gibson: Proof search in first-order logic with equality; MS Thesis Carnegie Mellon, 2006.
12. K. Gödel: On undecidable propositions of formal mathematical systems (1934); in: Collected Works, volume I, Oxford University Press, 1986, 346 371.
13. D. Hilbert: Die Grundlagen der Mathematik (1927); translated in: J. van Heijenoort (ed.), From Frege to Gödel A source book in mathematical logic, 1879 1931; Harvard University Press, 1967, 464 479.
14. I. Kash: A partially automated proof of the Cantor-Bernstein Theorem; Senior Honors Thesis, Adv. W. Sieg, Carnegie Mellon, Computer Science Department, 2004.
15. S.C. Kleene: Introduction to Metamathematics; North-Holland, 1952.
16. E. Melis: Why proof planning for Maths education and how?; in: D. Hutter and W. Stephan (eds.), Mechanizing Mathematical reasoning, Springer-Verlag, 2005, 364 378.
17. D. Mundici and W. Sieg: Computability, in: Routledge Encyclopedia of Philosophy, 1998.
18. G. Polya: Mathematical Discovery On understanding, learning, and teaching problem solving; Wiley & Sons, 1981.
19. D. Prawitz: Natural Deduction A proof-theoretic study; Stockholm, 1965.
20. L.J. Rips: The Psychology of Proof; MIT Press, 1994.
21. R. Scheines and W. Sieg: Computer environments for proof construction; Interactive Learning Environments 4(2), 1994, 159 169.
22. A.H. Schoenfeld: Purposes and methods of research in mathematics education; Notices Amer. Math. Soc. 47(6), 2000, 641 649.
23. W. Sieg and R. Scheines: Searching for proofs (in sentential logic); in: L. Burkholder (ed.), Philosophy and the Computer, Westview Press, 1992, 137 159.
24. W. Sieg and J. Byrnes: Normal natural deduction proofs (in classical logic); Studia Logica 60 (1998), 67 106.
25. W. Sieg and S. Cittadini: Normal natural deduction proofs (in non-classical logics); in: D. Hutter and W. Stephan (eds.), Mechanizing mathematical reasoning, Springer-Verlag 2005, 169 191.
26. W. Sieg and C. Field: Automated search for Gödel's proofs; Annals of Pure and Applied Logic 133, 2005, 319 338.
27. W. Thurston: On proof and progress in mathematics; Bull. Amer. Math. Soc. 30 (1994), 161 177.
28. D.J. Velleman: How to prove it a structured approach; Cambridge University Press, 1994.
29. J. Wing: Computational thinking; Communications ACM 49 (2006), 33 35.