scientific article; zbMATH DE number 1392281
From MaRDI portal
zbMath0945.03533MaRDI QIDQ4936120
No author found.
Publication date: 24 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Cut-elimination and normal-form theorems (03F05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)
Related Items
(Optimal) duplication is not elementary recursive, Petri nets, Horn programs, linear logic and vector games, Phase semantics and decidability of elementary affine logic, Linear logic automata, Light affine lambda calculus and polynomial time strong normalization, Light linear logics with controlled weakening: expressibility, confluent strong normalization, Linear logic and elementary time, Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic, Light logics and optimal reduction: completeness and complexity, Soft linear set theory, Decision problems for propositional linear logic, Polynomial time in untyped elementary linear logic, Gödel's system \(\mathcal T\) revisited, Type inference for light affine logic via constraints on words, Light Linear Logic with Controlled Weakening, Light types for polynomial time computation in lambda calculus, Type Inference for a Polynomial Lambda Calculus, Stratified coherence spaces: A denotational semantics for light linear logic, Soft linear logic and polynomial time, On an interpretation of safe recursion in light affine logic, Quantum implicit computational complexity, Proof-Theoretic Semantics and Feasibility, Implicit computation complexity in higher-order programming languages
