Speaker: 
Klaus Frovin Jørgensen

Title: 
Synthetic Completeness Proofs for Seligman-style Tableau Systems

Abstract: 
We report in this talk from ongoing work on tableau systems for hybrid logic. Here we provide completeness results for a wider range of hybrid logics and we do so by adapting the so-called synthetic approach to tableau completeness (originally due to Smullyan, and widely applied in modal logic by Fitting) so that we can directly build maximal consistent sets. This is joint work with P. Blackburn, T. Bolander and T. Braüner.