Proof nets for classical logic
From MaRDI portal
Publication:1982017
DOI10.1215/00294527-2021-0016OpenAlexW3171554509MaRDI QIDQ1982017
Andrea Masini, Stefano Guerrini
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
Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07) Proof theory in general (including proof-theoretic semantics) (03F03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On natural deduction in classical first-order logic: Curry-Howard correspondence, strong normalization and Herbrand's theorem
- Polarized and focalized linear and classical proofs
- Linear logic
- A focused approach to combining logics
- Focusing and polarization in linear, intuitionistic, and classical logics
- Strong normalization property for second order linear logic
- The structure of multiplicatives
- From syntactic proofs to combinatorial proofs
- Polarized proof-nets and \(\lambda \mu\)-calculus
- Canonical proof nets for classical logic
- Proofs without syntax
- Control categories and duality: on the categorical semantics of the lambda-mu calculus
- Locus Solum: From the rules of logic to the logic of rules
- The duality of computation
- Proofs, tests and continuation passing style
- A new constructive logic: classic logic
- Logic Programming with Focusing Proofs in Linear Logic
- A new deconstructive logic: linear logic
- Proofs of strong normalisation for second order classical natural deduction
- Proof Nets for Classical Logic
- Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
- Typed Lambda Calculi and Applications
- Parsing MELL proof nets
