Sciweavers

41 search results - page 5 / 9
» Focused Proof Search for Linear Logic in the Calculus of Str...
Sort
View
ENTCS
2011
129views more  ENTCS 2011»
13 years 3 months ago
Specifying Proof Systems in Linear Logic with Subexponentials
In the past years, linear logic has been successfully used as a general logical framework for encoding proof systems. Due to linear logic’s finer control on structural rules, i...
Vivek Nigam, Elaine Pimentel, Giselle Reis
CSL
2010
Springer
13 years 9 months ago
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
Damien Pous
CSL
2005
Springer
14 years 2 months ago
Permutative Logic
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
Jean-Marc Andreoli, Gabriele Pulcini, Paul Ruet
ICFP
2012
ACM
11 years 11 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
CSL
2003
Springer
14 years 1 months ago
Atomic Cut Elimination for classical Logic
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explici...
Kai Brünnler