Fuzzy bi-Godel modal logic and its paraconsistent relatives

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F25%3A00604115" target="_blank" >RIV/67985807:_____/25:00604115 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1093/logcom/exae011" target="_blank" >https://doi.org/10.1093/logcom/exae011</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1093/logcom/exae011" target="_blank" >10.1093/logcom/exae011</a>

Result language

angličtina

Original language name

Fuzzy bi-Godel modal logic and its paraconsistent relatives

Original language description

We present the axiomatisation of the fuzzy bi-Godel modal logic KbiG(f) (formulated in the language containing Delta (Baaz delta operator) and treating < (co-implication) as a defined connective). We also consider its paraconsistent relatives KbiG(f) KG(2 +/- f) and G(square,lozenge)(2 +/- f). respectively, and equipped with two fuzzy relations R+ and R- used to determine supports of truth and falsity of modal formulas. We construct embeddings of KG(2 +/- f) and G(square,lozenge)(2 +/- f) into KbiG(f) and use them to obtain the characterization of KG(2)- and G(square,lozenge)(2)-definable frames. Moreover, we study the transfer of KbiG(f) formulas into KG(2 +/- f), i.e., formulas that are KbiG(f)-valid on mono-relational frames F and F' iff they are KG(2 +/- f)-valid on their bi-relational counterparts. Finally, we establish PSpace-completeness of all considered logics.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

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

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

Publication year

2025

Confidentiality

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

Name of the periodical

Journal of Logic and Computation

ISSN

0955-792X

e-ISSN

1465-363X

Volume of the periodical

35

Issue of the periodical within the volume

2

Country of publishing house

GB - UNITED KINGDOM

Number of pages

37

Pages from-to

exae011

UT code for WoS article

001195311900001

EID of the result in the Scopus database

—