Removing cycles from proofs

DOI10.4230/LIPICS.CSL.2017.9zbMATH Open1434.03129MaRDI QIDQ5111176FDOQ5111176

Authors: Andrea Aler Tubella, Alessio Guglielmi, Benjamin Ralph 

Publication date: 26 May 2020

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

zbMATH Keywords

proof theoryproof complexitydeep inference

Mathematics Subject Classification ID

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

Cited In (5)

• Proof-graphs: a thorough cycle treatment, normalization and subformula property
• Title not available (Why is that?)
• The cost of a cycle is a square
• Title not available (Why is that?)
• Combinatorial flows as bicolored atomic flows

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)