On combinatorial proofs for logics of relevance and entailment

DOI10.1007/978-3-662-59533-6_1MaRDI QIDQ2303577zbMATH OpenOpenAlexFDO

Authors Matteo Acclavio, Lutz Straßburger

Publication date 4 March 2020

Full work available at URL https://hal.inria.fr/hal-02390426/file/CPrelevant.pdf

zbMATH Keywords

combinatorial proofsentailment logicproof theoryrelevant logicskew fibrations

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• From syntactic proofs to combinatorial proofs
• Combinatorial proofs for constructive modal logic
• On combinatorial proofs for modal logic
• Towards a combinatorial proof theory
• Combinatory logic and the semantics of substructural logics

Cited in

(2)

• Combinatorial proofs for constructive modal logic
• Exponentially handsome proof nets and their normalization

This page was built for publication: On combinatorial proofs for logics of relevance and entailment

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