scientific article; zbMATH DE number 7204450

DOI10.4230/LIPIcs.FSCD.2017.31zbMath1434.03128MaRDI QIDQ5111329

Lutz Straßburger

Publication date: 26 May 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cut eliminationsubstitutiondeep inferenceproof equivalence

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Structure of proofs (03F07)

Related Items

An Analytic Propositional Proof System on Graphs ⋮ Combinatorial flows as bicolored atomic flows ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Extension without cut
• The structure of multiplicatives
• Handsome proof-nets: Perfect matchings and cographs
• Topology of series-parallel networks
• Proofs without syntax
• Coherence in closed categories
• On the proof complexity of deep inference
• On the Power of Substitution in the Calculus of Structures
• Rewriting with Linear Inferences in Propositional Logic
• A Local System for Classical Logic
• From Deep Inference to Proof Nets via Cut Elimination
• A Proposal for Broad Spectrum Proof Certificates
• Propositional proof systems, the consistency of first order theories and the complexity of computations
• Normalisation Control in Deep Inference via Atomic Flows
• What Is the Problem with Proof Nets for Classical Logic?
• Categorical combinators
• On Matrices with Connections
• Refutations by Matings
• The relative efficiency of propositional proof systems
• Proof Nets for Classical Logic
• Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
• Typed Lambda Calculi and Applications
• Proof nets and semi-star-autonomous categories