scientific article; zbMATH DE number 7204450

DOI10.4230/LIPICS.FSCD.2017.31MaRDI QIDQ5111329zbMATH OpenFDO

Authors Lutz Straßburger

Publication date 26 May 2020

zbMATH Keywords

substitutioncut eliminationdeep inferenceproof equivalence

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1342282 (Why is no real title available?)
• scientific article; zbMATH DE number 1497485 (Why is no real title available?)
• scientific article; zbMATH DE number 786496 (Why is no real title available?)
• scientific article; zbMATH DE number 6157240 (Why is no real title available?)
• scientific article; zbMATH DE number 3313427 (Why is no real title available?)
• A Local System for Classical Logic
• A proposal for broad spectrum proof certificates
• Categorical combinators
• Coherence in closed categories
• Extension without cut
• From deep inference to proof nets via cut elimination
• Handsome proof-nets: Perfect matchings and cographs
• Linear logic
• Normalisation Control in Deep Inference via Atomic Flows
• On Matrices with Connections
• On the Power of Substitution in the Calculus of Structures
• On the proof complexity of deep inference
• Proof Nets for Classical Logic
• Proof nets and semi-star-autonomous categories
• Proofs without syntax
• Propositional proof systems, the consistency of first order theories and the complexity of computations
• Refutations by Matings
• Rewriting with linear inferences in propositional logic
• The relative efficiency of propositional proof systems
• The structure of multiplicatives
• Topology of series-parallel networks
• Towards Hilbert's 24th Problem: Combinatorial Proof Invariants
• Typed Lambda Calculi and Applications
• What is the problem with proof nets for classical logic?

Cited in

(13)

• Proofs without syntax
• Streams and strings in formal proofs.
• From syntactic proofs to combinatorial proofs
• Towards a combinatorial proof theory
• Normalization flow
• 3-flows and combs
• 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
• On combinatorial proofs for modal logic
• Combinatorial flows as bicolored atomic flows
• Normalization 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)