Polynomial time in untyped elementary linear logic
type: Item
instance of: scholarly article
title: Polynomial time in untyped elementary linear logic
zbMATH Open document ID: 1481.03067
author: Olivier Laurent
published in: Theoretical Computer Science
publication date: 2020-04-21T00:00:00Z
Mathematics Subject Classification ID: 03F52
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 7191311
zbMATH Keywords: implicit computational complexity
zbMATH Keywords: polynomial-time computation
zbMATH Keywords: elementary linear logic
zbMATH Keywords: proof nets
zbMATH Keywords: strong normalization
MaRDI profile type: Publication
full work available at URL: j.tcs.2019.10.002
OpenAlex ID: W2979384293
cites work: Linear logic
cites work: Light linear logic
cites work: Soft linear logic and polynomial time
cites work: Linear logic and elementary time
cites work: An Implicit Characterization of PSPACE
cites work: Stratified coherence spaces: A denotational semantics for light linear logic
cites work: Q3646423
cites work: On the expressivity of elementary linear logic: characterizing Ptime and an exponential time hierarchy
cites work: Q4936120
cites work: Q3994895
cites work: Intuitionistic Light Affine Logic
cites work: Theoretical Computer Science
cites work: On light logics, uniform encodings and polynomial time
cites work: A semantic measure of the execution time in linear logic
cites work: The structure of multiplicatives
cites work: Context semantics, linear logic, and computational complexity
cites work: Q4799892
Wikidata QID: Q127091685
DOI: 10.1016/J.TCS.2019.10.002
description: scientific article; zbMATH DE number 7191311