Revision as of 19:25, 19 March 2009

Light linear logics are variants of linear logic characterizing complexity classes. They are designed by defining alternative exponential connectives, which induce a complexity bound on the cut-elimination procedure.
Light linear logics are one of the approaches used in implicit computational complexity, the area studying the computational complexity of programs without referring to external measuring conditions or particular machine models.

Elementary linear logic

We present here the intuitionistic version of elementary linear logic, ELL. Moreover we restrict to the fragment without additive connectives.
The language of formulas is the same one as that of (multiplicative) ILL:

$A ::= X \mid A\tens A \mid A\limp A \mid \oc{A} \mid \forall X A$
The sequent calculus rules are the same ones as for ILL, except for the rules dealing with the exponential connectives:

$\AxRule{\Gamma\vdash A} \LabelRule{\oc } \UnaRule{\oc{\Gamma}\vdash\oc{A}} \DisplayProof \qquad \AxRule{\Gamma,\oc{A},\oc{A}\vdash C} \LabelRule{\oc c L} \UnaRule{\Gamma,\oc{A}\vdash C} \DisplayProof \qquad \AxRule{\Gamma\vdash C} \LabelRule{\oc w L} \UnaRule{\Gamma,\oc{A}\vdash C} \DisplayProof$

The depth of a derivation $π$ is the maximum number of $(\oc)$ rules in a branch of $π$ .

We consider the function $K (.,.)$ defined by:
$K(0,n)=n, \quad K(k+1,n)=2^{K(k,n)}$ .

Theorem

If $π$ is an ELL proof of depth d, and R is the corresponding ELL proof-net, then R can be reduced to its normal form by cut elimination in at most $K (d + 1, | π | )$ steps, where $| π |$ is the size of $π$ .

A function f on integers is elementary recursive if there exists an integer h and a Turing machine which computes f in time bounded by $K (h, n)$ , where n is the size of the input.

Theorem

The functions representable in ELL are exactly the elementary recursive functions.

One also often considers the affine variant of ELL, called elementary affine logic EAL, which is defined by adding unrestricted weakening:

$\AxRule{\Gamma\vdash C} \LabelRule{ w L} \UnaRule{\Gamma,A\vdash C} \DisplayProof$

It enjoys the same properties as ELL.

Light linear logic

We present the intuitionistic version of light linear logic LLL, without additive connectives. The language of formulas is:

$A ::= X \mid A\tens A \mid A\limp A \mid \oc{A} \mid \pg{A} \mid \forall X A$
The sequent calculus rules are the same ones as for ILL, except for the rules dealing with the exponential connectives:

$\AxRule{\Gamma\vdash A} \LabelRule{\oc } \UnaRule{\oc{\Gamma}\vdash\oc{A}} \DisplayProof \qquad \AxRule{\Gamma, \Delta\vdash A} \LabelRule{\pg } \UnaRule{\oc{\Gamma}, \pg \Delta\vdash\pg{A}} \DisplayProof \qquad \AxRule{\Gamma,\oc{A},\oc{A}\vdash C} \LabelRule{\oc c L} \UnaRule{\Gamma,\oc{A}\vdash C} \DisplayProof \qquad \AxRule{\Gamma\vdash C} \LabelRule{\oc w L} \UnaRule{\Gamma,\oc{A}\vdash C} \DisplayProof$

In the $(\oc)$ rule, $Γ$ must contain at most one formula.

The depth of a derivation $π$ is the maximum number of $(\oc)$ and $(\pg)$ rules in a branch of $π$ .

Theorem

If $π$ is an LLL proof of depth d, and R is the corresponding LLL proof-net, then R can be reduced to its normal form by cut elimination in $O((d+1)|\pi|^{2^{d+1}})$ steps, where $| π |$ is the size of $π$ .

The class FP is the class of functions on binary lists which are computable in polynomial time on a Turing machine.

Theorem

The class of functions on binary lists representable in LLL is exactly FP.

In the literature one also often considers the affine variant of LLL, called light affine logic, LAL.

Soft linear logic

We consider the intuitionistic version of soft linear logic, SLL.

The language of formulas is the same one as that of ILL: $A ::= X \mid A\tens A \mid A\limp A \mid A\with A \mid A\plus A \mid \oc{A} \mid \forall X A$
The sequent calculus rules are the same ones as for ILL, except for the rules dealing with the exponential connectives:

$\AxRule{\Gamma\vdash A} \LabelRule{\oc } \UnaRule{\oc{\Gamma}\vdash\oc{A}} \DisplayProof \qquad \AxRule{\Gamma,A^{(n)}\vdash C} \LabelRule{mplex} \UnaRule{\Gamma,\oc{A}\vdash C} \DisplayProof$

The rule mplex is the multiplexing rule. In its premise, $A (n)$ stands for n occurrences of formula $A$ . As particular instances of mplex for $n = 0$ and 1 respectively, we get weakening and dereliction:

$\AxRule{\Gamma \vdash C} \UnaRule{\Gamma,\oc{A}\vdash C} \DisplayProof \qquad \AxRule{\Gamma,A\vdash C} \UnaRule{\Gamma,\oc{A}\vdash C} \DisplayProof$

The depth of a derivation $π$ is the maximum number of $(\oc)$ rules in a branch of $π$ .

Theorem

If $π$ is an SLL proof of depth d, and R is the corresponding SLL proof-net, then R can be reduced to its normal form by cut elimination in $O ( | π | d))$ steps, where $| π |$ is the size of $π$ .

Theorem

The class of functions on binary lists representable in SLL is exactly FP.

Revision as of 19:22, 19 March 2009 (view source) Patrick Baillot (Talk \| contribs) ← Older edit		Revision as of 19:25, 19 March 2009 (view source) Patrick Baillot (Talk \| contribs) Newer edit →
Line 102:		Line 102:
	}}		}}

−	In the literature one also often considers the ''affine'' variant of LLL, called ''light affine logic'' LAL.	+	In the literature one also often considers the ''affine'' variant of LLL, called ''light affine logic'', LAL.

Light linear logics

Revision as of 19:25, 19 March 2009

Elementary linear logic

Light linear logic

Soft linear logic

Views

Personal tools

Navigation

Search

Tools