Synthetic Completeness Proofs for Seligman-style Tableau Systems
Klaus Frovin Jørgensen, Patrick Blackburn, Thomas Bolander, Torben Braüner · RUCforsk (Roskilde University) · 2016
Hybrid logic is a form of modal logic which allows reference to worlds.We can think of it as 'modal logic with labelling built into the object language' and various forms of labelled deduction have played a central role in its proof theory.Jerry Seligman's work [13,14] in which 'rules involving labels' are rejected in favour of 'rules for all' is an interesting exception to this.Seligman's approach was originally for natural deduction; the authors of the present paper recently extended it to tableau inference [1,2].Our earlier work was syntactic: we showed completeness by translating between Seligman-style and labelled tableaus, but our results only covered the minimal hybrid logic; in the present paper we provide completeness results for a wider range of hybrid logics and languages.We do so by adapting the synthetic approach to tableau completeness (due to Smullyan, and widely applied in modal logic by Fitting) so that we can directly build maximal consistent sets of tableau blocks.