The TPS theorem proving system-Reference-Cited by-同舟云学术

The TPS theorem proving system

Published:1990 Issue: Volume: Page:641-642
ISSN:0302-9743
Container-title:10th International Conference on Automated Deduction
language:
Short-container-title:

Author:

Andrews Peter B.,Issar Sunil,Nesmith Dan,Pfenning Frank

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-52885-7_120.pdf

Reference14 articles.

1. Peter B. Andrews, Resolution in type theory, Journal of Symbolic Logic 36 (1971), 414–432.

2. Peter B. Andrews, Theorem proving via general matings, Journal of the ACM 28 (1981), 193–214.

3. Peter B. Andrews, An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, Academic Press, 1986.

4. Peter B. Andrews, Typed λ-calculus and automated mathematics, In Edgar G. K. Lopez-Escobar David W. Kueker and Carl H. Smith, editors, Mathematical Logic and Theoretical Computer Science, Lecture Notes in Pure and Applied Mathematics, vol. 106, Marcel Dekker, 1987, 1–14.

5. Peter B. Andrews, On connections and higher-order logic, Journal of Automated Reasoning 5 (1989), 257–291.

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

1. A realizability interpretation of Church's simple theory of types;Mathematical Structures in Computer Science;2016-07-22

2. An Algorithm for Deciding BAPA: Boolean Algebra with Presburger Arithmetic;Automated Deduction – CADE-20;2005

3. Planning diagonalization proofs;Artificial Intelligence: Methodology, Systems, and Applications;1998

4. Reduction and unification in lambda calculi with a general notion of subtype;Journal of Automated Reasoning;1994

5. Theory interpretation in simple type theory;Higher-Order Algebra, Logic, and Term Rewriting;1994