Proof nets for classical logic

DOI10.1215/00294527-2021-0016MaRDI QIDQ1982017zbMATH OpenOpenAlexFDO

Authors Stefano Guerrini, Andrea Masini

Publication date 7 September 2021

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1215/00294527-2021-0016

zbMATH Keywords

classical logicproof netsproof theory

Mathematics Subject Classification ID

Proof theory in general (including proof-theoretic semantics) (03F03) Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07)

Recommendations

• Proof Nets for Classical Logic
• Expansion nets: proof-nets for propositional classical logic
• Canonical proof nets for classical logic
• scientific article; zbMATH DE number 937366
• What is the problem with proof nets for classical logic?

Cites work

• A focused approach to combining logics
• A new constructive logic: classic logic
• A new deconstructive logic: linear logic
• Canonical proof nets for classical logic
• Control categories and duality: On the categorical semantics of the lambda-mu calculus
• Focusing and polarization in linear, intuitionistic, and classical logics
• From syntactic proofs to combinatorial proofs
• scientific article; zbMATH DE number 1324438 (Why is no real title available?)
• scientific article; zbMATH DE number 1342282 (Why is no real title available?)
• scientific article; zbMATH DE number 786485 (Why is no real title available?)
• scientific article; zbMATH DE number 786495 (Why is no real title available?)
• Linear logic
• Locus solum: From the rules of logic to the logic of rules.
• Logic Programming with Focusing Proofs in Linear Logic
• On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem
• Parsing MELL proof nets
• Polarized and focalized linear and classical proofs
• Polarized proof-nets and \(\lambda \mu\)-calculus
• Proof Nets for Classical Logic
• Proofs of strong normalisation for second order classical natural deduction
• Proofs without syntax
• Proofs, tests and continuation passing style
• Strong normalisation of cut-elimination in classical logic
• Strong normalization property for second order linear logic
• The duality of computation
• The structure of multiplicatives
• Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
• Typed Lambda Calculi and Applications

Cited in

(1)

• Proof Nets for Classical Logic

This page was built for publication: Proof nets for classical logic

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