Superposition for Full Higher-order Logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Superposition for Full Higher-order Logic


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.
Fichier principal
Vignette du fichier
conf.pdf (238.62 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03364032 , version 1 (04-10-2021)



Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirović. Superposition for Full Higher-order Logic. CADE 2021 - 28th International Conference on Automated Deduction, Jul 2021, Pittsburgh, PA / online, United States. pp.396-412, ⟨10.1007/978-3-030-79876-5_23⟩. ⟨hal-03364032⟩
52 View
44 Download



Gmail Facebook Twitter LinkedIn More