Completing Gordon's Higher-Order Logic
Andrei Popescu
2025Year
1Citations
Abstract
Mike Gordon’s Higher-Order Logic (HOL) is one of the most important logical foundations for interactive theorem proving. The standard semantics of HOL, due to Andrew Pitts, employs a downward closed universe of sets, and interprets HOL’s Hilbert choice operator via a global choice function on the universe. In this paper we fill a gap in the meta-theory of HOL: We provide a natural Henkin-style notion of general model corresponding to the standard models, and discover an enrichment of HOL deduction that we prove to be sound and complete w.r.t. these general models.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on1
Related papers
- Set-Theoretic and Type-Theoretic Ordinals CoincideTom de Jong, Nicolai Kraus, Fredrik Nordvall Forsberg, Chuangjie XuLICS 2023 · 4 citations
- Graph Representations for Higher-Order Logic and Theorem ProvingAditya Paliwal, Sarah M. Loos, Markus N. Rabe, Kshitij Bansal et al.AAAI 2020 · 110 citations
- Higher-Order MSL Horn ConstraintsJerome Jochems, Eddie Jones, Steven J. RamsayPOPL 2023 · 1 citation
- Axe 'Em: Eliminating Spurious States with Induction AxiomsNeta Elad, Sharon ShohamPOPL 2025 · 1 citation
- First-Order AutomataLuca Geatti, Alessandro Gianola, Nicola GiganteAAAI 2025 · 3 citations
