Superposition For Full Higher-Order Logic

AUTOMATED DEDUCTION, CADE 28(2021)

引用 19|浏览17
暂无评分
摘要
We recently designed two calculi as stepping stones towards superposition for full higher-order logic: Boolean-free lambda-superposition and superposition for first-order logic with interpreted Booleans. Stepping on these stones, we finally reach a sound and refutationally complete calculus for higher-order logic with polymorphism, extensionality, Hilbert choice, and Henkin semantics. In addition to the complexity of combining the calculus's two predecessors, new challenges arise from the interplay between lambda-terms and Booleans. Our implementation in Zipperposition outperforms all other higher-order theorem provers and is on a par with an earlier, pragmatic prototype of Booleans in Zipperposition.
更多
查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络