Publication:2708316
From MaRDI portal
zbMath0973.03033MaRDI QIDQ2708316
Patrick Baillot, Marco Pedicini
Publication date: 23 November 2001
complexity; semantics; resolution; geometry of interaction; elementary linear logic; proof-nets; algebra of clauses; elementarily bounded computations
03B70: Logic in computer science
03F52: Proof-theoretic aspects of linear logic and other substructural logics
Related Items
Unnamed Item, A correspondence between maximal abelian sub-algebras and linear logic fragments, Implicit computation complexity in higher-order programming languages, Logarithmic space and permutations, Interaction graphs: graphings, Light logics and optimal reduction: completeness and complexity, Light types for polynomial time computation in lambda calculus, Linear logic and elementary time, Paths-based criteria and application to linear logic subsystems characterizing polynomial time, Stratified coherence spaces: A denotational semantics for light linear logic, On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy, An abstract approach to stratification in linear logic, A structural approach to reversible computation, Unary Resolution: Characterizing Ptime, On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets