Sciweavers

Share
JOLLI
1998
78views more  JOLLI 1998»
8 years 4 months ago
Proof Nets and the Complexity of Processing Center Embedded Constructions
This paper shows how proof nets can be used to formalize the notion of “incomplete dependency” used in psycholinguistic theories of the unacceptability of center-embedded const...
Mark Johnson
CORR
2006
Springer
104views Education» more  CORR 2006»
8 years 5 months ago
From Proof Nets to the Free *-Autonomous Category
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
François Lamarche, Lutz Straßburger
CORR
2008
Springer
104views Education» more  CORR 2008»
8 years 5 months ago
Graphical Presentations of Symmetric Monoidal Closed Theories
Abstract. We define a notion of symmetric monoidal closed (smc) theory, consisting of a smc signature augmented with equations, and describe the classifying categories of such theo...
Richard H. G. Garner, Tom Hirschowitz, Auré...
CSR
2008
Springer
8 years 7 months ago
A Semantic Proof of Polytime Soundness of Light Affine Logic
We define a denotational semantics for Light Affine Logic (LAL) which has the property that denotations of functions are polynomial time computable by construction of the model. Th...
Ugo Dal Lago, Martin Hofmann
CSL
2008
Springer
8 years 7 months ago
A Characterization of Hypercoherent Semantic Correctness in Multiplicative Additive Linear Logic
We give a graph theoretical criterion on multiplicative additive linear logic (MALL) cut-free proof structures that exactly characterizes those whose interpretation is a hypercliqu...
Paolo Tranquilli
CIE
2010
Springer
8 years 10 months ago
What Is the Problem with Proof Nets for Classical Logic?
This paper is an informal (and nonexhaustive) overview over some existing notions of proof nets for classical logic, and gives some hints why they might be considered to be unsatis...
Lutz Straßburger
TLCA
2005
Springer
8 years 10 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger
LPAR
2007
Springer
8 years 11 months ago
Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
Proof nets are a parallel syntax for sequential proofs of linear logic, firstly introduced by Girard in 1987. Here we present and intrinsic (geometrical) characterization of proof...
Roberto Maieli
TLCA
2009
Springer
8 years 11 months ago
Some Observations on the Proof Theory of Second Order Propositional Multiplicative Linear Logic
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...
Lutz Straßburger
books