中文
相关论文

相关论文: Towards a Proof Theory of G\"odel Modal Logics

200 篇论文

Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators "t:",…

逻辑 · 数学 2021-09-07 Nicholas Pischke

We introduce proper display calculi for basic monotonic modal logic,the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

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…

计算机科学中的逻辑 · 计算机科学 2026-04-27 Daniil Kozhemiachenko , Igor Sedlár

A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers. A labelled tableau system is…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Denisa Diaconescu , George Metcalfe , Laura Schnüriger

We introduce proper display calculi for basic monotonic modal logic, the conditional logic CK and a number of their axiomatic extensions. These calculi are sound, complete, conservative and enjoy cut elimination and subformula property. Our…

Justification logics are an explication of modal logic; boxes are replaced with proof terms formally through realisation theorems. This can be achieved syntactically using a cut-free proof system e.g. using sequent, hypersequent or nested…

计算机科学中的逻辑 · 计算机科学 2025-07-15 Sonia Marin , Paaras Padhiar

In this paper we provide a simplified semantics for the logic KD45(G), i.e. the many-valued G\"odel counterpart of the classical modal logic KD45. More precisely, we characterize KD45(G) as the set of valid formulae of the class of…

计算机科学中的逻辑 · 计算机科学 2016-11-15 Félix Bou , Francesc Esteva , Lluís Godo , Ricardo Oscar Rodriguez

This paper considers two logics. The first one, $\mathbf{K}\mathsf{G}_\mathsf{inv}$, is an expansion of the G\"odel modal logic $\mathbf{K}\mathsf{G}$ with the involutive negation $\sim_\mathsf{i}$ defined as…

逻辑 · 数学 2024-01-30 Marta Bilkova , Thomas Ferguson , Daniil Kozhemiachenko

Intuitionistic modal logics (IMLs) extend intuitionistic propositional logic with modalities such as the box and diamond connectives. Advances in the study of IMLs have inspired several applications in programming languages via the…

计算机科学中的逻辑 · 计算机科学 2025-12-12 Nachiappan Valliappan

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

计算机科学中的逻辑 · 计算机科学 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

We introduce sound and complete labelled sequent calculi for the basic normal non-distributive modal logic L and some of its axiomatic extensions, where the labels are atomic formulas of the first order language of enriched formal contexts,…

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

计算机科学中的逻辑 · 计算机科学 2009-02-13 Lutz Schröder , Dirk Pattinson

In this paper, we study logics of bounded distributive residuated lattices with modal operators considering $\Box$ and $\Diamond$ in a noncommutative setting. We introduce relational semantics for such substructural modal logics. We prove…

逻辑 · 数学 2020-06-02 Daniel Rogozin

Different theorem provers tend to produce proof objects in different formats and this is especially the case for modal logics, where several deductive formalisms (and provers based on them) have been presented. This work falls within the…

计算机科学中的逻辑 · 计算机科学 2016-09-15 Tomer Libal , Marco Volpe

Kripke frames (and models) provide a suitable semantics for sub-classical logics, for example Intuitionistic Logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and…

逻辑 · 数学 2019-07-02 Parvin Safari , Saeed Salehi

We consider the G\"odel bi-modal logic determined by fuzzy Kripke models where both the propositions and the accessibility relation are infinitely valued over the standard G\"odel algebra [0,1] and prove strong completeness of Fischer Servi…

逻辑 · 数学 2011-10-12 Xavier Caicedo , Ricardo Oscar Rodriguez

In this paper we use display calculus to show the decidability for normal modal logic K and some of its extensions.

逻辑 · 数学 2023-12-27 Jinsheng Chen

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…

逻辑 · 数学 2007-05-23 Georges Hansoul , Bruno Teheux

We introduce the first order logic of proofs $FOLP^\Box$ in the joint language combining justification terms and binding modalities. The main issue is Kripke--style semantics for this logic. We describe models for $FOLP^\Box$ in terms of…

计算机科学中的逻辑 · 计算机科学 2025-12-10 Tatiana Yavorskaya , Elena Popova

In this paper, we consider the well-known modal logics $\mathbf{K}$, $\mathbf{T}$, $\mathbf{K4}$, and $\mathbf{S4}$, and we study some of their sub-propositional fragments, namely the classical Horn fragment, the Krom fragment, the…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Davide Bresolin , Emilio Muñoz-Velasco , Guido Sciavicco
‹ 上一页 1 2 3 10 下一页 ›