The following pages link to (Q3783521):
Displaying 36 items.
- Modular termination of \(r\)-consistent and left-linear term rewriting systems (Q672714) (← links)
- Termination by completion (Q757069) (← links)
- Abstract abstract reduction (Q817587) (← links)
- Algebraic simulations (Q844884) (← links)
- Tyrolean termination tool: techniques and features (Q876042) (← links)
- Termination orderings for associative-commutative rewriting systems (Q1072371) (← links)
- Termination of rewriting (Q1098624) (← links)
- Counterexamples to termination for the direct sum of term rewriting systems (Q1107975) (← links)
- Associative-commutative reduction orderings (Q1198005) (← links)
- Modularity of simple termination of term rewriting systems with shared constructors (Q1199539) (← links)
- Proving termination of (conditional) rewrite systems. A semantic approach (Q1323317) (← links)
- Some results on the confluence property of combined term rewriting systems (Q1337642) (← links)
- Modular proofs for completeness of hierarchical term rewriting systems (Q1350349) (← links)
- A calculational approach to mathematical induction (Q1391737) (← links)
- Termination modulo equations by abstract commutation with an application to iteration (Q1391793) (← links)
- A path ordering for proving termination of AC rewrite systems (Q1891259) (← links)
- Modularity in term rewriting revisited (Q1929227) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids (Q2013556) (← links)
- Strategies for combining decision procedures (Q2368951) (← links)
- Modular Termination of Basic Narrowing (Q3522005) (← links)
- Finding small counterexamples for abstract rewriting properties (Q4585013) (← links)
- Transforming termination by self-labelling (Q4647535) (← links)
- Remarks on Isomorphisms of Simple Inductive Types (Q4924549) (← links)
- Incremental termination proofs and the length of derivations (Q5055748) (← links)
- Any ground associative-commutative theory has a finite canonical system (Q5055779) (← links)
- Extension of the associative path ordering to a chain of associative commutative symbols (Q5055809) (← links)
- Automatic termination proofs with transformation orderings (Q5055814) (← links)
- A complete characterization of termination of 0p 1q→1r 0s (Q5055817) (← links)
- Termination of constructor systems (Q5055852) (← links)
- On modularity in term rewriting and narrowing (Q5096311) (← links)
- Buchberger's algorithm: A constraint-based completion procedure (Q5096314) (← links)
- (Q5111315) (← links)
- Modal Tools for Separation and Refinement (Q5403464) (← links)
- Implementing term rewriting by graph reduction: Termination of combined systems (Q5881286) (← links)
