The following pages link to (Q4447217):
Displayed 7 items.
- Some general results about proof normalization (Q1931341) (← 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)
- Structure of proofs and the complexity of cut elimination (Q2368983) (← links)
- A Completion Method to Decide Reachability in Rewrite Systems (Q2964463) (← links)
- Automating Theories in Intuitionistic Logic (Q3655199) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)