scientific article; zbMATH DE number 7204450

DOI10.4230/LIPICS.FSCD.2017.31zbMATH Open1434.03128MaRDI QIDQ5111329FDOQ5111329

Lutz Straßburger

Publication date: 26 May 2020

Title of this publication is not available (Why is that?)

zbMATH Keywords

substitutioncut eliminationdeep inferenceproof equivalence

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Streams and strings in formal proofs.
• 3-Flows and Combs
• Normalization flow
• Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination
• Exponentially handsome proof nets and their normalization
• The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem
• An Analytic Propositional Proof System on Graphs
• Combinatorial flows as bicolored atomic flows

   Recommendations

• From syntactic proofs to combinatorial proofs 👍 👎
• A new mapping between combinatorial proofs and sequent calculus proofs read out from logical flow graphs 👍 👎
• On combinatorial proofs for modal logic 👍 👎
• Normalisation Control in Deep Inference via Atomic Flows 👍 👎
• Proofs without syntax 👍 👎

This page was built for publication:

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