Turning cycles into spirals

DOI10.1016/S0168-0072(98)00031-1zbMath0923.03066OpenAlexW2014024837MaRDI QIDQ1295442

V. Pereyra

Publication date: 28 October 1999

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(98)00031-1

zbMATH Keywords

logical flow graphscycles in proofs

Mathematics Subject Classification ID

Structure of proofs (03F07) Complexity of proofs (03F20)

Related Items

The cost of a cycle is a square, Combinatorial flows as bicolored atomic flows, On the decision problem for MELL, On the form of witness terms, Cycling in proofs and feasibility, Streams and strings in formal proofs.

Cites Work

• Unnamed Item
• Unnamed Item
• Linear logic
• Interpolants, cut elimination and flow graphs for the propositional calculus
• Don't eliminate cut
• Lower bounds for increasing complexity of derivations after cut elimination
• The undecidability of \(k\)-provability
• Looking from the inside and from the outside
• Bounds for proof-search and speed-up in the predicate calculus
• Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination
• Cycling in proofs and feasibility
• The Universe of Set Theory
• Existence and feasibility in arithmetic