scientific article; zbMATH DE number 2061714

zbMATH Open1039.68054MaRDI QIDQ4457461FDOQ4457461

Authors: François Maurel 

Publication date: 22 March 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2701/27010241.htm

Title of this publication is not available (Why is that?)

Recommendations

• On light logics, uniform encodings and polynomial time
• Soft linear logic and polynomial complexity classes
• Linear logic and polynomial time
• Theoretical Computer Science
• A Semantic Proof of Polytime Soundness of Light Affine Logic

zbMATH Keywords

NP complexitylight logicsimplicit characterisations of complexity classes

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cut-elimination and normal-form theorems (03F05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cited In (6)

• Title not available (Why is that?)
• An exact correspondence between a typed pi-calculus and polarised proof-nets
• Type inference for light affine logic via constraints on words
• Soft linear logic and polynomial complexity classes
• Linear additives
• Coherent interaction graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457461)