Computational isomorphisms in classical logic

DOI10.1016/S0304-3975(01)00148-7zbMath1029.03047OpenAlexW1990718046MaRDI QIDQ1398471

Vincent Danos, Jean-Baptiste Joinet, Harold Schellinx

Publication date: 29 July 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00148-7

zbMATH Keywords

Proof theoryClassical logicLinear logic

Mathematics Subject Classification ID

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

Related Items

Kripke models for classical logic ⋮ Proof Transformations and Structural Invariance ⋮ Polarized and focalized linear and classical proofs

Cites Work

• Unnamed Item
• Unnamed Item
• A new constructive logic: classic logic
• A new deconstructive logic: linear logic
• Proofs of strong normalisation for second order classical natural deduction