Marta Bílková, Sabine Frittella, Daniil Kozhemiachenko
{"title":"Fuzzy bi-Gödel modal logic and its paraconsistent relatives","authors":"Marta Bílková, Sabine Frittella, Daniil Kozhemiachenko","doi":"10.1093/logcom/exae011","DOIUrl":null,"url":null,"abstract":"We present an axiomatization of the fuzzy bi-Gödel modal logic ${\\textbf{K}\\textsf{biG}}^{\\textsf{f}}$ formulated in the language containing $\\triangle $ (Baaz Delta operator) and treating $-\\!-\\!< $ (co-implication) as the defined connective. We also consider two paraconsistent relatives of ${\\textbf{K}\\textsf{biG}}^{\\textsf{f}}$ — $\\textbf{K}\\textsf{G}^{2\\pm \\textsf{f}}$ and $\\textsf{G}^{2\\pm \\textsf{f}}_{\\blacksquare ,\\blacklozenge }$. These logics are defined on fuzzy frames with two valuations $e_{1}$ and $e_{2}$ standing for the support of truth and falsity, 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 $\\textbf{K}\\textsf{G}^{2\\pm \\textsf{f}}$ and $\\textsf{G}^{2\\pm \\textsf{f}}_{\\blacksquare ,\\blacklozenge }$ into ${\\textbf{K}\\textsf{biG}}^{\\textsf{f}}$ and use them to obtain the characterization of $\\textbf{K}\\textsf{G}^{2}$- and $\\textsf{G}^{2}_{\\blacksquare ,\\blacklozenge }$-definable frames. Moreover, we study the transfer of ${\\textbf{K}\\textsf{biG}}^{\\textsf{f}}$ formulas into $\\textbf{K}\\textsf{G}^{2\\pm \\textsf{f}}$, i.e., formulas that are ${\\textbf{K}\\textsf{biG}}^{\\textsf{f}}$-valid on mono-relational frames $\\mathfrak{F}$ and $\\mathfrak{F}^{\\prime}$ iff they are $\\textbf{K}\\textsf{G}^{2\\pm \\textsf{f}}$-valid on their bi-relational counterparts. Finally, we establish $\\textsf{PSpace}$-completeness of all considered logics.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":"1 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2024-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Logic and Computation","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1093/logcom/exae011","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
We present an axiomatization of the fuzzy bi-Gödel modal logic ${\textbf{K}\textsf{biG}}^{\textsf{f}}$ formulated in the language containing $\triangle $ (Baaz Delta operator) and treating $-\!-\!< $ (co-implication) as the defined connective. We also consider two paraconsistent relatives of ${\textbf{K}\textsf{biG}}^{\textsf{f}}$ — $\textbf{K}\textsf{G}^{2\pm \textsf{f}}$ and $\textsf{G}^{2\pm \textsf{f}}_{\blacksquare ,\blacklozenge }$. These logics are defined on fuzzy frames with two valuations $e_{1}$ and $e_{2}$ standing for the support of truth and falsity, 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 $\textbf{K}\textsf{G}^{2\pm \textsf{f}}$ and $\textsf{G}^{2\pm \textsf{f}}_{\blacksquare ,\blacklozenge }$ into ${\textbf{K}\textsf{biG}}^{\textsf{f}}$ and use them to obtain the characterization of $\textbf{K}\textsf{G}^{2}$- and $\textsf{G}^{2}_{\blacksquare ,\blacklozenge }$-definable frames. Moreover, we study the transfer of ${\textbf{K}\textsf{biG}}^{\textsf{f}}$ formulas into $\textbf{K}\textsf{G}^{2\pm \textsf{f}}$, i.e., formulas that are ${\textbf{K}\textsf{biG}}^{\textsf{f}}$-valid on mono-relational frames $\mathfrak{F}$ and $\mathfrak{F}^{\prime}$ iff they are $\textbf{K}\textsf{G}^{2\pm \textsf{f}}$-valid on their bi-relational counterparts. Finally, we establish $\textsf{PSpace}$-completeness of all considered logics.
期刊介绍:
Logic has found application in virtually all aspects of Information Technology, from software engineering and hardware to programming and artificial intelligence. Indeed, logic, artificial intelligence and theoretical computing are influencing each other to the extent that a new interdisciplinary area of Logic and Computation is emerging.
The Journal of Logic and Computation aims to promote the growth of logic and computing, including, among others, the following areas of interest: Logical Systems, such as classical and non-classical logic, constructive logic, categorical logic, modal logic, type theory, feasible maths.... Logical issues in logic programming, knowledge-based systems and automated reasoning; logical issues in knowledge representation, such as non-monotonic reasoning and systems of knowledge and belief; logics and semantics of programming; specification and verification of programs and systems; applications of logic in hardware and VLSI, natural language, concurrent computation, planning, and databases. The bulk of the content is technical scientific papers, although letters, reviews, and discussions, as well as relevant conference reviews, are included.