Denisa Diaconescu ; George Metcalfe ; Laura Schnüriger - A Real-Valued Modal Logic

lmcs:3706 - Logical Methods in Computer Science, January 23, 2018, Volume 14, Issue 1 - https://doi.org/10.23638/LMCS-14(1:10)2018
A Real-Valued Modal LogicArticle

Authors: Denisa Diaconescu ; George Metcalfe ORCID; Laura Schnüriger

    A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers. A labelled tableau system is provided and a coNEXPTIME upper bound obtained for checking validity in the logic. Focussing on the modal-multiplicative fragment, the labelled tableau system is then used to establish completeness for a sequent calculus that admits cut-elimination and an axiom system that extends the multiplicative fragment of Abelian logic.

    https://doi.org/10.23638/LMCS-14(1:10)2018
    Source: arXiv.org:1706.02854
    Volume: Volume 14, Issue 1
    Published on: January 23, 2018
    Accepted on: December 19, 2017
    Submitted on: June 12, 2017
    Keywords: Computer Science - Logic in Computer Science
    Licence: Attribution 4.0 International (CC BY 4.0)
    Funding:
      Source : OpenAIRE Graph
    • Admissible Rules: From Characterizations to Applications; Funder: Swiss National Science Foundation; Code: 146748
    • Syntax Meets Semantics: Methods, Interactions, and Connections in Substructural logics.; Funder: European Commission; Code: 689176

    Classifications

    Mathematics Subject Classification 20201
    Sources:
    • [1] zbMATH Open.

    1 Document citing this article

    Share and export

    Consultation statistics

    This page has been seen 2135 times.
    This article's PDF has been downloaded 870 times.