The following pages link to (Q3687693):
Displaying 6 items.
- Proof by consistency (Q1094888) (← links)
- History and basic features of the critical-pair/completion procedure (Q1103414) (← links)
- Only prime superpositions need be considered in the Knuth-Bendix completion procedure (Q1106657) (← links)
- Computing a Gröbner basis of a polynomial ideal over a Euclidean domain (Q1111629) (← links)
- Syntax-guided rewrite rule enumeration for SMT solvers (Q2181939) (← links)
- Type Theory Unchained : Extending Agda with User-Defined Rewrite Rules (Q6079228) (← links)