Some applications of Gentzen's proof theory in automated deduction-Reference-Cited by-同舟云学术

Some applications of Gentzen's proof theory in automated deduction

Published: Issue: Volume: Page:101-156
ISSN:
Container-title:Extensions of Logic Programming
language:
Short-container-title:

Author:

Beeson Michael

Publisher

Springer-Verlag

Link

http://link.springer.com/content/pdf/10.1007/BFb0038693.pdf

Reference39 articles.

1. Beeson, M. [1985], Foundations of Constructive Mathematics, Springer-Verlag, Berlin/ Heidelberg/ New York (1985).

2. Beeson, M. [1989], Logic and computation in MATHPERT: An expert system for learning mathematics, in: Kaltofen and Watt (eds.), Computers and Mathematics '89, pp. 202–214, Springer-Verlag, New York/ Heidelberg/ Berlin (1989).

3. Bishop, E. [1967], Foundations of Constructive Analysis, McGraw-Hill, New York (1967).

4. Bledsoe, W. W. [1984], Some automatic proofs in analysis, in: Automated Theorem Proving: After 25 years, ed. by W. W. Bledsoe and D. W. Loveland, A.M.S. Contemporary Mathematics series, vol. 29, Providence, R. I. (1984).

5. Bowen, K. [1980] Programming with Full First Order Logic (dissertation), School of Computer and Information Sciences, Syracuse University, November 1980.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Proof Theory for Modal Logic;Philosophy Compass;2011-08

2. Deriving specifications from requirements through problem reduction;IEE Proceedings - Software;2006

3. The Mechanization of Mathematics;Alan Turing: Life and Legacy of a Great Thinker;2004

4. A Second-Order Theorem Prover Applied to Circumscription;Automated Reasoning;2001

5. Automatic generation of epsilon-delta proofs of continuity;Artificial Intelligence and Symbolic Computation;1998