Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(1)
Large Scale
Related Publications
(7)
Linear logic
On the piCalculus and Linear Logic
Proofnets: the parallel syntax for proof theory
From ProofNets to Interaction Nets
Correctness of Multiplicative Proof Nets Is Linear
Subscribe
Academic
Publications
The structure of multiplicatives
The structure of multiplicatives,10.1007/BF01622878,Archive for Mathematical Logic,Vincent Danos,Laurent Regnier
Edit
The structure of multiplicatives
(
Citations: 171
)
BibTex

RIS

RefWorks
Download
Vincent Danos
,
Laurent Regnier
Investigating Girard's new propositionnal calculus which aims at a
large scale
study of computation, we stumble quickly on that question: What is a multiplicative connective? We give here a detailed answer together with our motivations and expectations.
Journal:
Archive for Mathematical Logic  Arch. Math. Log.
, vol. 28, no. 3, pp. 181203, 1989
DOI:
10.1007/BF01622878
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.springerlink.com
)
(
www.springerlink.com
)
More »
Citation Context
(85)
...A correctness criterion is a test that, given a proof structure N, answers yes when N is a proof net and no when there is no sequentialization of N. The DanosRegnier switching condition is the most known correctness criterion: let a switch of N be the graph obtained by disconnecting one of the premises of each Olink; then N is a proof net i every switch of N is a tree [
3
]...
Stefano Guerrini
.
A linear algorithm for MLL proof net correctness and sequentialization
...Another important new feature of linear logic was the fact that it had a manifestly geometrical aspect to it, which translated in purely diagrammatic characterisations of linear logic proofs and of proof transformations
18
...
Bob Coecke
.
Quantum picturalism
...Due to their “graphical nature”, atomic flows can be seen as relatives of Girard’s proof nets [8,
6
] and Buss’ logical flow graphs [5]...
Alessio Guglielmi
,
et al.
Breaking Paths in Atomic Flows for Classical Logic
...For example, the switching criterion [
17
]: A (wellformed) proof net is the translation of a sequent proof if and only if each of its switchings is a connected and acyclic graph, where a switching of a proof net π is a graph that is obtained from π by removing for each ∨node and each contnode one of the two edges connecting it to its children...
Lutz Straßburger
.
What Is the Problem with Proof Nets for Classical Logic?
...condition for multiplicative proof structures, and how it leads to a proof of sequentialization for MLL − + Mix proof nets [
5
,6]...
Richard McKinley
.
Expansion Nets: ProofNets for Propositional Classical Logic
References
(3)
Linear logic
(
Citations: 2031
)
Jeanyves Girard
Journal:
Theoretical Computer Science  TCS
, vol. 50, no. 1, pp. 1102, 1987
Towards a geometry of interaction
(
Citations: 102
)
J. Y Girard
Conference:
Computer Science Logic  CSL
, 1989
Quantifiers in linear logic
(
Citations: 26
)
J. Y. Girard
Published in 1987.
Sort by:
Citations
(171)
A semantic measure of the execution time in linear logic
(
Citations: 4
)
Daniel de Carvalho
,
Michele Pagani
,
Lorenzo Tortora de Falco
Journal:
Theoretical Computer Science  TCS
, vol. 412, no. 20, pp. 18841902, 2011
Intuitionistic differential nets and lambdacalculus
(
Citations: 2
)
Paolo Tranquilli
Journal:
Theoretical Computer Science  TCS
, vol. 412, no. 20, pp. 19791997, 2011
Light logics and optimal reduction: Completeness and complexity
Patrick Baillot
,
Paolo Coppola
,
Ugo Dal Lago
Journal:
Information and Computation/information and Control  IANDC
, vol. 209, no. 2, pp. 118142, 2011
Correctness of linear logic proof structures is NLcomplete
Paulin Jacobé de Naurois
,
Virgile Mogbil
Journal:
Theoretical Computer Science  TCS
, vol. 412, no. 20, pp. 19411957, 2011
A linear algorithm for MLL proof net correctness and sequentialization
Stefano Guerrini
Journal:
Theoretical Computer Science  TCS
, vol. 412, no. 20, pp. 19581978, 2011