Cyclic Hypersequent Calculi for Some Modal Logics with the Master Modality

Authors
Publication date 2021
Host editors
  • A. Das
  • S. Negri
Book title Automated Reasoning with Analytic Tableaux and Related Methods
Book subtitle 30th International Conference, TABLEAUX 2021, Birmingham, UK, September 6–9, 2021 : proceedings
ISBN
  • 9783030860585
ISBN (electronic)
  • 9783030860592
Series Lecture Notes in Computer Science
Event 30th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Pages (from-to) 354-370
Publisher Cham: Springer
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Abstract
At LICS 2013, O. Lahav introduced a technique to uniformly construct cut-free hypersequent calculi for basic modal logics characterised by frames satisfying so-called ‘simple’ first-order conditions. We investigate the generalisation of this technique to modal logics with the master modality (a.k.a. reflexive-transitive closure modality). The (co)inductive nature of this modality is accounted for through the use of non-well-founded proofs, which are made cyclic using focus-style annotations. We show that the peculiarities of hypersequents hinder the usual method of completeness via infinitary proof-search. Instead, we construct countermodels from maximally unprovable hypersequents. We show that this yields completeness for a small (yet infinite) subset of simple frame conditions.
Document type Conference contribution
Language English
Published at https://doi.org/10.1007/978-3-030-86059-2_21
Permalink to this page
Back