scientific article

zbMath0973.03033MaRDI QIDQ2708316

Patrick Baillot, Marco Pedicini

Publication date: 23 November 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexitysemanticsresolutiongeometry of interactionelementary linear logicproof-netsalgebra of clauseselementarily bounded computations

Mathematics Subject Classification ID

Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (15)

Logarithmic space and permutations ⋮ Paths-based criteria and application to linear logic subsystems characterizing polynomial time ⋮ On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets ⋮ Interaction graphs: graphings ⋮ Linear logic and elementary time ⋮ Light logics and optimal reduction: completeness and complexity ⋮ A correspondence between maximal abelian sub-algebras and linear logic fragments ⋮ Light types for polynomial time computation in lambda calculus ⋮ Unnamed Item ⋮ Unary Resolution: Characterizing Ptime ⋮ Stratified coherence spaces: A denotational semantics for light linear logic ⋮ A structural approach to reversible computation ⋮ On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy ⋮ An abstract approach to stratification in linear logic ⋮ Implicit computation complexity in higher-order programming languages

This page was built for publication: