Phase semantics and decidability of elementary affine logic
type: Item
instance of: scholarly article
title: Phase semantics and decidability of elementary affine logic
zbMATH Open document ID: 1047.03048
author: Ugo Dal Lago
author: Simone Martini
published in: Theoretical Computer Science
publication date: 2004-08-10T00:00:00Z
Mathematics Subject Classification ID: 03F52
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 68Q19
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 03F05
zbMATH DE Number: 2085478
zbMATH Keywords: Linear logic
zbMATH Keywords: Light linear logic
zbMATH Keywords: Soft linear logic
zbMATH Keywords: Optimal reduction
MaRDI profile type: Publication
full work available at URL: j.tcs.2004.02.037
OpenAlex ID: W2070294436
cites work: Q4936120
cites work: (Optimal) duplication is not elementary recursive
cites work: Q5397484
cites work: Intuitionistic Light Affine Logic
cites work: Q2778817
cites work: Q4457451
cites work: Linear logic and elementary time
cites work: Linear logic
cites work: Light linear logic
cites work: Bounded linear logic: A modular approach to polynomial-time computability
cites work: Phase semantics for light linear logic
cites work: Decidability of linear affine logic
cites work: The finite model property for various fragments of linear logic
cites work: Soft linear logic and polynomial time
cites work: Decision problems for propositional linear logic
cites work: Q4222841
cites work: Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic
cites work: A uniform semantic proof for cut-elimination and completeness of various first and higher order logics.
cites work: The finite model property for various fragments of intuitionistic linear logic
DOI: 10.1016/J.TCS.2004.02.037
description: scientific article; zbMATH DE number 2085478