Experimenting with the LogiKEy Framework & Methodology

Higher-Order Logic, Semantical Embeddings, Formal Argumentation for Legal Reasoning, and Computational Metaphysics — an introductory lecture course at Zhejiang University, Hangzhou, 10–19 November 2026.

10–19 November 2026• Six lectures (times below) ZLAIRE lecture room, Floor 3, Information and Control Building, Zijingang Campus, Zhejiang University
Christoph Benzmüller
University of Bamberg — Chair for AI Systems Engineering
FU Berlin — Dep. of Mathematics and Computer Science
Luca Pasetto
University of Luxembourg — Department of Computer Science, Computational Law and Machine Ethics group
Abstract

The course provides an introduction to the LogiKEy framework and methodology for Logic and Knowledge Engineering. LogiKEy’s unifying approach is based on semantical embeddings of object logics in expressive classical higher-order logic (HOL). We begin with the methodology, introduce HOL, and give a guided practical tour of the Isabelle/HOL proof assistant. Next, we explain the technique of semantical embeddings of object logics in the meta-logic HOL, which enables the automation and model finding available in HOL provers to reason with the embedded logics.

We then apply the framework in three steps. First, we encode abstract argumentation frameworks and their semantics in HOL, and we discuss deontic logics and corresponding ethical or legal theories to support computational tools for normative reasoning. Second, we build a LogiKEy domain theory on top of the argumentation library: a formal account of implicit disagreement, where agents share a conclusion but not the reasons for it, and its mechanization. We conclude with the embedding of quantified logics and an application in computational metaphysics: the analysis of a version of the modal ontological argument from Kurt Gödel’s papers.

Programme — Six Lectures
Lectures 1–3 and 6 draw on our ESSLLI 2026 course (Prague, August 2026); Lectures 4 and 5 are new and build on each other: an argumentation library in HOL and a domain theory of implicit disagreement on top of it.
Lecture 1Tue 10 Nov
14:00–16:00
Foundations — LogiKEy & Isabelle/HOL

General Introduction to LogiKEy, Hands-on with Isabelle/HOL

  • The LogiKEy framework and methodology
    Overview of the course. History and interdisciplinary methodology; experimentation in formal studies: representing examples, domain theories, logics, and logic combinations within a computational system.
  • The Isabelle/HOL proof assistant
    Guided tour: basic warm-up; proof automation with Sledgehammer and (counter-)model finding with Nitpick; Cantor theorem and Boolos’ curious inference.
Further Reading[1][2][9][4][5]
Lecture 2Thu 12 Nov
11:00–13:00
Foundations — HOL

Classical Higher-Order Logic

  • HOL and Church’s type theory
    Classical higher-order logic based on Church’s type theory as an expressive meta-logical language; higher-order interactive theorem proving.
MaterialsHOL (PDF)
Further Reading[3][12]
Lecture 3Fri 13 Nov
10:00–12:00
Semantical Embeddings

Shallow and Deep Embeddings in HOL

  • Deep vs. shallow embeddings of logics
    Shallow Semantical Embeddings (SSE) of object logics in the meta-logic HOL; propositional logic embedding demo.
  • Embedding of propositional modal logic
    The modal logic cube in Isabelle/HOL; frame conditions such as reflexivity and transitivity; testing axioms; propositional modal logics via SSE.
Further Reading[6][7][10][13][15]
Lecture 4Tue 17 Nov
14:00–16:00
Argumentation

Abstract Argumentation in HOL

  • Abstract argumentation in ten minutes
    Dung’s argumentation frameworks; extension semantics (conflict-free, admissible, complete, grounded, preferred, stable, semi-stable, stage, ideal) and their labelling counterparts; the landscape of semantics and three benchmark frameworks.
  • The encoding of Fuenmayor and Steen
    Sets as predicates, semantics as higher-order predicates; one generic notion of minimality and maximality with a projection; the characteristic function as defends; the simplified encoding and its relativisation to an explicit universe of arguments.
  • Reasoning about argumentation: the meta-theory
    Dung’s Fundamental Lemma, existence and uniqueness results, the inclusion landscape, and the correspondence between extensions and labellings — proved with Sledgehammer, non-theorems refuted with Nitpick; theory exploration as a conjecture–countermodel–repair loop.
  • Reasoning with argumentation: generating extensions and labellings
    Encoding a concrete framework; generating single and all extensions or labellings with the model finder under arbitrary higher-order constraints; proving instead of searching; positioning versus SAT/ASP solvers and outlook.
Further Reading[18][19][20][21]
Lecture 5Wed 18 Nov
14:00–16:00
Argumentation — Domain Theory

Implicit Disagreement in HOL

  • Agreeing for different reasons
    A legal case study: two agents reach the same conclusion from different reasons and form a coalition; agreement that versus agreement because; agents, coalitions, three inference relations over preferred extensions, explanations and shared explanations.
  • Implicit disagreement, and where it sits
    Proximal and distal implicit disagreement, potential versus actual; counterfactual deletion of arguments, weak spots, antagonists, and the locus of a disagreement.
  • The embedding as a LogiKEy domain theory
    From the object logic (the argumentation library of Lecture 4) to a domain theory on top of it: frameworks, agents, coalitions and deletions as values of one type; inference, explanations and disagreement as HOL predicates; the agreement hierarchy and the correspondence of shared explanations with ideal semantics, proved.
  • The case study, lemma by lemma
    The running example as an application-layer theory: preferred extensions computed by proof, the four questions answered as lemmas; what the mechanization caught, and lessons for one’s own LogiKEy development.
Further Reading[22][23][24][25][19]
Lecture 6Thu 19 Nov
14:00–16:00
Quantifiers & Computational Metaphysics — Wrapping Up

Embedding Quantified Logics; Gödel’s Ontological Argument in HOL

  • Embedding of quantifiers: QBF and first-order modal logic
    Quantified Boolean formulas and first-order multimodal logics via SSE; automation of faithfulness proofs; converting formulas across embeddings.
  • Higher-order multimodal logic (HOML)
    SSE of HOML in HOL as the formal setting for metaphysical experiments.
  • Gödel’s modal ontological argument
    The argument as presented in Gödel’s 1970 manuscript; Isabelle/HOL encoding; how automated theorem provers verify consistency and identify hidden assumptions — and how they revealed a previously unnoticed inconsistency in Gödel’s original argument.
  • Positive properties and Scott’s variant
    Gödel’s notion of positive properties and how it constitutes a (modal) ultrafilter; Dana Scott’s variant of the argument and its Isabelle/HOL encoding.
  • Wrap-up and outlook
    Comments on open problems, unification, and future directions.
Expected Level & Prerequisites

Introductory course. In order to benefit from this course, participants are expected to have a basic understanding of discrete mathematics, propositional logic, and modal logic. The course is highly interdisciplinary and will also appeal to students from machine ethics, legal theory, AI & Law, and philosophy.

Selected References
  1. C. Benzmüller, X. Parent, L. van der Torre: Designing Normative Theories for Ethical and Legal Reasoning: LogiKEy Framework, Methodology, and Tool Support. Artificial Intelligence 287 (2020). doi.org/10.1016/j.artint.2020.103348 · arXiv:1903.10187 · LogiKEy sources
  2. C. Benzmüller, A. Farjami, D. Fuenmayor, P. Meder, X. Parent, A. Steen, L. van der Torre, V. Zahoransky: LogiKEy Workbench: Deontic Logics, Logic Combinations and Expressive Ethical and Legal Reasoning (Isabelle/HOL dataset). Data in Brief 33 (2020). doi.org/10.1016/j.dib.2020.106409 · LogiKEy: 2020-DataInBrief-Data
  3. C. Benzmüller, P. Andrews: Church’s Type Theory. In: The Stanford Encyclopedia of Philosophy, Spring 2024 edition. plato.stanford.edu/archives/spr2024/entries/type-theory-church/
  4. C. Benzmüller, D. Fuenmayor, A. Steen, G. Sutcliffe: Who Finds the Short Proof? An Exploration of Variants of Boolos’ Curious Inference using Higher-order Automated Theorem Provers. Logic Journal of the IGPL 32(3): 442–459, 2024. doi.org/10.1093/jigpal/jzac082 · arXiv:2208.06879 · AFP: Boolos_Curious_Inference_Automated
  5. C. Benzmüller, D. Fuenmayor, A. Steen, G. Sutcliffe: Automation of Boolos’ Curious Inference in Isabelle/HOL. Archive of Formal Proofs, 2022. isa-afp.org/entries/Boolos_Curious_Inference_Automated.html
  6. C. Benzmüller: Faithful Logic Embeddings in HOL — Deep and Shallow. In: CADE-30, LNCS 15943, pp. 280–302, Springer, 2025. doi.org/10.1007/978-3-031-99984-0_16 · arXiv:2502.19311 · AFP: FaithfulPMLinHOL · LogiKEy: 2025-CADE-DeepShallow
  7. C. Benzmüller: Faithful Logic Embeddings in HOL — Deep and Shallow (Isabelle/HOL dataset). Archive of Formal Proofs, 2025. isa-afp.org/entries/FaithfulPMLinHOL.html
  8. C. Benzmüller, D. Kirchner: First-Order Modal Logic in HOL: Deep and Shallow Embeddings with Automated Faithfulness. ARQNL 2026. Extended preprint with source-code appendix: arXiv:2607.10880
  9. C. Benzmüller, D. Kirchner, L. Pasetto: Many Logics, One Methodology: A Plea for Logical Pluralism in Formalised Reasoning. To appear. Preprint: arXiv:2605.27246
  10. C. Benzmüller, M. Claus, N. Sultana: Systematic Verification of the Modal Logic Cube in Isabelle/HOL. PxTP 2015, EPTCS 186, pp. 27–41. doi.org/10.4204/EPTCS.186.5
  11. C. Benzmüller, D. Fuenmayor, B. Lomfeld: Modelling Value-oriented Legal Reasoning in LogiKEy. Logics 2(1): 31–78, 2024. doi.org/10.3390/logics2010003 · arXiv:2006.12789 · LogiKEy: EncodingLegalBalancing
  12. C. Benzmüller, C. Brown, M. Kohlhase: Higher-Order Semantics and Extensionality. Journal of Symbolic Logic 69(4): 1027–1088, 2004. doi.org/10.2178/jsl/1102022211
  13. C. Benzmüller, L. C. Paulson: Multimodal and Intuitionistic Logics in Simple Type Theory. Logic Journal of the IGPL 18(6): 881–892, 2010. doi.org/10.1093/jigpal/jzp080
  14. C. Benzmüller, L. C. Paulson: Quantified Multimodal Logics in Simple Type Theory. Logica Universalis 7(1): 7–20, 2013. doi.org/10.1007/s11787-012-0052-y
  15. C. Benzmüller: Combining and Automating Classical and Non-classical Logics in Classical Higher-Order Logic. Annals of Mathematics and Artificial Intelligence 62(1–2): 103–128, 2011. doi.org/10.1007/s10472-011-9249-7
  16. C. Benzmüller, D. Kirchner: Monadic Second-Order Logic in HOL: Deep and Shallow Embeddings with Automated Faithfulness (Isabelle/HOL dataset). Archive of Formal Proofs, 2026. AFP: MSOinHOL
  17. C. Benzmüller, D. Kirchner: A Deep Embedding of HOL in HOL: Soundness, Completeness, Consistency (Isabelle/HOL dataset). Archive of Formal Proofs, 2026. AFP: HOL_in_HOL_Deep
  18. D. Fuenmayor, A. Steen: A Flexible Approach to Argumentation Framework Analysis using Theorem Proving. In: Logics for New-Generation AI (LNGAI 2021), pp. 18–32, College Publications, 2021. aureleeNet/formalizations
  19. A. Steen, D. Fuenmayor: A Formalization of Abstract Argumentation in Higher-Order Logic. Journal of Logic and Computation 34(2), 2024. doi.org/10.1093/logcom/exac027 · arXiv:2110.09174
  20. P. M. Dung: On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games. Artificial Intelligence 77(2): 321–358, 1995. doi.org/10.1016/0004-3702(94)00041-X
  21. P. Baroni, M. Caminada, M. Giacomin: An Introduction to Argumentation Semantics. The Knowledge Engineering Review 26(4): 365–410, 2011. doi.org/10.1017/S0269888911000166
  22. L. Redondi, L. Pasetto, C. Benzmüller, R. Markovich: Shared Conclusions without Shared Explanations: Mechanizing Implicit Disagreement in Abstract Argumentation with LogiKEy. Submitted, 2026. LogiKEy: ImplicitDisagreement
  23. M. D. Baumtrog: The Basic Components of Agreement. Informal Logic 43(2): 257–279, 2023. doi.org/10.22329/il.v43i2.7249
  24. A. Rotolo, G. Sartor: Argumentation and Explanation in the Law. Frontiers in Artificial Intelligence 6, 2023. doi.org/10.3389/frai.2023.1130559
  25. P. M. Dung, P. Mancarella, F. Toni: Computing Ideal Sceptical Argumentation. Artificial Intelligence 171(10–15): 642–674, 2007. doi.org/10.1016/j.artint.2007.05.003
  26. C. Benzmüller, D. Scott: Notes on Gödel’s and Scott’s Variants of the Ontological Argument. Monatshefte für Mathematik, 2025. doi.org/10.1007/s00605-025-02078-x · AFP: Notes_On_Goedels_Ontological_Argument
  27. C. Benzmüller, D. Scott: Notes on Gödel’s and Scott’s Variants of the Ontological Argument (Isabelle/HOL dataset). Archive of Formal Proofs, 2025. isa-afp.org/entries/Notes_On_Goedels_Ontological_Argument.html
  28. C. Benzmüller, B. Woltzenlogel Paleo: Automating Gödel’s Ontological Proof of God’s Existence with Higher-order Automated Theorem Provers. ECAI 2014, IOS Press, pp. 93–98. doi.org/10.3233/978-1-61499-419-0-93
  29. C. Benzmüller, B. Woltzenlogel Paleo: The Inconsistency in Gödel’s Ontological Argument: A Success Story for AI in Metaphysics. IJCAI 2016, pp. 936–942. ijcai.org/Proceedings/16/Papers/137.pdf · LogiKEy: 2016-IJCAI