English
Related papers

Related papers: Non-Normal Super-Strict Implications

200 papers

The semantics for counterfactuals due to David Lewis has been challenged on the basis of unlikely, or impossible, events. Such events may skew a given similarity order in favour of those possible worlds which exhibit them. By updating the…

Logic in Computer Science · Computer Science 2016-06-28 Patrick Girard , Marcus Anthony Triplett

Following the idea of Subexponential Linear Logic and Stratified Bounded Linear Logic, we propose a new parameterized version of Linear Logic which subsumes other systems like ELL, LLL or SLL, by including variants of the exponential rules.…

Logic in Computer Science · Computer Science 2022-01-03 Esaïe Bauer , Olivier Laurent

Linear implication can represent state transitions, but real transition systems operate under temporal, stochastic or probabilistic constraints that are not directly representable in ordinary linear logic. We propose a general modal…

Logic in Computer Science · Computer Science 2016-03-09 Joelle Despeyroux , Kaustuv Chaudhuri

Suszko's Sentential Calculus with Identity SCI results from classical propositional calculus CPC by adding a new connective $\equiv$ and axioms for identity $\varphi\equiv\psi$ (which we interpret here as `propositional identity'). We…

Logic in Computer Science · Computer Science 2023-04-04 Steffen Lewitzka

In this article we determine the implicational fragments of most of the known subintuitionistic logics.

Logic · Mathematics 2025-07-15 Fatemeh Shirmohammadzadeh Maleki , Dick de Jongh

While finite-variable fragments of the propositional modal logic S5--complete with respect to reflexive, symmetric and transitive frames--are polynomial-time decidable, the restriction to finite-variable formulas for logics of reflexive and…

Logic · Mathematics 2019-10-08 Mikhail Rybakov , Dmitry Shkatov

Subexponential logic is a variant of linear logic with a family of exponential connectives--called subexponentials--that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening…

Logic in Computer Science · Computer Science 2016-02-22 Kaustuv Chaudhuri

This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains.…

Logic · Mathematics 2023-11-09 Tim S. Lyon , Eugenio Orlandelli

In this paper, we present a generalisation of a theorem of David and Rob Pollack. In 'A construction of rigid analytic cohomology classes for congruence subgroups of SL(3,Z)', they give a very general argument for lifting ordinary…

Number Theory · Mathematics 2018-06-18 Chris Williams

In this paper, we construct a large class of new simple modules over the twisted $N=2$ superconformal algebra. These new simple modules are restricted modules based on the simple modules over certain finite-dimensional solvable Lie…

Representation Theory · Mathematics 2025-06-05 Haibo Chen , Yucai Su , Yukun Xiao

Mortensen introduced a connexive logic commonly known as 'M3V'. M3V is obtained by adding a special conditional to LP. Among its most notable features, besides its being connexive, M3V is negation-inconsistent and it validates the negation…

Logic in Computer Science · Computer Science 2022-04-15 Luis Estrada-González , Fernando Cano-Jorge

We derive a modular anomaly equation satisfied by the prepotential of the N=2* supersymmetric theories with non-simply laced gauge algebras, including the classical B and C infinite series and the exceptional F4 and G2 cases. This equation…

High Energy Physics - Theory · Physics 2015-10-23 M. Billo , M. Frau , F. Fucito , A. Lerda , J. F. Morales

Supervenience is an important philosophical concept. In this paper, inspired by the supervenience-determined consequence relation and the semantics of agreement operator, we introduce a modal logic of supervenience, which has a dyadic…

Logic · Mathematics 2019-09-18 Jie Fan

Input/Output (I/O) logic is a general framework for reasoning about conditional norms and/or causal relations. We streamline Bochman's causal I/O logics via proof-search-oriented sequent calculi. Our calculi establish a natural syntactic…

Logic in Computer Science · Computer Science 2023-06-19 Agata Ciabattoni , Dmitry Rozplokhas

This paper aims to describe the restricted Kac modules of restricted Hamiltonian Lie superalgebras of odd type over an algebraically closed field of characteristic $p>3$. In particular, a sufficient and necessary condition for the…

Representation Theory · Mathematics 2018-07-27 Jixia Yuan , Wende Liu

We study abstract versions of G\"odel's second incompleteness theorem and formulate generalizations of L\"ob's derivability conditions that work for logics weaker than the classical one. We isolate the role of contraction rule in G\"odel's…

Logic · Mathematics 2016-02-19 Lev Beklemishev , Daniyar Shamkanov

We investigate a recent proposal for modal hypersequent calculi. The interpretation of relational hypersequents incorporates an accessibility relation along the hypersequent. These systems give the same interpretation of hypersequents as…

Logic · Mathematics 2021-12-22 Samara Burns , Richard Zach

Prime implicates and prime implicants have proven relevant to a number of areas of artificial intelligence, most notably abductive reasoning and knowledge compilation. The purpose of this paper is to examine how these notions might be…

Logic in Computer Science · Computer Science 2014-01-16 Meghyn Bienvenu

We consider the non-supersymmetric "magic" theories based on the split quaternion and the split complex division algebras. We show that these theories arise as "Ehlers" $SL(2,\mathbb{R})$ and $SL(3,\mathbb{R})$ truncations of the maximal…

High Energy Physics - Theory · Physics 2017-07-26 Alessio Marrani , Gianfranco Pradisi , Fabio Riccioni , Luca Romano

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