George Metcalfe ; Nicola Olivetti - Towards a Proof Theory of Gödel Modal Logics

lmcs:972 - Logical Methods in Computer Science, May 17, 2011, Volume 7, Issue 2 - https://doi.org/10.2168/LMCS-7(2:10)2011
Towards a Proof Theory of Gödel Modal LogicsArticle

Authors: George Metcalfe ORCID; Nicola Olivetti

Analytic proof calculi are introduced for box and diamond fragments of basic modal fuzzy logics that combine the Kripke semantics of modal logic K with the many-valued semantics of Gödel logic. The calculi are used to establish completeness and complexity results for these fragments.


Volume: Volume 7, Issue 2
Secondary volumes: Selected Papers of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2009)
Published on: May 17, 2011
Imported on: July 25, 2010
Keywords: Mathematics - Logic, Computer Science - Logic in Computer Science, cs.LO
Funding:
    Source : OpenAIRE Graph
  • Immunologie des Typ-1 Diabetes.; Funder: Swiss National Science Foundation; Code: 20002
  • Admissible Rules in Logic and Algebra; Funder: Swiss National Science Foundation; Code: 129507

17 Documents citing this article

Consultation statistics

This page has been seen 3234 times.
This article's PDF has been downloaded 1338 times.