Computational isomorphisms in classical logic

DOI10.1016/S0304-3975(01)00148-7MaRDI QIDQ1398471zbMATH OpenOpenAlexFDO

Authors 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

Classical logicLinear logicProof theory

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1231529
• Isomorphic formulae in classical propositional logic
• Classical isomorphisms of types
• A new foundation of a complete Boolean equational logic
• On the computational complexity of some classical equivalence relations on boolean functions

Cites work

• scientific article; zbMATH DE number 1324438 (Why is no real title available?)
• scientific article; zbMATH DE number 482822 (Why is no real title available?)
• A new constructive logic: classic logic
• A new deconstructive logic: linear logic
• Proofs of strong normalisation for second order classical natural deduction

Cited in

(6)

• Isomorphic formulae in classical propositional logic
• Polarized and focalized linear and classical proofs
• A note on synonymy in proof-theoretic semantics
• Proof Transformations and Structural Invariance
• Kripke models for classical logic
• Procedural isomorphism, analytic information and  -conversion by value

This page was built for publication: Computational isomorphisms in classical logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1398471)