All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Paraconsistent Gödel Modal Logic

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F22%3A00560973" target="_blank" >RIV/67985807:_____/22:00560973 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1007/978-3-031-10769-6_26" target="_blank" >http://dx.doi.org/10.1007/978-3-031-10769-6_26</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-031-10769-6_26" target="_blank" >10.1007/978-3-031-10769-6_26</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Paraconsistent Gödel Modal Logic

  • Original language description

    We introduce a paraconsistent modal logic KG2, based on Gödel logic with coimplication (bi-Gödel logic) expanded with a De Morgan negation ¬. We use the logic to formalise reasoning with graded, incomplete and inconsistent information. Semantics of KG2 is two-dimensional: we interpret KG2 on crisp frames with two valuations v1 and v2, connected via ¬, that assign to each formula two values from the real-valued interval [0, 1]. The first (resp., second) valuation encodes the positive (resp., negative) information the state gives to a statement. We obtain that KG2 is strictly more expressive than the classical modal logic K by proving that finitely branching frames are definable and by establishing a faithful embedding of K into KG2. We also construct a constraint tableau calculus for KG2 over finitely branching frames, establish its decidability and provide a complexity evaluation

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA22-01137S" target="_blank" >GA22-01137S: Metamathematics of substructural modal logics</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2022

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Automated Reasoning: 11th International Joint Conference, IJCAR 2022 Proceedings

  • ISBN

    978-3-031-10768-9

  • ISSN

  • e-ISSN

  • Number of pages

    20

  • Pages from-to

    429-448

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Haifa

  • Event date

    Aug 8, 2022

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000876376400026