8 citations · 24 across the 9 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.LO2016★ 3 cited
The problem of Pi_2-cut-introduction
Alexander Leitsch, Michael Peter Lettmann
We describe an algorithmic method of proof compression based on the introduction of Pi_2-cuts into a cut-free LK-proof. The current approach is based on an inversion of Gentzen s c…
math.LO2016★ 1 cited
Schematic Cut elimination and the Ordered Pigeonhole Principle [Extended Version]
David Cerna, Alexander Leitsch
In previous work, an attempt was made to apply the schematic CERES method [8] to a formal proof with an arbitrary number of Π 2 cuts (a recursive proof encapsulating the infinitary…