Contraction-free proofs and finitary games for linear logic
type: Item
instance of: scholarly article
zbMATH Open document ID: 1337.03088
author: Michel Hirschowitz
author: Tom Hirschowitz
author: André Hirschowitz
published in: Electronic Notes in Theoretical Computer Science
publication date: 2016-05-10T00:00:00Z
full work available at URL: https://arxiv.org/abs/0905.4064
Mathematics Subject Classification ID: 03F52
Mathematics Subject Classification ID: 03F05
zbMATH DE Number: 6578706
zbMATH Keywords: linear logic
zbMATH Keywords: game semantics
zbMATH Keywords: contraction elimination
MaRDI profile type: Publication
OpenAlex ID: W2150101840
arXiv ID: 0905.4064
cites work: Games and full completeness for multiplicative linear logic
cites work: A game semantics for linear logic
cites work: Normalization without reducibility
cites work: A short proof of the strong normalization of classical natural deduction with disjunction
cites work: Contraction-free sequent calculi for intuitionistic logic
cites work: Admissibility of structural rules for extensions of contraction-free sequent calculi
cites work: Linear logic
cites work: Locus solum: From the rules of logic to the logic of rules.
cites work: A Theory for Game Theories
cites work: Contraction-elimination for implicational logics
cites work: The linear abstract machine
cites work: Corrigenda to: ``The linear abstract machine''
DOI: 10.1016/J.ENTCS.2009.07.095
title: Contraction-free proofs and finitary games for linear logic
description: scientific article; zbMATH DE number 6578706