Cut elimination for Zermelo’s set theory (2006)


Download Links

by Gilles Dowek , Alexandre Miquel
Citations:3 - 0 self

Active Bibliography

λZ: Zermelo’s Set Theory as a PTS with 4 Sorts – Alexandre Miquel
5 Truth value algebras and proof normalization – Gilles Dowek - 2006
3 Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo – Guillaume Burel, Nancy-université Loria
3 Unbounded proof-length speed-up in deduction modulo – Guillaume Burel - 2007
2 Regaining Cut Admissibility in Deduction Modulo using Abstract Completion – Guillaume Burel , Claude Kirchner - 2009
1 A Semantic Proof that Reducibility Candidates entail Cut Elimination – Denis Cousineau, Olivier Hermant
1 Superdeduction at Work – Paul Brauner, Clément Houtmann, Claude Kirchner, Ens Cachan, Université Henri Poincaré
Rho-Calculi for Computation and Logic – Claude Kirchner, John Mccarthy
A Semantic Normalization Proof for Inductive Types – Lisa Allali, Paul Brauner - 2008