3 research outputs found

    Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics

    Get PDF
    International audienceWe develop semantically-oriented calculi for the cube of non-normal modal logics and some deontic extensions. The calculi manipulate hypersequents and have a simple semantic interpretation. Their main feature is that they allow for direct countermodel extraction. Moreover they provide an optimal decision procedure for the respective logics. They also enjoy standard proof-theoretical properties, such as a syntactical proof of cut-admissibility

    Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics

    No full text
    International audienceWe develop semantically-oriented calculi for the cube of non-normal modal logics and some deontic extensions. The calculi manipulate hypersequents and have a simple semantic interpretation. Their main feature is that they allow for direct countermodel extraction. Moreover they provide an optimal decision procedure for the respective logics. They also enjoy standard proof-theoretical properties, such as a syntactical proof of cut-admissibility

    Hypersequent calculi for non-normal modal and deontic logics: Countermodels and optimal complexity

    Full text link
    We present some hypersequent calculi for all systems of the classical cube and their extensions with axioms TT, PP, DD, and, for every n1n\geq 1, rule RDn+RD^+_n. The calculi are internal as they only employ the language of the logic, plus additional structural connectives. We show that the calculi are complete with respect to the corresponding axiomatisation by a syntactic proof of cut elimination. Then we define a terminating root-first proof search strategy based on the hypersequent calculi and show that it is optimal for coNP-complete logics. Moreover, we obtain that from every saturated leaf of a failed proof it is possible to define a countermodel of the root hypersequent in the bi-neighbourhood semantics, and for regular logics also in the relational semantics. We finish the paper by giving a translation between hypersequent rule applications and derivations in a labelled system for the classical cube
    corecore