English
Related papers

Related papers: Taylor expansion in linear logic is invertible

200 papers

In this paper, we integrate separation logic with Propositional Projection Temporal Logic (PPTL) to obtain a two-dimensional logic, namely PPTL$^{\tiny\mbox{SL}}$. The spatial dimension is realized by a decidable fragment of separation…

Logic in Computer Science · Computer Science 2015-07-31 Xu Lu , Zhenhua Duan , Cong Tian

The unified correspondence theory for distributive lattice expansion logics (DLE-logics) is specialized to strict implication logics. As a consequence of a general semantic consevativity result, a wide range of strict implication logics can…

Logic · Mathematics 2016-05-27 Minghui Ma , Zhiguang Zhao

Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies which "behave well" and react in the same way to a set of tests. The…

Logic in Computer Science · Computer Science 2015-07-01 Claudia Faggian , Michele Basaldella

A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal…

Logic in Computer Science · Computer Science 2007-06-25 Christophe Fouqueré

Computation Tree Logic (CTL) and its extensions CTL* and CTL+ are widely used in automated verification as a basis for common model checking tools. But while they can express many properties of interest like reachability, even simple…

Logic in Computer Science · Computer Science 2019-10-28 Jens Oliver Gutsfeld , Markus Müller-Olm , Christian Dielitz

In this paper, we introduce Linear Logic with a nondeterministic facility, which has a self-dual additive connective. In the system the proof net technology is available in a natural way. The important point is that nondeterminism in the…

Logic in Computer Science · Computer Science 2009-09-29 Satoshi Matsuoka

In this paper we considered the extension of the First-order Logic (FOL) by Bealer's intensional abstraction operator. Contemporary use of the term 'intension' derives from the traditional logical Frege-Russell's doctrine that an idea…

Logic in Computer Science · Computer Science 2011-03-07 Zoran Majkic

Full Intuitionistic Linear Logic (FILL) is multiplicative intuitionistic linear logic extended with par. Its proof theory has been notoriously difficult to get right, and existing sequent calculi all involve inference rules with complex…

Logic in Computer Science · Computer Science 2013-07-19 Ranald Clouston , Jeremy Dawson , Rajeev Gore , Alwen Tiu

This work is devoted to dissipative extension theory for dissipative linear relations. We give a self-consistent theory of extensions by generalizing the theory on symmetric extensions of symmetric operators. Several results on the…

Mathematical Physics · Physics 2018-11-28 Josué I. Rios-Cangas , Luis O. Silva

There are exactly two maximal schematic extensions of the relevant logic R with the variable sharing property. We establish that one of them has a strong form of interpolation for deducibility, thereby giving an example of a well-known…

Logic · Mathematics 2025-12-01 Wesley Fussner , Andrew Tedder

In this paper, we discuss the capable and isoclinic properties of the tensor square in the context of multiplicative Lie algebras. We also developed the concept of isoclinic extensions and proved several results for multiplicative Lie…

Group Theory · Mathematics 2024-06-05 Dev Karan Singh , Amit Kumar , Sumit Kumar Upadhyay , Shiv Datt Kumar

Handsome proof nets were introduced by Retor\'e as a syntax for multiplicative linear logic. These proof nets are defined by means of cographs (graphs representing formulas) equipped with a vertices partition satisfying simple topological…

Logic in Computer Science · Computer Science 2022-01-03 Matteo Acclavio

Linear properties are ubiquitous in the representations of language models; however, testing them experimentally remains a challenging task. This work focuses on relational linearity: the hypothesis that, for a fixed relation (e.g.,…

Machine Learning · Computer Science 2026-05-26 Giovanni Valer , Luigi Gresele , Marco Bronzini , Emanuele Marconato

Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) extend Linear Temporal Logic (LTL) for real-time constraints, with MTL using time-bounded modalities and TPTL employing freeze quantifiers. Satisfiability for both is…

Logic in Computer Science · Computer Science 2024-11-04 Shankara Narayanan Krishna , Khushraj Madnani , Agnipratim Nag , Paritosh Pandya

We study nonlinear connectives (exponentials) in the context of Type Logical Grammar (TLG). We devise four conservative extensions of the displacement calculus with brackets, DbC, DbCM, DbCb and DbCbMr which contain the universal and…

Logic in Computer Science · Computer Science 2017-06-12 Glyn Morrill , Oriol Valentín

The notion of a non-deterministic logical matrix (where connectives are interpreted as multi-functions) extends the traditional semantics for propositional logics based on logical matrices (where connectives are interpreted as functions).…

Logic · Mathematics 2024-12-19 Carlos Caleiro , Pedro Filipe , Sérgio Marcelino

We give a linear nested sequent calculus for the basic normal tense logic Kt. We show that the calculus enables backwards proof-search, counter-model construction and syntactic cut-elimination. Linear nested sequents thus provide the…

Logic in Computer Science · Computer Science 2019-07-03 Rajeev Goré , Björn Lellmann

(Maher 2012) introduced an approach for relative expressiveness of defeasible logics, and two notions of relative expressiveness were investigated. Using the first of these definitions of relative expressiveness, we show that all the…

Logic in Computer Science · Computer Science 2024-05-15 Michael J. Maher

Exploded layered tropical (ELT) algebra is an extension of tropical algebra with a structure of layers. These layers allow us to use classical algebraic results in order to easily prove analogous tropical results. Specifically we study the…

Rings and Algebras · Mathematics 2017-12-27 Guy Blachar , Erez Sheiner

We construct a denotational model of linear logic, whose objects are all the locally convex and separated topological vector spaces endowed with their weak topology. The negation is interpreted as the dual, linear proofs are interpreted as…

Logic in Computer Science · Computer Science 2017-01-11 Marie Kerjean