2000 character limit reached
Towards a Proof Theory of Gödel Modal Logics (1105.1256v2)
Published 6 May 2011 in math.LO and cs.LO
Abstract: 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\"odel logic. The calculi are used to establish completeness and complexity results for these fragments.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.