English
Related papers

Related papers: Paraconsistent G\"{o}del modal logic on bi-relatio…

200 papers

We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…

Logic in Computer Science · Computer Science 2022-08-16 Yasha Savelyev

We propose a modal study of the notion of bisimulation. Our contribution is threefold. First, we extend the basic modal language with a new modality $\nbi$, whose intended meaning is universal quantification over all states that are…

Logic in Computer Science · Computer Science 2026-04-14 Alfredo Burrieza , Fernando Soler-Toscano , Antonio Yuste-Ginel

We explore a fuzzy modal logic that can formalise probabilistic reasoning about actions and knowledge. In particular, we deal with contexts involving statements about events expressed via modal formulas, e.g., "after doing $a$, the…

Logic in Computer Science · Computer Science 2026-04-27 Daniil Kozhemiachenko , Igor Sedlár

In this paper we study frame definability in finitely-valued modal logics and establish two main results via suitable translations: (1) in finitely-valued modal logics one cannot define more classes of frames than are already definable in…

Logic · Mathematics 2022-06-28 Guillermo Badia , Xavier Caicedo , Carles Noguera

We investigate preservation results for the independent fusion of one-variable first-order modal logics. We show that, without equality, Kripke completeness and decidability of the global and local consequence relation are preserved, under…

Logic in Computer Science · Computer Science 2026-03-09 Roman Kontchakov , Dmitry Shkatov , Frank Wolter

On relational structures and on polymodal logics, we describe operations which preserve local tabularity. This provides new sufficient semantic and axiomatic conditions for local tabularity of a modal logic. The main results are the…

Logic · Mathematics 2025-07-16 Ilya B. Shapirovsky

Fuzzy logic extends the classical truth values "true" and "false" with additional truth degrees in between. More specifically, fuzzy modal logics in this sense are given by a choice of fuzzy modalities and a fuzzy propositional base. It has…

Logic in Computer Science · Computer Science 2026-02-13 Stefan Gebhart , Lutz Schröder , Paul Wild

Normal modal logics extending the logic K4.3 of linear transitive frames are known to lack the Craig interpolation property, except some logics of bounded depth such as S5. We turn this `negative' fact into a research question and pursue a…

Logic · Mathematics 2025-08-14 Agi Kurucz , Frank Wolter , Michael Zakharyaschev

G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…

Logic · Mathematics 2026-03-11 Alexander V. Gheorghiu

We study the modal logic of the closure algebra $P_2$, generated by the set of all polygons in the Euclidean plane $\mathbb{R}^2$. We show that this logic is finitely axiomatizable, is complete with respect to the class of frames we call…

Description logics (DLs) are a suitable formalism for representing knowledge about domains in which objects are described not only by attributes but also by binary relations between objects. Fuzzy extensions of DLs can be used for such…

Logic in Computer Science · Computer Science 2020-08-10 Linh Anh Nguyen , Quang-Thuy Ha , Ngoc Thanh Nguyen , Thi Hong Khanh Nguyen , Thanh-Luong Tran

The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…

Logic · Mathematics 2007-05-23 Georges Hansoul , Bruno Teheux

This paper is focused on the study of modal logics defined from valued Kripke frames, and particularly, on computability and expressibility questions of modal logics of transitive Kripke frames evaluated over certain residuated lattices. It…

Logic in Computer Science · Computer Science 2019-04-03 Amanda Vidal

It is known that many modal and superintuitionistic logics are PSPACE-hard in languages with a small number of variables; however, questions about the complexity of similar fragments of many logics obtained by adding various axioms to…

Logic · Mathematics 2025-09-25 M. Rybakov , M. Shcherbakov

G\"odel's Dialectica interpretation was designed to obtain a relative consistency proof for Heyting arithmetic, to be used in conjunction with the double negation interpretation to obtain the consistency of Peano arithmetic. In recent…

Category Theory · Mathematics 2021-09-17 Davide Trotta , Matteo Spadetto , Valeria de Paiva

We revisit the duality between Kripke and algebraic semantics of intuitionistic and intuitionistic modal logic. We find that there is a certain mismatch between the two semantics, which means that not all algebraic models can be embedded…

Logic in Computer Science · Computer Science 2024-12-18 G. A. Kavvos

This article aims to present a neighborhood semantic for a modal logic, namely, propositional logic of the plausible. As a subnormal character modal logic, not admits a Kripke semantics. However, the authors show that this neighborhood…

There has been renewed interest in recent years in McKinsey and Tarski's interpretation of modal logic in topological spaces and their proof that S4 is the logic of any separable dense-in-itself metric space. Here we extend this work to the…

Logic · Mathematics 2023-11-08 Robert Goldblatt , Ian Hodkinson

A non-distributive two-sorted hypersequent calculus \textbf{PDBL} and its modal extension \textbf{MPDBL} are proposed for the classes of pure double Boolean algebras and pure double Boolean algebras with operators respectively. A relational…

Logic · Mathematics 2022-07-25 Prosenjit Howlader , Mohua Banerjee

Given a class C of finite Kripke frames, we consider the uniform distribution on the frames from C with n states. A formula is almost surely valid in C if the probability that it is valid in a random C-frame with n states tends to 1 as n…

Logic · Mathematics 2025-01-01 Vladislav Sliusarev