Author:
Benzmüller Christoph,Kohlhase Michael
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Peter B. Andrews, Matthew Bishop, Sunil Issar, Dan Nesmith, Frank Pfenning, and Hongwei Xi. TPS: A theorem proving system for classical type theory. Journal of Automated Reasoning, 16(3):321–353, 1996.
2. Peter B. Andrews. Resolution in type theory. Journal of Symbolic Logic, 36(3):414–432, 1971.
3. Peter B. Andrews. General models descriptions and choice in type theory. Journal of Symbolic Logic, 37(2):385–394, 1972.
4. Peter B. Andrews. An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof. Academic Press, 1986.
5. Peter B. Andrews. On Connections and Higher Order Logic. Journal of Automated Reasoning, 5:257–291, 1989.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Mechanical Mathematicians;Communications of the ACM;2023-03-23
2. Superposition with Lambdas;Journal of Automated Reasoning;2021-08-21
3. Superposition with Lambdas;Lecture Notes in Computer Science;2019
4. A Transfinite Knuth–Bendix Order for Lambda-Free Higher-Order Terms;Automated Deduction – CADE 26;2017
5. Higher-order aspects and context in SUMO;Journal of Web Semantics;2012-04