Reference23 articles.
1. Peter B. Andrews, “Resolution in Type Theory,” Journal of Symbolic Logic 36 (1971), 414–432.
2. Peter B. Andrews, “Provability in Elementary Type Theory,” Zeitschrift für Mathematische Logik und Grundlagen der Mathematlk 20 (1974), 411–418.
3. Peter B. Andrews and Eve Longlni Cohen, “Theorem Proving in Type Theory,” Proceedings of the Fifth International Joint Conference on Artificial Intelligence 1977, 566.
4. Peter B. Andrews, “Transforming Matings into Natural Deduction Proofs,” Fifth Conference on Automated Deduction, Les Arcs, France, edited by W. Bibel and R. Kowalski, Lecture Notes in Computer Science, No. 87, Springer-Verlag, 1980, 281–292.
5. [5] Peter B. Andrews, “Theorem Proving Via General Matings,” Journal of the Association for Computing Machinery 28 (1981), 193–214.
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献