Cut elimination for Zermelo’s set theory (2006)

Cached

Download Links

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

Active Bibliography

1 Superdeduction at Work – Paul Brauner, Clément Houtmann, Claude Kirchner, Ens Cachan, Université Henri Poincaré
2 Regaining Cut Admissibility in Deduction Modulo using Abstract Completion – Guillaume Burel , Claude Kirchner - 2009
Resolution is cut-free – unknown authors
2 Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo – Guillaume Burel, Nancy-université Loria
1 A Semantic Proof that Reducibility Candidates entail Cut Elimination – Denis Cousineau, Olivier Hermant
On the Expressive Power of Schemes – Gilles Dowek, Ying Jiang
3 Unbounded proof-length speed-up in deduction modulo – Guillaume Burel - 2007
5 Truth value algebras and proof normalization – Gilles Dowek - 2006
A Semantic Normalization Proof for Inductive Types – Lisa Allali, Paul Brauner - 2008
DOI: 10.4230/LIPIcs.RTA.2012.133 A Semantic Proof that Reducibility Candidates entail Cut Elimination – Denis Cousineau, Olivier Hermant - 2012
Rho-Calculi for Computation and Logic – Claude Kirchner, John Mccarthy
3 A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory – Alexandre Miquel
Discipline de types ∼ Logique Type ∼ Formule – Jean Goubault-larrecq, Le Août, Terme Preuve
Aspects logiques – Jean Goubault-larrecq, Terme Preuve
Consistency Implies Cut Admissibility – Guillaume Burel - 2011
4 Strategic Computation and Deduction – Claude Kirchner, Florent Kirchner, Hélène Kirchner, Peter B. Andrews - 2009
Expressing Set Theory in First-Order Predicate Logic – Stéphane Vaillant - 2000
Some general results about proof normalization – Marc Aiguier, Delphine Longuet
A semantic method . . . from weak normalization – Denis Cousineau