Results 31 to 40 of about 3,702,791 (303)

Categorical Proof Theory of Co-Intuitionistic Linear Logic [PDF]

Logical Methods in Computer Science, 2014
To provide a categorical semantics for co-intuitionistic logic one has to face the fact, noted by Tristan Crolard, that the definition of co-exponents as adjuncts of coproducts does not work in the category Set, where coproducts are disjoint unions ...
Gianluigi Bellin
doaj   +1 more source

Making first order linear logic a generating grammar [PDF]

Logical Methods in Computer Science, 2023
It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type calculus (ETTC)
Sergey Slavnov
doaj   +1 more source

Indexed linear logic and higher-order model checking [PDF]

Electronic Proceedings in Theoretical Computer Science, 2015
In recent work, Kobayashi observed that the acceptance by an alternating tree automaton A of an infinite tree T generated by a higher-order recursion scheme G may be formulated as the typability of the recursion scheme G in an appropriate intersection ...
Charles Grellois, Paul-André Melliès
doaj   +1 more source

Sequent Systems for Consequence Relations of Cyclic Linear Logics

Bulletin of the Section of Logic
Linear Logic is a versatile framework with diverse applications in computer science and mathematics. One intriguing fragment of Linear Logic is Multiplicative-Additive Linear Logic (MALL), which forms the exponential-free component of the larger ...
Paweł Płaczek
doaj   +1 more source

Taylor expansion in linear logic is invertible [PDF]

Logical Methods in Computer Science, 2018
Each Multiplicative Exponential Linear Logic (MELL) proof-net can be expanded into a differential net, which is its Taylor expansion. We prove that two different MELL proof-nets have two different Taylor expansions.
Daniel de Carvalho
doaj   +1 more source

Linear logic

Theoretical Computer Science, 1987
The paper contains, in reverse order, (A) a substantial contribution to proof theory, and (B) speculations on using proofs as parts of programs, interspersed by (C) diverse relations to the (logical) literature. Here are a few samples from this, at least, for the reviewer, very readable paper.
openaire   +2 more sources

Linear Temporal Logic for Regular Cost Functions [PDF]

Logical Methods in Computer Science, 2014
Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties.
Denis Kuperberg
doaj   +1 more source

Linear logic as a logic of computations

Annals of Pure and Applied Logic, 1994
The author gives a complete computational interpretation of several initial fragments of linear logic and, based on this interpretation, establishes precisely the complexity level of these fragments. He begins with the !-Horn fragment of linear logic, which uses only positive literals, the linear implication, the tensor product \(\otimes\) and the ...
openaire   +1 more source

Linear Logical Algorithms [PDF]

, 2008
Bottom-up logic programming can be used to declaratively specify many algorithms in a succinct and natural way, and McAllester and Ganzinger have shown that it is possible to define a cost semantics that enables reasoning about the running time of algorithms written as inference rules.
Robert J. Simmons, Frank Pfenning
openaire   +1 more source

Random logic programs: Linear model [PDF]

, 2014
This paper proposes a model, the linear model, for randomly generating logic programs with low density of rules and investigates statistical properties of such random logic programs. It is mathematically shown that the average number of answer sets for a
Wen, Larry, Wang, Kewen, Mu, Kedian, Wen, Lian   +3 more
core   +1 more source