The following pages link to Proof normalization modulo (Q4650285):
Displaying 15 items.
- A simple proof that super-consistency implies cut elimination (Q691121) (← links)
- On the expressive power of schemes (Q719245) (← links)
- Resolution is cut-free (Q972424) (← links)
- Some general results about proof normalization (Q1931341) (← links)
- From the universality of mathematical truth to the interoperability of proof systems (Q2104491) (← links)
- First-order automated reasoning with theories: when deduction modulo theory meets practice (Q2209546) (← links)
- Regaining cut admissibility in deduction modulo using abstract completion (Q2266989) (← links)
- On the Convergence of Reduction-based and Model-based Methods in Proof Theory (Q2866742) (← links)
- Orthogonality and Boolean Algebras for Deduction Modulo (Q3007658) (← links)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← links)
- (Q4993349) (← links)
- (Q5005105) (← links)
- (Q5089014) (← links)
- A modular construction of type theories (Q5883738) (← links)
- Extensional proofs in a propositional logic modulo isomorphisms (Q6052705) (← links)
