8 citations · 8 across the 1 of their papers we have counts for
2 papers
math.LO2018
Expansion Trees with Cut
Federico Aschieri, Stefan Hetzl, Daniel Weller
Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view, it suggests a compact representation of proofs in classical first- and higher…
cs.LO2013★ 8 cited
CERES for First-Order Schemata
Cvetan Dunchev, Alexander Leitsch, Mikheil Rukhaia +1
The cut-elimination method CERES (for first- and higher-order classical logic) is based on the notion of a characteristic clause set, which is extracted from an LK-proof and is alw…