8 citations · 24 across the 9 of their papers we have counts for
Showing math.LOShow all
2 papers · 1 filter
math.LO2024★ 2 cited
Herbrand's Theorem in Refutation Schemata
Alexander Leitsch, Anela Lolic
An inductive proof can be represented as a proof schema, i.e. as a parameterized sequence of proofs defined in a primitive recursive way. A corresponding cut-elimination method, ca…
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…