Back to Search Start Over

Connections and higher-order logic

Authors :
Peter B. Andrews
Source :
8th International Conference on Automated Deduction ISBN: 9783540167808, CADE
Publication Year :
1986
Publisher :
Springer Berlin Heidelberg, 1986.

Abstract

Theorem proving is difficult and deals with complex phenomena. The difficulties seem to be compounded when one works with higher-order logic, but the rich expressive power of Church's formulation [10] [3] of this language makes research on theorem proving in this realm very worthwhile. In order to make significant progress on this problem, we need to try many approaches and ideas, and explore many questions. A highly relevant question is "What makes a logical formula valid?".

Details

ISBN :
978-3-540-16780-8
ISBNs :
9783540167808
Database :
OpenAIRE
Journal :
8th International Conference on Automated Deduction ISBN: 9783540167808, CADE
Accession number :
edsair.doi...........dd4ab8e8130a51e1f6eb486e35534a76
Full Text :
https://doi.org/10.1007/3-540-16780-3_75