Removing cycles from proofs

DOI10.4230/LIPICS.CSL.2017.9MaRDI QIDQ5111176zbMATH OpenFDO

Authors Andrea Aler Tubella, Alessio Guglielmi, Benjamin Ralph

Publication date 26 May 2020

Full work available at URL https://doi.org/10.4230/LIPICS.CSL.2017.9

zbMATH Keywords

deep inferenceproof complexityproof theory

Mathematics Subject Classification ID

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

Recommendations

• The cost of a cycle is a square
• Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
• Proof-graphs: a thorough cycle treatment, normalization and subformula property
• Cut Elimination In Situ
• A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae

Cited in

(7)

• Turning cycles into spirals
• Proof-graphs: a thorough cycle treatment, normalization and subformula property
• The cost of a cycle is a square
• The sub-additives: a proof theory for probabilistic choice extending linear logic
• scientific article; zbMATH DE number 3212023 (Why is no real title available?)
• Combinatorial flows as bicolored atomic flows
• A strictly linear subatomic proof system

This page was built for publication: Removing cycles from proofs

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