English
Related papers

Related papers: Non-normal modalities in variants of Linear Logic

200 papers

We present a novel investigation into the consistency operator ($\circ$), traditionally associated with paraconsistent logics, as a means of capturing non-normal modal classicalities within the Kripke framework. By semantically…

Logic · Mathematics 2026-02-25 Alfredo Roque Freire , Manuel António Martins

This paper investigates the extension of lattice-based logics into modal languages. We observe that such extensions admit multiple approaches, as the interpretation of the necessity operator is not uniquely determined by the underlying…

Logic in Computer Science · Computer Science 2025-10-01 Alfredo R. Freire , Manuel A. Martins

Epistemic modal logic normally views an epistemic situation as a Kripke model. We consider a more basic approach: to view an epistemic situation as a set W of possible states/worlds -- maximal consistent sets of propositions -- with…

Logic · Mathematics 2016-10-18 Sergei Artemov

Modal probabilistic logics provide a framework for reasoning about probability in modal contexts, involving notions such as knowledge, belief, time, and action. In this paper, we study a particular family of these logics, extending the…

Logic in Computer Science · Computer Science 2025-12-01 Daniil Kozhemiachenko , Igor Sedlár

The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable…

Logic · Mathematics 2019-05-10 Max Kanovich , Stepan Kuznetsov , Andre Scedrov

This paper presents an extension of temporal epistemic logic with operators that quantify over agent strategies. Unlike previous work on alternating temporal epistemic logic, the semantics works with systems whose states explicitly encode…

Logic in Computer Science · Computer Science 2018-07-13 Xiaowei Huang , Ron van der Meyden

We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the purely modal part of the rule system. Our criterion applies…

Logic in Computer Science · Computer Science 2015-07-01 Dirk Pattinson , Lutz Schröder

We introduce a monotone modal analogue of the intuitionistic (normal) modal logic IK using a translation into a suitable (intuitionistic) first-order logic. We axiomatise the logic and give a semantics by means of intuitionistic…

Logic · Mathematics 2025-07-21 Jim de Groot

In this paper, we prove the semantic incompleteness of the Hilbert-style system for the minimal normal term-modal logic with equality and non-rigid terms that was proposed in Liberman et al. (2020) "Dynamic Term-modal Logics for First-order…

Logic in Computer Science · Computer Science 2025-01-03 Takahiro Sawasaki

We define a Kripke semantics for a conditional logic based on the propositional logic $\mathsf{N4}$, the paraconsistent variant of Nelson's logic of strong negation; we axiomatize the minimal system induced by this semantics. The resulting…

Logic · Mathematics 2023-11-07 Grigory K. Olkhovikov

Within the program of finding axiomatizations for various parts of computability logic, it was proved earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting's intuitionistic calculus. That sort…

Logic in Computer Science · Computer Science 2011-04-15 Giorgi Japaridze

We give labeled natural deduction systems for a family of tense logics extending the basic linear tense logic Kl. We prove that our systems are sound and complete with respect to the usual Kripke semantics, and that they possess a number of…

Logic in Computer Science · Computer Science 2008-03-25 Luca Viganò , Marco Volpe

The proof theory and semantics of intuitionistic modal logics have been studied by Simpson in terms of Prawitz-style labelled natural deduction systems and Kripke models. An alternative to model-theoretic semantics is provided by…

Logic · Mathematics 2025-07-10 Yll Buzoku , David. J. Pym

Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a…

Logic · Mathematics 2015-04-21 Richard Zach

We generalize Fitting's work on Intuitionistic Kripke models of Set Theory using Ono and Komori's Residuated Kripke models. Based on these models, we provide a generalization of the von Neumann hierarchy in the context of Modal Residuated…

Logic · Mathematics 2024-05-09 Jose Moncayo , Pedro H. Zambrano

We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka…

Logic · Mathematics 2023-12-01 Nick Bezhanishvili , Anna Dmitrieva , Jim de Groot , Tommaso Moraschini

We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…

Logic in Computer Science · Computer Science 2016-06-24 Ori Lahav , João Marcos , Yoni Zohar

Non-additive uncertainty theories, typically possibility theory, belief functions and imprecise probabilities share a common feature with modal logic: the duality properties between possibility and necessity measures, belief and…

Artificial Intelligence · Computer Science 2023-03-24 Didier Dubois , Lluis Godo , Henri Prade

We introduce Lattice Annotated Temporal (LAT) Logic, an extension of Generalized Annotated Logic Programs (GAPs) that incorporates temporal reasoning and supports open-world semantics through the use of a lower lattice structure. This logic…

The framework of quantitative equational logic has been successfully applied to reason about algebras whose carriers are metric spaces and operations are nonexpansive. We extend this framework in two orthogonal directions: algebras endowed…

Logic in Computer Science · Computer Science 2022-01-25 Matteo Mio , Ralph Sarkis , Valeria Vignudelli
‹ Prev 1 4 5 6 7 8 10 Next ›