Complementary proof nets for classical logic

DOI10.1007/S11787-023-00337-9MaRDI QIDQ6146288zbMATH OpenFDO

Authors Gabriele Pulcini, Achille C. Varzi

Publication date 10 January 2024

Published in Logica Universalis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11787-023-00337-9

zbMATH Keywords

cut eliminationproof netsclassical logicrefutation systems

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Proof theory in general (including proof-theoretic semantics) (03F03) Structure of proofs (03F07)

Cites work

• scientific article; zbMATH DE number 4210100 (Why is no real title available?)
• scientific article; zbMATH DE number 4158595 (Why is no real title available?)
• scientific article; zbMATH DE number 42059 (Why is no real title available?)
• scientific article; zbMATH DE number 949290 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 3241254 (Why is no real title available?)
• scientific article; zbMATH DE number 3274715 (Why is no real title available?)
• scientific article; zbMATH DE number 3327279 (Why is no real title available?)
• scientific article; zbMATH DE number 966896 (Why is no real title available?)
• scientific article; zbMATH DE number 7669420 (Why is no real title available?)
• A formal system for the non-theorems of the propositional calculus
• A minimal classical sequent calculus free of structural rules
• Canonical proof nets for classical logic
• Cut-elimination and deductive polarization in complementary classical logic
• Expansion nets: proof-nets for propositional classical logic
• Fractional semantics for classical logic
• Gentzen-type systems, resolution and tableaux
• Lectures on the Curry-Howard isomorphism
• Linear logic
• Logics of rejection: Two systems of natural deduction
• Normal proofs, cut free derivations and structural rules
• On refutation rules
• Paraconsistency in classical logic
• Proof Nets for Classical Logic
• Proofs without syntax
• Refutation systems in modal logic
• The structure of multiplicatives
• Untersuchungen über das logische Schliessen. I
• What is the problem with proof nets for classical logic?

Cited in

(3)

• Metainferences, invalidities and contraction-free sequent calculi for S5 and Carnap's C
• A hypersequent calculus for classical contingencies
• Fractional-Valued Modal Logic and Soft Bilateralism

This page was built for publication: Complementary proof nets for classical logic

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