Results 131 to 140 of about 83,510 (168)
Some of the next articles are maybe not open access.
Linearization of the BCK-logic
Studia Logica, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francisco Miguel García-Olmedo +1 more
openaire +1 more source
Studia Logica, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
IEEE Transactions on Electronic Computers, 1961
Techniques are developed for the logical design of magnetic core circuits to produce arbitrary single-output combinational switching functions. The approach is based on the relationship of a single magnetic core circuit to a linearly separable switching function.
openaire +1 more source
Techniques are developed for the logical design of magnetic core circuits to produce arbitrary single-output combinational switching functions. The approach is based on the relationship of a single magnetic core circuit to a linearly separable switching function.
openaire +1 more source
1993
Abstract In this tutorial we present a very elementary introduction to linear logic, consisting of a description of the system, a sketch of cut-elimination, a discussion of the relationship with intuitionistic logic (embedding theorems), a sketch of completeness for algebraic semantics, and some remarks on the computational ...
openaire +2 more sources
Abstract In this tutorial we present a very elementary introduction to linear logic, consisting of a description of the system, a sketch of cut-elimination, a discussion of the relationship with intuitionistic logic (embedding theorems), a sketch of completeness for algebraic semantics, and some remarks on the computational ...
openaire +2 more sources
Logic Journal of IGPL, 1998
The restricted use of weakening and contraction rules makes provability in Linear Logic (LL) sensitive to the number of occurrences of a formula in a sequent (one often says that LL is ``resource sensitive''). This suggests to look for a semantics of formulas for LL making use of the notion of multiset: a multiset over a set \(A\) is a function from ...
openaire +1 more source
The restricted use of weakening and contraction rules makes provability in Linear Logic (LL) sensitive to the number of occurrences of a formula in a sequent (one often says that LL is ``resource sensitive''). This suggests to look for a semantics of formulas for LL making use of the notion of multiset: a multiset over a set \(A\) is a function from ...
openaire +1 more source
Linear proofs and linear logic
2005In [3] a modification of the Connection Method [2] called Linear Proofs was introduced which constituted a new logical approach to plan generation. Inspired by this idea in [7] a similar approach based on Linear Logic was presented. The present paper analyses the relationship of these two approaches and shows to which extent they are equivalent and ...
openaire +1 more source
A new deconstructive logic: linear logic
Journal of Symbolic Logic, 1997AbstractThe main concern of this paper is the design of a noetherian and confluent normalization for LK2 (that is, classical second order predicate logic presented as a sequent calculus).The method we present is powerful: since it allows us to recover as fragments formalisms as seemingly different as Girard's LC and Parigot's λμ, FD ([10, 12, 32, 36]),
Vincent Danos +2 more
openaire +3 more sources
ACM SIGPLAN Notices, 1994
The linear style of programming inspired by linear logic has been proposed to reduce garbage collection and synchronization costs in serial and parallel systems. We programmed Quicksort for both lists and arrays in a "linear" fragment of Lisp to estimate the performance impact of linearity on
openaire +1 more source
The linear style of programming inspired by linear logic has been proposed to reduce garbage collection and synchronization costs in serial and parallel systems. We programmed Quicksort for both lists and arrays in a "linear" fragment of Lisp to estimate the performance impact of linearity on
openaire +1 more source
Mathematical Logic Quarterly, 2014
We define a special family of Brouwerian logics determined by linearly ordered frames. Then we prove that all logics of this family have the finite model property and are Kripke complete.
openaire +1 more source
We define a special family of Brouwerian logics determined by linearly ordered frames. Then we prove that all logics of this family have the finite model property and are Kripke complete.
openaire +1 more source
1994
There is a standard syntax for Girard's linear logic, due to Abramsky, and a standard semantics, due to Seely. Alas, the former is incoherent with the latter: different derivations of the same syntax may be assigned different semantics. This paper reviews the standard syntax and semantics, and discusses the problem that arises and a standard approach ...
openaire +1 more source
There is a standard syntax for Girard's linear logic, due to Abramsky, and a standard semantics, due to Seely. Alas, the former is incoherent with the latter: different derivations of the same syntax may be assigned different semantics. This paper reviews the standard syntax and semantics, and discusses the problem that arises and a standard approach ...
openaire +1 more source