1. Towards a Proof Theory of Gödel Modal Logics
- Author
-
Nicola Olivetti, George Metcalfe, Laboratoire des Sciences de l'Information et des Systèmes (LSIS), Centre National de la Recherche Scientifique (CNRS)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Université de Toulon (UTLN)-Aix Marseille Université (AMU), and Aix Marseille Université (AMU)-Université de Toulon (UTLN)-Arts et Métiers Paristech ENSAM Aix-en-Provence-Centre National de la Recherche Scientifique (CNRS)
- Subjects
Computer Science - Logic in Computer Science ,General Computer Science ,Computer science ,Semantics (computer science) ,Modal logic ,0102 computer and information sciences ,02 engineering and technology ,Mathematics - Logic ,01 natural sciences ,Fuzzy logic ,cs.LO ,Theoretical Computer Science ,Modal ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,010201 computation theory & mathematics ,Proof theory ,Completeness (logic) ,TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS ,0202 electrical engineering, electronic engineering, information engineering ,Calculus ,020201 artificial intelligence & image processing ,Kripke semantics ,[INFO]Computer Science [cs] ,ComputingMilieux_MISCELLANEOUS ,Analytic proof - 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.
- Published
- 2011