Proof Systems for Gödel Logics with an Involution

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

G, the extension of Gödel logic G with an invo-lutive negation, has many applications, like its use as a fuzzy paraconsistent logic. In this paper we provide analytic proof systems for both the truth-preserving and the degree-preserving versions of G, as well as to its proper extensions in its language. In addition, we provide particularly simple Hilbert-type axiomatizations of these logics, which (unlike previous such axiomatizations) do not use Baaz' Δ operator. Instead, we follow a suggestion made (and left open) in [16], and base our systems on using, in addition to (MP), the rule (CP). (from ϕ → ψ infer ⇁ψ → ⇁ϕ). This establishes an interesting connection between G, and some major modal logics (like B and S 5).

Original languageEnglish
Title of host publicationProceedings - 2021 IEEE 51st International Symposium on Multiple-Valued Logic, ISMVL 2021
PublisherIEEE Computer Society
Pages68-73
Number of pages6
ISBN (Electronic)9781728192246
DOIs
StatePublished - May 2021
Event51st IEEE International Symposium on Multiple-Valued Logic, ISMVL 2021 - Virtual, Nur-sultan, Kazakhstan
Duration: 25 May 202127 May 2021

Publication series

NameProceedings of The International Symposium on Multiple-Valued Logic
Volume2021-May
ISSN (Print)0195-623X

Conference

Conference51st IEEE International Symposium on Multiple-Valued Logic, ISMVL 2021
Country/TerritoryKazakhstan
CityVirtual, Nur-sultan
Period25/05/2127/05/21

Funding

FundersFunder number
Israel Science Foundation550/19

    Keywords

    • Fuzzy Logics
    • Godel Logics
    • Proof Systems

    Fingerprint

    Dive into the research topics of 'Proof Systems for Gödel Logics with an Involution'. Together they form a unique fingerprint.

    Cite this