Formalizing a Seligman-Style Tableau System for Hybrid Logic [chapter]

Asta Halkjær From, Patrick Blackburn, Jørgen Villadsen
2020 Lecture Notes in Computer Science  
Hybrid logic is modal logic enriched with names for worlds. We formalize soundness and completeness proofs for a Seligman-style tableau system for hybrid logic in the proof assistant Isabelle/HOL. The formalization shows how to lift certain rule restrictions, thereby simplifying the original un-formalized proof. Moreover, the completeness proof we formalize is synthetic which suggests we can extend this work to prove a wider range of results about hybrid logic.
doi:10.1007/978-3-030-51074-9_27 fatcat:klxbbkjmwzhh7kfxm365meu4ai