Contraction-free Proofs and Finitary Games for Linear Logic

DOI10.1016/j.entcs.2009.07.095zbMath1337.03088arXiv0905.4064OpenAlexW2150101840MaRDI QIDQ2805162

Tom Hirschowitz, Michel Hirschowitz, Andre Hirschowitz

Publication date: 10 May 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0905.4064

zbMATH Keywords

linear logicgame semanticscontraction elimination

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items

Contraction-free Proofs and Finitary Games for Linear Logic

Cites Work

• Linear logic
• Contraction-elimination for implicational logics
• The linear abstract machine
• Corrigenda to: ``The linear abstract machine
• A game semantics for linear logic
• Normalization without reducibility
• Locus Solum: From the rules of logic to the logic of rules
• Admissibility of structural rules for extensions of contraction-free sequent calculi
• Contraction-free Proofs and Finitary Games for Linear Logic
• Contraction-free sequent calculi for intuitionistic logic
• Games and full completeness for multiplicative linear logic
• A short proof of the strong normalization of classical natural deduction with disjunction
• A Theory for Game Theories