The foundation of a generic theorem prover-Reference-Cited by-同舟云学术

The foundation of a generic theorem prover

Published:1989-09 Issue:3 Volume:5 Page:363-397
ISSN:0168-7433
Container-title:Journal of Automated Reasoning
language:en
Short-container-title:J Autom Reasoning

Author:

Paulson Lawrence C.

Publisher

Springer Science and Business Media LLC

Subject

Artificial Intelligence,Computational Theory and Mathematics,Software

Link

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

Reference37 articles.

1. Andrews, P. B.: An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, Academic Press (1986).

2. Andrews, P. B., Miller, D. A., Cohen, E. L., and Pfenning, F.: ?Automating higher-order logic?, in: Bledsoe, W. W. and Loveland, D. W. (eds.) Automated Theorem Proving: After 25 Years, American Mathematical Society (1984) pp. 169?192.

3. Avron, A., Honsell, F. A., and Mason, I. A.: ?Using typed lambda calculus to implement formal systems on a machine.? Report ECS-LFCS-87-31, Computer Science Department, University of Edinburgh (1987).

4. Barwise, J. (ed.): Handbook of Mathematical Logic, North-Holland (1977).

5. Barwise, J.: ?An introduction to first-order logic?, in: Barwise [4], pp. 5?46.

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

1. Making Mathematical Research Data FAIR: Pathways to Improved Data Sharing;Scientific Data;2024-06-22

2. The formal verification of the ctm approach to forcing;Annals of Pure and Applied Logic;2024-05

3. A Joint Logic of Problems and Propositions;Doklady Mathematics;2024-04

4. Formalizing Giles Gardam’s Disproof of Kaplansky’s Unit Conjecture;Proceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs;2024-01-09

5. A formalised theorem in the partition calculus;Annals of Pure and Applied Logic;2024-01